Learning the state of nature in repeated games with incomplete information and signals
The 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.
|Date of creation:||2004|
|Date of revision:|
|Publication status:||Published in Games and Economic Behavior, 2004, Vol. 47, no. 1. pp. 124-156.Length: 32 pages|
|Contact details of provider:|| Web page: http://www.dauphine.fr/en/welcome.html|
More information through EDIRC
References listed on IDEAS
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.:
- 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.
- Robert J. Aumann, 1995. "Repeated Games with Incomplete Information," MIT Press Books, The MIT Press, edition 1, volume 1, number 0262011476, June.
- Gossner, Olivier, 1998. "Secure Protocols or How Communication Generates Correlation," Economics Papers from University Paris Dauphine 123456789/6244, Paris Dauphine University.
- 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 & Sorin, Sylvain, 1997.
"One-Shot Public Mediated Talk,"
Games and Economic Behavior,
Elsevier, vol. 20(2), pages 131-148, August.
- 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, 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).
- 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.
- 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.
- Gossner, Olivier & Vieille, Nicolas, 2001. "Repeated Communication Through the Mechanism And," Economics Papers from University Paris Dauphine 123456789/6031, Paris Dauphine University.
- Lehrer, Ehud, 1991.
"Internal Correlation in Repeated Games,"
International Journal of Game Theory,
Springer, vol. 19(4), pages 431-56.
- Robert J. Aumann & Sergiu Hart, 2003.
"Long Cheap Talk,"
Econometric Society, vol. 71(6), pages 1619-1660, November.
When requesting a correction, please mention this item's handle: RePEc:dau:papers:123456789/6115. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Alexandre Faure)
If references are entirely missing, you can add them using this form.