seminar 04.03.2024

Skip to first unread message

Alexander Shen

Feb 23, 2024, 6:23:24 AMFeb 23
to Kolmogorov seminar on complexity
Seminar meeting: March 04, European time 16.30 (Moscow time 18.30)

Combinatorial rectangles, Kolmogorov complexity and experts' aggregation

There is a classical result in communication complexity saying that if
some communication protocol is applied to jointly distributed inputs a
and b, then the transcript \pi has a non-negative "triple information
with a and b". We will discuss its meaning, extension to partitions,
Kolmogorov complexity version for one rectangle, implication for a
combinatorial game and interpretation of this game in terms of
aggregation experts' opinions. (An _incomplete_ draft attached FYI)
Reply all
Reply to author
0 new messages