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 consistent with his cognitive capacity. Assuming that agentsʼ partitions are independently 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. Our proofs rely on a graph-theoretic characterization of common knowledge that has independent interest.
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.
As the access to this document is restricted, you may want to look for a different version under "Related research" (further below) or search for a different version of it.
Bibliographic InfoArticle provided by Elsevier in its journal Games and Economic Behavior.
Volume (Year): 76 (2012)
Issue (Month): 2 ()
Contact details of provider:
Web page: http://www.elsevier.com/locate/inca/622836
Epistemic game theory; Random partitions; Meet of 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
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.:
- Marco LiCalzi & Oktay Surucu, 2011.
"The power of diversity over large solution spaces,"
1, Department of Management, 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.
- Ziv Hellman & Dov Samet, 2010.
"How Common Are Common Priors?,"
Discussion Paper Series
dp532, The Center for the Study of Rationality, Hebrew University, Jerusalem.
- 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.
- Dimitri, Nicola, 1993. "Learning partitions," Economics Letters, Elsevier, vol. 42(2-3), pages 195-199.
- John Geanakoplos, 1992. "Common Knowledge," Journal of Economic Perspectives, American Economic Association, vol. 6(4), pages 53-82, Fall.
- 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: (Zhang, Lei).
If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.
If references are entirely missing, you can add them using this form.
If the full references list an item that is present in RePEc, but the system did not link to it, you can help with this form.
If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your profile, as there may be some citations waiting for confirmation.
Please note that corrections may take a couple of weeks to filter through the various RePEc services.