Advanced Search
MyIDEAS: Login to save this paper or follow this series

A Robust Folk Theorem for the Prisoner's Dilemma

Contents:

Author Info

  • Jeffrey C. Ely
  • Juuso Valimaki

Abstract

We prove the folk theorem for the Prisoner's dilemma using strategies that are robust to private monitoring. From this follows a limit folk theorem: when players are patient and monitoring is sufficiently accurate, (but private and possibly independent) any feasible individually rational payoff can be obtained in sequential equilibrium. The strategies used can be implemented by finite (randomizing) automata.

Download Info

If 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.
File URL: http://www.kellogg.northwestern.edu/research/math/papers/1264.pdf
File Function: main text
Download Restriction: no

Bibliographic Info

Paper provided by Northwestern University, Center for Mathematical Studies in Economics and Management Science in its series Discussion Papers with number 1264.

as in new window
Length:
Date of creation: Jun 1999
Date of revision:
Handle: RePEc:nwu:cmsems:1264

Contact details of provider:
Postal: Center for Mathematical Studies in Economics and Management Science, Northwestern University, 580 Jacobs Center, 2001 Sheridan Road, Evanston, IL 60208-2014
Phone: 847/491-3527
Fax: 847/491-2530
Email:
Web page: http://www.kellogg.northwestern.edu/research/math/
More information through EDIRC

Order Information:
Email:

Related research

Keywords:

Other versions of this item:

References

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.:
as in new window
  1. Lehrer, E, 1989. "Lower Equilibrium Payoffs in Two-Player Repeated Games with Non-observable Actions," International Journal of Game Theory, Springer, vol. 18(1), pages 57-89.
  2. Edward J Green & Robert H Porter, 1997. "Noncooperative Collusion Under Imperfect Price Information," Levine's Working Paper Archive 1147, David K. Levine.
  3. Bhaskar, V., 1994. "Informational Constraints and the Overlapping Generations Model : Folk and Anti-Folk Theorems," Discussion Paper 1994-85, Tilburg University, Center for Economic Research.
  4. Mailath, G.J. & Morris, S., 1998. "Repeated Games With Imperfect Private Monitoring: Notes on a Coordination Perspective," Papers 349, Australian National University - Department of Economics.
  5. Ellison, Glenn, 1994. "Cooperation in the Prisoner's Dilemma with Anonymous Random Matching," Review of Economic Studies, Wiley Blackwell, vol. 61(3), pages 567-88, July.
  6. Matsushima, Hitoshi, 1991. "On the theory of repeated games with private information : Part I: anti-folk theorem without communication," Economics Letters, Elsevier, vol. 35(3), pages 253-256, March.
  7. Sekiguchi, Tadashi, 1997. "Efficiency in Repeated Prisoner's Dilemma with Private Monitoring," Journal of Economic Theory, Elsevier, vol. 76(2), pages 345-361, October.
  8. Ichiro Obara, . "The Repeated Prisoner's Dilemma with Private Monitoring: a N-player case," CARESS Working Papres 99-13, University of Pennsylvania Center for Analytic Research and Economics in the Social Sciences.
  9. Radner, Roy, 1985. "Repeated Principal-Agent Games with Discounting," Econometrica, Econometric Society, vol. 53(5), pages 1173-98, September.
  10. Piccione, Michele, 2002. "The Repeated Prisoner's Dilemma with Imperfect Private Monitoring," Journal of Economic Theory, Elsevier, vol. 102(1), pages 70-83, January.
  11. Ichiro Obara, 2000. "Private Strategy and Efficiency: Repeated Partnership Games Revisited," Econometric Society World Congress 2000 Contributed Papers 1449, Econometric Society.
Full references (including those not matched with items on IDEAS)

Citations

Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
as in new window

Cited by:
This item has more than 25 citations. To prevent cluttering this page, these citations are listed on a separate page.

Lists

This item is not listed on Wikipedia, on a reading list or among the top items on IDEAS.

Statistics

Access and download statistics

Corrections

When requesting a correction, please mention this item's handle: RePEc:nwu:cmsems:1264. 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: (Fran Walker).

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.