~/talk

False Consensus, Information Theory, and Prediction Markets

Talkat ITCS 2023 · 2023-01-10..01-13· [machine-learning]
links:none on file
links:none on file
slides:none on file

Proves that when private signals are conditional independence (substitutes), any epsilon-approximate consensus (agents’ mutual information with outcome ≤ ε given history) implies ε·n approximate aggregation: the remaining information about the outcome is ≤ nε by mutual information subadditivity via interaction information and chain rules. Uses a potential function (mutual information of public history with outcome) to rederive fast convergence, and links to prediction markets where trades under the log scoring rule payments equal conditional mutual information.

AI-written summary · about

  1. 0:00Intro
  2. 1:09Agreement Protocol Example
  3. 2:49Agreement Theorem
  4. 3:15Questions
  5. 6:34Main Theorem
  6. 7:29High-Level Proof
  7. 9:41Information Theory Background
  8. 12:04Approximate Agreement
  9. 13:24Subadditivity for substitutes
  10. 16:20No False Consensus with Substitutes
  11. 18:52Quick Consensus
  12. 21:49Connection to Prediction Market
~/search
type to search 6,249 conferences, 138,987 speakers and 185,172 talks
~/help
cmdctrl k
search every conference, speaker and series
/
focus the filter search
h
home
c
conferences
s
speakers
e
series
t
light / dark — the status bar button does the same
?
this help
esc
close this, then clear every filter — or just the search, while you are typing in it

Ignored while you are typing. Pages without a filter rail have no search to focus.