Learning to Forgive
The Folk Theorem for infinitely repeated games offers an embarrassment of riches; nowhere is equilibrium multiplicity more acute. This paper selects amongst these equilibria in the following sense. If players learn to play an infinitely repeated game using classical hypothesis testing, it is known that their strategies almost always approximate equilibria of the repeated game. It is shown here that if, in addition, they are sufficiently conservative in adopting their hypotheses, then almost all of the time is spent approximating an efficient subset of equilibria that share a forgiving property. This result provides theoretical justification for the general sense amongst practitioners that efficiency is focal in such games.
|Date of creation:||01 Dec 2006|
|Date of revision:|
|Contact details of provider:|| Postal: |
Web page: http://www.economics.ox.ac.uk/
More information through EDIRC
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.:
- D. Fudenberg & E. Maskin, 2010.
"Evolution and Cooperation in Noisy Repeated Games,"
Levine's Working Paper Archive
546, David K. Levine.
- Foster, Dean P. & Young, H. Peyton, 2003.
"Learning, hypothesis testing, and Nash equilibrium,"
Games and Economic Behavior,
Elsevier, vol. 45(1), pages 73-96, October.
- Fudenberg, Drew & Maskin, Eric, 1991.
"On the dispensability of public randomization in discounted repeated games,"
Journal of Economic Theory,
Elsevier, vol. 53(2), pages 428-438, April.
- Drew Fudenberg & Eric Maskin, 1987. "On the Dispensability of Public Randomization in Discounted Repeated Games," Working papers 467, Massachusetts Institute of Technology (MIT), Department of Economics.
When requesting a correction, please mention this item's handle: RePEc:oxf:wpaper:296. 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: (Caroline Wise)
If references are entirely missing, you can add them using this form.