AbstractNo abstract is available for this item.
Download InfoIf you experience problems downloading a file, check if you have the proper application to view it first. 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.
As the access to this document is restricted, you may want to look for a different version under "Related research" (further below) or search for a different version of it.
Bibliographic InfoArticle provided by Elsevier in its journal Games and Economic Behavior.
Volume (Year): 28 (1999)
Issue (Month): 1 (July)
Contact details of provider:
Web page: http://www.elsevier.com/locate/inca/622836
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.:
- Abraham Neyman, 1999. "Cooperation in Repeated Games when the Number of Stages is Not Commonly Known," Econometrica, Econometric Society, vol. 67(1), pages 45-64, January.
- Neyman, Abraham, 1985. "Bounded complexity justifies cooperation in the finitely repeated prisoners' dilemma," Economics Letters, Elsevier, vol. 19(3), pages 227-229.
- Rubinstein, Ariel, 1979. "Equilibrium in supergames with the overtaking criterion," Journal of Economic Theory, Elsevier, vol. 21(1), pages 1-9, August.
- Rubinstein, Ariel, 1995.
"On the Interpretation of Decision Problems with Imperfect Recall,"
Mathematical Social Sciences,
Elsevier, vol. 30(3), pages 324-324, December.
- Piccione, Michele & Rubinstein, Ariel, 1997. "On the Interpretation of Decision Problems with Imperfect Recall," Games and Economic Behavior, Elsevier, vol. 20(1), pages 3-24, July.
- Lehrer, Ehud, 1988. "Repeated games with stationary bounded recall strategies," Journal of Economic Theory, Elsevier, vol. 46(1), pages 130-144, October.
- Aumann, Robert J. & Sorin, Sylvain, 1989. "Cooperation and bounded recall," Games and Economic Behavior, Elsevier, vol. 1(1), pages 5-39, March.
- Kreps, David M. & Milgrom, Paul & Roberts, John & Wilson, Robert, 1982.
"Rational cooperation in the finitely repeated prisoners' dilemma,"
Journal of Economic Theory,
Elsevier, vol. 27(2), pages 245-252, August.
- David Kreps & Paul Milgrom & John Roberts & Bob Wilson, 2010. "Rational Cooperation in the Finitely Repeated Prisoners' Dilemma," Levine's Working Paper Archive 239, David K. Levine.
- Zemel, Eitan, 1989. "Small talk and cooperation: A note on bounded rationality," Journal of Economic Theory, Elsevier, vol. 49(1), pages 1-9, October.
- Tennenholtz, Moshe, 2004. "Program equilibrium," Games and Economic Behavior, Elsevier, vol. 49(2), pages 363-373, November.
- Vulkan, Nir, 2001. "Equilibria in Automated Interactions," Games and Economic Behavior, Elsevier, vol. 35(1-2), pages 339-348, April.
- Monderer, Dov & Tennenholtz, Moshe & Varian, Hal, 2001. "Economics and Artificial Intelligence," Games and Economic Behavior, Elsevier, vol. 35(1-2), pages 1-5, April.
- Joseph Y. Halpern, 2004.
"A Computer Scientist Looks at Game Theory,"
Game Theory and Information
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Zhang, Lei).
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 references are entirely missing, you can add them using this form.
If the full references list an item that is present in RePEc, but the system did not link to it, you can help with 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 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.