The probability of nontrivial common knowledge
AbstractWe study the probability that two or more agents can attain common knowledge of nontrivial events when the size of the state space grows large. We adopt the standard epistemic model where the knowledge of an agent is represented by a partition of the state space. Each agent is endowed with a partition generated by a random scheme. Assuming that agents' partitions are independently and identically distributed, we prove that the asymptotic probability of nontrivial common knowledge undergoes a phase transition. Regardless of the number of agents, when their cognitive capacity is sufficiently large, the probability goes to one; and when it is small, it goes to zero.
Download InfoIf you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
Bibliographic InfoPaper provided by Department of Management, Università Ca' Foscari Venezia in its series Working Papers with number 6.
Length: 22 pages
Date of creation: Jul 2011
Date of revision: Mar 2012
Common knowledge; Epistemic game theory; Random partitions;
Other versions of this item:
- C72 - Mathematical and Quantitative Methods - - Game Theory and Bargaining Theory - - - Noncooperative Games
- D83 - Microeconomics - - Information, Knowledge, and Uncertainty - - - Search, Learning, and Information
This paper has been announced in the following NEP Reports:
- NEP-ALL-2011-08-09 (All new papers)
- NEP-GTH-2011-08-09 (Game Theory)
- NEP-KNM-2011-08-09 (Knowledge Management & Knowledge Economy)
- NEP-MIC-2011-08-09 (Microeconomics)
Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.:
- Geanakoplos, John, 1994. "Common knowledge," Handbook of Game Theory with Economic Applications, in: R.J. Aumann & S. Hart (ed.), Handbook of Game Theory with Economic Applications, edition 1, volume 2, chapter 40, pages 1437-1496 Elsevier.
- Ziv Hellman & Dov Samet, 2010.
"How Common Are Common Priors?,"
Discussion Paper Series
dp532, The Center for the Study of Rationality, Hebrew University, Jerusalem.
- Marco LiCalzi & Oktay Surucu, 2012.
"The Power of Diversity over Large Solution Spaces,"
INFORMS, vol. 58(7), pages 1408-1421, July.
- Marco LiCalzi & Oktay Surucu, 2011. "The power of diversity over large solution spaces," Working Papers 1, Department of Management, Università Ca' Foscari Venezia, revised Sep 2011.
- Marco LiCalzi & Oktay Surucu, 2011. "The power of diversity over large solution spaces," Working Papers 206, Department of Applied Mathematics, Università Ca' Foscari Venezia, revised Sep 2011.
- Rinott, Yosef & Scarsini, Marco, 2000. "On the Number of Pure Strategy Nash Equilibria in Random Games," Games and Economic Behavior, Elsevier, vol. 33(2), pages 274-293, November.
- John Geanakoplos, 1992. "Common Knowledge," Journal of Economic Perspectives, American Economic Association, vol. 6(4), pages 53-82, Fall.
- Dimitri, Nicola, 1993. "Learning partitions," Economics Letters, Elsevier, vol. 42(2-3), pages 195-199.
- Marco LiCalzi & Lucia Milone, 2012. "Talent management in triadic organizational architectures," Working Papers 4, Department of Management, Università Ca' Foscari Venezia.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Marco LiCalzi).
If references are entirely missing, you can add them using this form.