Communication, timing, and common learning
AbstractWe study the effect of stochastically delayed communication on common knowledge acquisition (common learning). If messages do not report dispatch times, communication prevents common learning under general conditions even if common knowledge is acquired without communication. If messages report dispatch times, communication can destroy common learning under more restrictive conditions. The failure of common learning in the two cases is based on different infection arguments. Communication can destroy common learning even if it ends in finite time, or if agents communicate all of their information. We also identify conditions under which common learning is preserved in the presence of communication.
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 Journal of Economic Theory.
Volume (Year): 146 (2011)
Issue (Month): 1 (January)
Contact details of provider:
Web page: http://www.elsevier.com/locate/inca/622869
Common knowledge Learning Communication;
Other versions of this item:
- Jakub Steiner & Colin Stewart, 2010. "Communication, Timing, and Common Learning," Discussion Papers 1484, Northwestern University, Center for Mathematical Studies in Economics and Management Science.
- Jakub Steiner & Colin Stewart, 2010. "Communication, Timing, and Common Learning," Working Papers tecipa-389, University of Toronto, Department of Economics.
- 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.:
- Parikh, Rohit & Krasucki, Paul, 1990. "Communication, consensus, and knowledge," Journal of Economic Theory, Elsevier, vol. 52(1), pages 178-189, October.
- Koessler, Frederic, 2001.
"Common knowledge and consensus with noisy communication,"
Mathematical Social Sciences,
Elsevier, vol. 42(2), pages 139-159, September.
- Frederic Koessler, 2000. "Common Knowledge and Consensus with Noisy Communication," Econometric Society World Congress 2000 Contributed Papers 0887, Econometric Society.
- Frédéric Koessler, 2000. "Common knowledge and consensus with noisy communication," Working Papers of BETA 2000-05, Bureau d'Economie Théorique et Appliquée, UDS, Strasbourg.
- Martin W. Cripps & Jeffrey C. Ely & George J. Mailath & Larry Samuelson, 2006.
Cowles Foundation Discussion Papers
1575R, Cowles Foundation for Research in Economics, Yale University, revised Jun 2007.
- Martin W. Cripps & Jeffrey C. Ely & George J. Mailath & Larry Samuelson, 2006. "Common Learning," Cowles Foundation Discussion Papers 1575, Cowles Foundation for Research in Economics, Yale University.
- Martin W. Cripps & Jeffrey C. Ely & George J. Mailath & Larry Samuelson, 2007. "Common Learning," PIER Working Paper Archive 07-018, Penn Institute for Economic Research, Department of Economics, University of Pennsylvania.
- Martin W. Cripps & Jeffrey C. Ely & George J. Mailath & Larry Samuelson, 2006. "Common Learning," Levine's Bibliography 321307000000000355, UCLA Department of Economics.
- Binmore, Ken & Samuelson, Larry, 2001. "Coordinated Action in the Electronic Mail Game," Games and Economic Behavior, Elsevier, vol. 35(1-2), pages 6-30, April.
- John Geanakoplos & Heracles M. Polemarchakis, 1982. "We Can't Disagree Forever," Cowles Foundation Discussion Papers 639, Cowles Foundation for Research in Economics, Yale University.
- Geanakoplos, John D. & Polemarchakis, Heraklis M., 1982. "We can't disagree forever," Journal of Economic Theory, Elsevier, vol. 28(1), pages 192-200, October.
- Morris Stephen E, 2002. "Faulty Communication: Some Variations on the Electronic Mail Game," The B.E. Journal of Theoretical Economics, De Gruyter, vol. 1(1), pages 1-26, January.
- Heifetz, Aviad, 1996. "Comment on Consensus without Common Knowledge," Journal of Economic Theory, Elsevier, vol. 70(1), pages 273-277, July.
- Monderer, Dov & Samet, Dov, 1989. "Approximating common knowledge with common beliefs," Games and Economic Behavior, Elsevier, vol. 1(2), pages 170-190, June.
- Martin Cripps & Jeffrey Ely & George Mailath & Larry Samuelson, 2013.
"Common learning with intertemporal dependence,"
International Journal of Game Theory,
Springer, vol. 42(1), pages 55-98, February.
- Jose Alvaro Rodrigues-Neto, 2011.
"The Cycles Approach,"
ANU Working Papers in Economics and Econometrics
2011-547, Australian National University, College of Business and Economics, School of Economics.
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.