Learning the state of nature in repeated games with incomplete information and signals
AbstractThe motivation of this paper comes from repeated games with incomplete information and imperfect monitoring. It concerns the existence, for any payoff function, of a particular equilibrium (called completely revealing) allowing each player to learn the state of nature. We consider thus an interaction in which players, facing some incomplete information about the state of nature, exchange messages while imperfectly monitoring them. We then ask the question: can players learn the true state even under unilateral deviations? This problem is indeed closely related to Byzantine agreement problems from computer science. We define two different notions describing what a player can learn if at most one other player is faulty. We first link these notions with existence of completely revealing equilibria, then we characterize them for monitoring structures given by a graph. As a corollary we obtain existence of equilibria for a class of undiscounted repeated games.
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): 47 (2004)
Issue (Month): 1 (April)
Contact details of provider:
Web page: http://www.elsevier.com/locate/inca/622836
Other versions of this item:
- Renault, Jérôme & Tomala, Tristan, 2004. "Learning the state of nature in repeated games with incomplete information and signals," Economics Papers from University Paris Dauphine 123456789/6115, Paris Dauphine University.
- C72 - Mathematical and Quantitative Methods - - Game Theory and Bargaining Theory - - - Noncooperative Games
- C73 - Mathematical and Quantitative Methods - - Game Theory and Bargaining Theory - - - Stochastic and Dynamic Games; Evolutionary Games
- D82 - Microeconomics - - Information, Knowledge, and Uncertainty - - - Asymmetric and Private Information; Mechanism Design
- 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.:
- Robert J. Aumann & Sergiu Hart, 2002.
"Long Cheap Talk,"
Discussion Paper Series
dp284, The Center for the Study of Rationality, Hebrew University, Jerusalem, revised Nov 2002.
- Renault, Jérôme, 2001.
"3-player repeated games with lack of information on one side,"
Economics Papers from University Paris Dauphine
123456789/6538, Paris Dauphine University.
- Jérôme Renault, 2001. "3-player repeated games with lack of information on one side," International Journal of Game Theory, Springer, vol. 30(2), pages 221-245.
- Ehud Lehrer & Sylvain Sorin, 1994.
"One-Shot Public Mediated Talk,"
1108, Northwestern University, Center for Mathematical Studies in Economics and Management Science.
- Gossner, Olivier, 1998.
"Secure Protocols or How Communication Generates Correlation,"
Journal of Economic Theory,
Elsevier, vol. 83(1), pages 69-89, November.
- GOSSNER, Olivier, 1997. "Secure protocols or how communication generates correlation," CORE Discussion Papers 1997092, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
- Gossner, Olivier, 1998. "Secure Protocols or How Communication Generates Correlation," Economics Papers from University Paris Dauphine 123456789/6244, Paris Dauphine University.
- Sorin, Sylvain, 1992.
"Repeated games with complete information,"
Handbook of Game Theory with Economic Applications,
in: R.J. Aumann & S. Hart (ed.), Handbook of Game Theory with Economic Applications, edition 1, volume 1, chapter 4, pages 71-107
- Gossner, Olivier & Vieille, Nicolas, 2001. "Repeated Communication Through the Mechanism And," Economics Papers from University Paris Dauphine 123456789/6031, Paris Dauphine University.
- Robert J. Aumann, 1995. "Repeated Games with Incomplete Information," MIT Press Books, The MIT Press, edition 1, volume 1, number 0262011476, December.
- Renault, J. & Tomala, T., 1997.
"Repeated Proximity Games,"
Papiers d'Economie MathÃÂ©matique et Applications
97.14, UniversitÃ© PanthÃ©on-Sorbonne (Paris 1).
- Lehrer, Ehud, 1991.
"Internal Correlation in Repeated Games,"
International Journal of Game Theory,
Springer, vol. 19(4), pages 431-56.
- Renault, Jérôme, 2001. "Learning Sets in State Dependent Signalling Game Forms: A Characterization," Economics Papers from University Paris Dauphine 123456789/6104, Paris Dauphine University.
- Lovo, Stefano & Tomala, Tristan & Hörner, Johannes, 2009. "Belief-free equilibria in games with incomplete information: characterization and existence," Les Cahiers de Recherche 921, HEC Paris.
- Laclau, Marie, 2012. "A folk theorem for repeated games played on a network," Games and Economic Behavior, Elsevier, vol. 76(2), pages 711-737.
- Fudenberg, Drew & Yamamoto, Yuichi, 2011. "Learning from private information in noisy repeated games," Journal of Economic Theory, Elsevier, vol. 146(5), pages 1733-1769, September.
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.