Time Dependent Bounded Recall Strategies Are Enough to Play the Discounted Repeated Prisoners' Dilemma
Download full text from publisher
Other versions of this item:
- Mehmet Barlo & Guilherme Carmona, 2004. "Time dependent bounded recall strategies are enough to play the discounted repeated prisoners' dilemma," FEUNL Working Paper Series wp449, Universidade Nova de Lisboa, Faculdade de Economia.
References listed on IDEAS
- Neyman, Abraham, 1985. "Bounded complexity justifies cooperation in the finitely repeated prisoners' dilemma," Economics Letters, Elsevier, vol. 19(3), pages 227-229.
- 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.
- Cole, Harold L. & Kocherlakota, Narayana R., 2005.
"Finite memory and imperfect monitoring,"
Games and Economic Behavior,
Elsevier, vol. 53(1), pages 59-72, October.
- Harold L. Cole & Narayana R. Kocherlakota, 2000. "Finite memory and imperfect monitoring," Working Papers 604, Federal Reserve Bank of Minneapolis, revised 2000.
- Harold L. Cole & Narayana R. Kocherlakota, 2001. "Finite memory and imperfect monitoring," Staff Report 287, Federal Reserve Bank of Minneapolis.
- Barlo, Mehmet & Carmona, Guilherme & Sabourian, Hamid, 2009. "Repeated games with one-memory," Journal of Economic Theory, Elsevier, vol. 144(1), pages 312-336, January.
- 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.
CitationsCitations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
- Mehmet Barlo & Guilherme Carmona, 2007. "One - memory in repeated games," FEUNL Working Paper Series wp500, Universidade Nova de Lisboa, Faculdade de Economia.
- Mailath, George J. & Olszewski, Wojciech, 2011.
"Folk theorems with bounded recall under (almost) perfect monitoring,"
Games and Economic Behavior,
Elsevier, vol. 71(1), pages 174-192, January.
- George Mailath & Wojciech Olszewski, 2008. "Folk theorems with Bounded Recall under(Almost) Perfect Monitoring," Discussion Papers 1462, Northwestern University, Center for Mathematical Studies in Economics and Management Science.
- George J. Mailath & Wojciech Olszewski, 2008. "Folk Theorems with Bounded Recall under (Almost) Perfect Monitoring," PIER Working Paper Archive 08-019, Penn Institute for Economic Research, Department of Economics, University of Pennsylvania.
More about this item
KeywordsRepeated Prisoners' Dilemma; Memory; Bounded Rationality;
- C7 - Mathematical and Quantitative Methods - - Game Theory and Bargaining Theory
- D8 - Microeconomics - - Information, Knowledge, and Uncertainty
NEP fieldsThis paper has been announced in the following NEP Reports:
- NEP-MIC-2004-05-09 (Microeconomics)
StatisticsAccess and download statistics
All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. 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). General contact details of provider: https://econwpa.ub.uni-muenchen.de .
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 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 RePEc Author Service 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.