Time Dependent Bounded Recall Strategies Are Enough to Play the Discounted Repeated Prisoners' Dilemma
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.
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.:
- Kalai, Ehud & Stanford, William, 1988.
"Finite Rationality and Interpersonal Complexity in Repeated Games,"
Econometric Society, vol. 56(2), pages 397-410, March.
- Ehud Kalai & William Stanford, 1986. "Finite Rationality and Interpersonal Complexity in Repeated Games," Discussion Papers 679, Northwestern University, Center for Mathematical Studies in Economics and Management Science.
- Harold L. Cole & Narayana R. Kocherlakota, 2000.
"Finite memory and imperfect monitoring,"
604, Federal Reserve Bank of Minneapolis.
- Rubinstein, Ariel, 1986.
"Finite automata play the repeated prisoner's dilemma,"
Journal of Economic Theory,
Elsevier, vol. 39(1), pages 83-96, June.
- Ariel Rubinstein, 1997. "Finite automata play the repeated prisioners dilemma," Levine's Working Paper Archive 1639, David K. Levine.
- Barlo, Mehmet & Carmona, Guilherme & Sabourian, Hamid, 2009. "Repeated games with one-memory," Journal of Economic Theory, Elsevier, vol. 144(1), pages 312-336, January.
- Neyman, Abraham, 1985. "Bounded complexity justifies cooperation in the finitely repeated prisoners' dilemma," Economics Letters, Elsevier, vol. 19(3), pages 227-229.
When requesting a correction, please mention this item's handle: RePEc:wpa:wuwpga:0405006. 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: (EconWPA)
If references are entirely missing, you can add them using this form.