Agreement Implies Accuracy for Substitutable Signals
Not on the map. Why?
Abstract (arXiv)
Inspired by Aumann's agreement theorem, Scott Aaronson studied the amount of communication necessary for two Bayesian experts to approximately agree on the expectation of a random variable. Aaronson showed that, remarkably, the number of bits does not depend on the amount of information available to each expert. However, in general the agreed-upon estimate may be inaccurate: far from the estimate they would settle on if they were to share all of their information. We show that if the experts' signals are substitutes -- meaning the experts' information has diminishing marginal returns -- then it is the case that if the experts are close to agreement then they are close to the truth. We prove this result for a broad class of agreement and accuracy measures that includes squared distance and KL divergence. Additionally, we show that although these measures capture fundamentally different kinds of agreement, Aaronson's agreement result generalizes to them as well.
Key facts. Cited by 5 papers in the map (data through 14 Oct 2026). First posted on arXiv 5 Nov 2021.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2024: 1; 2025: 2; 2026: 2.
5 papers.
- 2024Tractable Agreement Protocolscited by 13
- 2025Networked Information Aggregation via Machine Learningcited by 8
- 2025Emergent Alignment via Competitioncited by 5
- 2026Model Agreement via Anchoringcited by 1
- 2026Narrowing the Collaboration Gap, Probablycited by 0
- 2026Narrowing the Collaboration Gap, Probably13 Oct 2026
- 2026Model Agreement via Anchoring26 Feb 2026
- 2025Emergent Alignment via Competition18 Sep 2025
- 2025Networked Information Aggregation via Machine Learning13 Jul 2025
- 2024Tractable Agreement Protocols29 Nov 2024