Learning to agree over large state spaces
From MaRDI portal
Publication:2138382
DOI10.1016/j.jmateco.2022.102654zbMath1490.91025arXiv2105.06313OpenAlexW4211147351MaRDI QIDQ2138382
Publication date: 11 May 2022
Published in: Journal of Mathematical Economics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2105.06313
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Learning to agree
- Counterfactuals in ``agreeing to disagree type results
- On consensus through communication without a commonly known protocol
- Agreeing to disagree: the non-probabilistic case
- Common knowledge, communication, and convergence of beliefs
- Some extensions of a claim of Aumann in an axiomatic model of knowledge
- We eventually agree
- We can't disagree forever
- Agreeing to disagree
- A note on the implications of common knowledge of rationality
- Knowledge spaces with arbitrarily high rank
- Chains, antichains, and complements in infinite partition lattices
- Protocols forcing consensus
- Comment of consensus without common knowledge
- Consensus, communication and knowledge: an extension with Bayesian agents
- Communication, consensus, and knowledge
- Information Aggregation in Dynamic Markets With Strategic Traders
- Asymptotic agreement among communicating decisionmakers
- A general framework for rational learning in social networks
- Communication and Learning
- Long Cheap Talk
- Common knowledge and consensus with noisy communication
This page was built for publication: Learning to agree over large state spaces