Combinatorial Rectangles, Kolmogorov Complexity and Experts' Aggregation - March 4, 2024

Learn about communication complexity protocols, triple information distribution, and expert opinion aggregation in this 2-hour seminar lecture from the prestigious Kolmogorov seminar series on computational complexity. Explore the classical result of communication protocols with jointly distributed inputs, examining their transcripts and non-negative triple information relationships. Delve into extensions covering partitions, Kolmogorov complexity applications for single rectangles, and discover how these concepts connect to combinatorial game theory. Understand the practical implications through the lens of aggregating expert opinions, building on the foundational work established by Kolmogorov's seminar series on computational and descriptional complexity since 1979.