This file is part of IDEAS, which uses RePEc data


[ Papers | Articles | Software | Books | Chapters | Authors | Institutions | JEL Classification | NEP reports | Search | New papers by email | Author registration | Rankings | Volunteers | FAQ | Blog | Help! ]

Time Dependent Bounded Recall Strategies Are Enough to Play the Discounted Repeated Prisoners' Dilemma

Author info | Abstract | Publisher info | Download info | Related research | Statistics
Author Info
Mehmet Barlo (Sabanc{\i} University)
Guilherme Carmona (Universidade Nova de Lisboa)

Additional information is available for the following registered author(s):

Abstract

We show that for any discount factor, there is a natural number $M$ such that all subgame perfect equilibrium outcomes of the discounted repeated prisoners' dilemma can be obtained by subgame perfect equilibrium strategies with the following property: current play depends only on the number of the time-index and on the history of the last $M$ periods. Therefore, players who are restricted to using pure strategies, have to remember, at the most, $M$ periods in order to play any equilibrium outcome of the discounted repeated prisoners' dilemma. This result leads us to introduce the notion of time dependent complexity, and to conclude that in the repeated prisoners' dilemma, restricting attention to finite time dependent complex strategies is enough.

Download Info
To download:

If you experience problems downloading a file, check if you have the proper application to view it first. Information about this may be contained in the File-Format links below. 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://129.3.20.41/eps/game/papers/0405/0405006.pdf
File Format: application/pdf
File Function:
Download Restriction: no

Publisher Info
Paper provided by EconWPA in its series Game Theory and Information with number 0405006.

Download reference. The following formats are available: HTML (with abstract), plain text (with abstract), BibTeX, RIS (EndNote, RefMan, ProCite), ReDIF
Length: 11 pages
Date of creation: 07 May 2004
Date of revision:
Handle: RePEc:wpa:wuwpga:0405006

Note: Type of Document - pdf; pages: 11. None
Contact details of provider:
Web page: http://129.3.20.41

For technical questions regarding this item, or to correct its listing, contact: (EconWPA).

Related research
Keywords: Repeated Prisoners' Dilemma; Memory; Bounded Rationality;

Other versions of this item:

Find related papers by JEL classification:
C7 - Mathematical and Quantitative Methods - - Game Theory and Bargaining Theory
D8 - Microeconomics - - Information, Knowledge, and Uncertainty

This paper has been announced in the following NEP Reports:

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.:
  1. Neyman, Abraham, 1985. "Bounded complexity justifies cooperation in the finitely repeated prisoners' dilemma," Economics Letters, Elsevier, vol. 19(3), pages 227-229. [Downloadable!] (restricted)
  2. Kalai, Ehud & Stanford, William, 1988. "Finite Rationality and Interpersonal Complexity in Repeated Games," Econometrica, Econometric Society, vol. 56(2), pages 397-410, March. [Downloadable!] (restricted)
    Other versions:
  3. Harold L. Cole & Narayana R. Kocherlakota, 2000. "Finite memory and imperfect monitoring," Working Papers 604, Federal Reserve Bank of Minneapolis.
    Other versions:
  4. Rubinstein, Ariel, 1986. "Finite automata play the repeated prisoner's dilemma," Journal of Economic Theory, Elsevier, vol. 39(1), pages 83-96, June. [Downloadable!] (restricted)
Full references

Cited by:
(explanations, 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.)

  1. Barlo, Mehmet & Carmona, Guilherme, 2007. "One - Memory in Repeated Games," FEUNL Working Paper Series wp500, Universidade Nova de Lisboa, Faculdade de Economia. [Downloadable!]
Statistics
Access and download statistics

Did you know? IDEAS was launched in September 1997.

This page was last updated on 2009-11-5.

This information is provided to you by IDEAS at the Department of Economics, College of Liberal Arts and Sciences, University of Connecticut using RePEc data on a server sponsored by the Society for Economic Dynamics.