Time dependent bounded recall strategies are enough to play the discounted repeated prisoners' dilemma

Mehmet Barlo () and Guilherme Carmona

Nova SBE Working Paper Series from Universidade Nova de Lisboa, Nova School of Business and Economics

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.

Pages: 11 pages
Date: 2004
New Economics Papers: this item is included in nep-evo
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
https://run.unl.pt/bitstream/10362/83481/1/WP449.pdf

Related works:
Working Paper: Time Dependent Bounded Recall Strategies Are Enough to Play the Discounted Repeated Prisoners' Dilemma (2004)
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:unl:unlfep:wp449

Access Statistics for this paper

More papers in Nova SBE Working Paper Series from Universidade Nova de Lisboa, Nova School of Business and Economics Contact information at EDIRC.
Bibliographic data for series maintained by Susana Lopes ().