The DOI matches its Crossref record; 41 of the 41 references it cites were found in a registry or an index.
Long Cheap Talk
Abstract
With cheap talk, more can be achieved by long conversations than by a single message—even when one side is strictly better informed than the other. (“Cheap talk” means plain conversation—unmediated, nonbinding, and payoff-irrelevant.) This work characterizes the equilibrium payoffs for all two-person games in which one side is better informed than the other and cheap talk is permitted.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Nash, J. (1951) · The Annals of Mathematics · doi:10.2307/1969529 · Cited by 7,002
Nash, J. (1989) · Cournot Oligopoly · doi:10.1017/cbo9780511528231.007 · Cited by 5,595
Mate selection—A selection for a handicap
Zahavi, A. (1975) · Journal of Theoretical Biology · doi:10.1016/0022-5193(75)90111-3 · Cited by 5,251
Strategic information transmission
Crawford, V. P., & Sobel, J. (1982) · Econometrica · doi:10.2307/1913390 · Cited by 4,293
How to generate and exchange secrets
Yao, A. C.-C. (1986) · 27th Annual Symposium on Foundations of Computer Science (sfcs 1986) · doi:10.1109/sfcs.1986.25 · Cited by 3,733
Goldreich, O., Micali, S., & Wigderson, A. (1987) · Proceedings of the nineteenth annual ACM conference on Theory of computing - STOC '87 · doi:10.1145/28395.28420 · Cited by 3,590
(2010) · The Review of Economic Studies · doi:10.1111/(issn)1467-937x · Cited by 2,966
Completeness theorems for non-cryptographic fault-tolerant distributed computation
Ben-Or, M., & Wigderson, A. (1988) · Proceedings of the twentieth annual ACM symposium on Theory of computing - STOC '88 · doi:10.1145/62212.62213 · Cited by 2,524
Subjectivity and Correlation in Randomized Strategies
Aumann, R. J. (1974) · Journal of Mathematical Economics · doi:10.1016/0304-4068(74)90037-8 · Cited by 1,630
Self-citationSecurity and Composition of Multiparty Cryptographic Protocols
Canetti, R. (2000) · Journal of Cryptology · doi:10.1007/s001459910006 · Cited by 1,403
Cited by
When Does Coordination Require Centralization?
Alonso, R., Dessein, W., & Matouschek, N. (2008) · American Economic Review · doi:10.1257/aer.98.1.145 · Cited by 623
Advantages of a polycentric approach to climate change policy
Cole, D. H. (2015) · Nature Climate Change · doi:10.1038/nclimate2490 · Cited by 345
Metadata
- Authors
- Aumann, R. J., & Hart, S.
- Venue
- Econometrica
- Publisher
- The Econometric Society
- Published
- 2003-11
- Volume
- 71
- Issue
- 6
- Pages
- 1619-1660
- ISSN
- 0012-9682 (ISSN-L)
- 1468-0262
- OpenAlex
- W2019681493
- Cited by
- 282
- References
- 41
- FWCI
- 21.71
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Long Cheap Talk. https://app.cochat.ai/papers/10.1111/1468-0262.00465
- The paper
- Aumann, R. J., & Hart, S. (2003). Long Cheap Talk. Econometrica. https://doi.org/10.1111/1468-0262.00465
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.
