Computable Strategies for Repeated Prisoner's Dilemma
Author
Abstract
Suggested Citation
Download full text from publisher
As the access to this document is restricted, you may want to search for a different version of it.
Citations
Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
Cited by:
- Nachbar, John H & Zame, William R, 1996.
"Non-computable Strategies and Discounted Repeated Games,"
Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 8(1), pages 103-122, June.
- William R. Zame & John H. Nachbar, 1996. "Non-computable strategies and discounted repeated games," Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 8(1), pages 103-122.
- William R. Zame, 1995. "Non-Computable Strategies and Discounted Repeated Games," UCLA Economics Working Papers 735, UCLA Department of Economics.
- Jakub Dargaj & Jakob Grue Simonsen, 2020. "A Complete Characterization of Infinitely Repeated Two-Player Games having Computable Strategies with no Computable Best Response under Limit-of-Means Payoff," Papers 2005.13921, arXiv.org, revised Jun 2020.
- E. Friedman & S. Shenker, 2010. "Synchronous and Asynchronous Learning by Responsive Learning Automata," Levine's Working Paper Archive 469, David K. Levine.
- Dargaj, Jakub & Simonsen, Jakob Grue, 2023. "A complete characterization of infinitely repeated two-player games having computable strategies with no computable best response under limit-of-means payoff," Journal of Economic Theory, Elsevier, vol. 213(C).
- Conitzer, Vincent & Sandholm, Tuomas, 2008. "New complexity results about Nash equilibria," Games and Economic Behavior, Elsevier, vol. 63(2), pages 621-641, July.
Corrections
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:eee:gamebe:v:7:y:1994:i:3:p:381-389. See general information about how to correct material in RePEc.
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.
We have no bibliographic references for this item. You can help adding them by using this form .
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.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/inca/622836 .
Please note that corrections may take a couple of weeks to filter through the various RePEc services.