Pith. sign in

REVIEW 1 cited by

False Consensus, Information Theory, and Prediction Markets

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2206.02993 v2 pith:4CH6TOFJ submitted 2022-06-07 cs.GT econ.TH

classification cs.GTecon.TH
keywords informationagentsframeworkoutcomepredictionresultstheoreticwhen
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

We study a setting where Bayesian agents with a common prior have private information related to an event's outcome and sequentially make public announcements relating to their information. Our main result shows that when agents' private information is independent conditioning on the event's outcome whenever agents have similar beliefs about the outcome, their information is aggregated. That is, there is no false consensus. Our main result has a short proof based on a natural information theoretic framework. A key ingredient of the framework is the equivalence between the sign of the ``interaction information'' and a super/sub-additive property of the value of people's information. This provides an intuitive interpretation and an interesting application of the interaction information, which measures the amount of information shared by three random variables. We illustrate the power of this information theoretic framework by reproving two additional results within it: 1) that agents quickly agree when announcing (summaries of) beliefs in round robin fashion [Aaronson 2005]; and 2) results from [Chen et al 2010] on when prediction market agents should release information to maximize their payment. We also interpret the information theoretic framework and the above results in prediction markets by proving that the expected reward of revealing information is the conditional mutual information of the information revealed.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Computationally Efficient Collaborative Communication Via Regularity-Based Coarsening

    cs.GT 2026-08 conditional novelty 8.0 of 10

    If an optimal (even intractable) protocol achieves utility α in k bits, a polynomial-time algorithm can find a protocol achieving α−ε using 2^{O(k)}/ε^2 bits, and this is tight up to a constant in the exponent.

Pith tools