On the Minmax of Repeated Games with Imperfect Monitoring: A Computational Example
The minmax in repeated games with imperfect monitoring can differ from the minmax of those games with perfect monitoring. This can happen when two or more players are able to gain common information known only to themselves, and utilize this information at a later stage. Gossner and Tomala  showed that in a class of such games, the minmax is given by a weighted average of the payoffs of two main strategies: one in which the information is gained, and the other in which the information is utilized. While this result is implicit, all examples analyzed to date require a single main strategy in which information is created and utilized simultaneously. We show that two strategies are indeed needed by providing and solving a concrete example of a three-player game.
|Date of creation:||Dec 2003|
|Date of revision:|
|Contact details of provider:|| Postal: Feldman Building - Givat Ram - 91904 Jerusalem|
Web page: http://www.ratio.huji.ac.il/
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. & Tomala, T., 1997.
"Repeated Proximity Games,"
Papiers d'Economie MathÃ©matique et Applications
97.14, UniversitÃ© PanthÃ©on-Sorbonne (Paris 1).
- GOSSNER, Olivier & HERNANDEZ, Pénélope, 2001.
"On the complexity of coordination,"
CORE Discussion Papers
2001047, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
- GOSSNER, Olivier & TOMALA, Tristan, 2003. "Entropy and codification in repeated games with imperfect monitoring," CORE Discussion Papers 2003033, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
- repec:dau:papers:123456789/6885 is not listed on IDEAS
When requesting a correction, please mention this item's handle: RePEc:huj:dispap:dp345. 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: (Ilan Nehama)
If references are entirely missing, you can add them using this form.