The folk theorem for all games with almost perfect monitoring
Abstract"Selection in Dynamic Games" 1. Assortative Matching with costly search, presented by Alp Atakan 2. A Refinement of Sequential Equilibrium with Application to Decentralized Collusion, presented by Peter Eso 3. Noisy evolution in Normal form Games, presented by Christoph Kuzmics 4. The folk theorem for all games with almost perfect monitoring presented by Johannes Horner Abstract: We study repeated games in which monitoring is imperfect and private. We prove the folk theorem for all two-player (finite) games assuming that the monitoring is almost perfect, but not necessarily almost public
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.
Bibliographic InfoPaper provided by Society for Economic Dynamics in its series 2004 Meeting Papers with number 475.
Date of creation: 2004
Date of revision:
Contact details of provider:
Postal: Society for Economic Dynamics Christian Zimmermann Economic Research Federal Reserve Bank of St. Louis PO Box 442 St. Louis MO 63166-0442 USA
Web page: http://www.EconomicDynamics.org/society.htm
More information through EDIRC
imperfect private monitoring; repeated games;
Find related papers by JEL classification:
- C72 - Mathematical and Quantitative Methods - - Game Theory and Bargaining Theory - - - Noncooperative Games
This paper has been announced in the following NEP Reports:
- NEP-ALL-2004-08-02 (All new papers)
You can help add them by filling out this form.
CitEc Project, subscribe to its RSS feed for this item.
- Yasuyuki Miyahara & Tadashi Sekiguchi & Eiichi Miyagawa, 2007. "The Folk Theorem for Repeated Games with Observation Costs," 2007 Meeting Papers 751, Society for Economic Dynamics.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Christian Zimmermann).
If references are entirely missing, you can add them using this form.