This file is part of IDEAS, which uses RePEc data


[ Papers | Articles | Software | Books | Chapters | Authors | Institutions | JEL Classification | NEP reports | Search | New papers by email | Author registration | Rankings | Volunteers | FAQ | Blog | Help! ]

Excludability and Bounded Computational Capacity Strategies

Author info | Abstract | Publisher info | Download info | Related research | Statistics
Author Info
Ehud Lehrer
Eilon Solan

Additional information is available for the following registered author(s):

Abstract

No abstract is available for this item.

Download Info
To download:

If you experience problems downloading a file, check if you have the proper application to view it first. Information about this may be contained in the File-Format links below. In case of further problems read the IDEAS help file. Note that these files are not on the IDEAS site. Please be patient as the files may be large.

File URL: http://www.kellogg.northwestern.edu/research/math/papers/1374.pdf
File Format: application/pdf
File Function: main text
Download Restriction: no

Publisher Info
Paper provided by Northwestern University, Center for Mathematical Studies in Economics and Management Science in its series Discussion Papers with number 1374.

Download reference. The following formats are available: HTML, plain text, BibTeX, RIS (EndNote), ReDIF
Length:
Date of creation: Jun 2003
Date of revision:
Handle: RePEc:nwu:cmsems:1374

Contact details of provider:
Postal: Center for Mathematical Studies in Economics and Management Science, Northwestern University, 580 Jacobs Center, 2001 Sheridan Road, Evanston, IL 60208-2014
Phone: 847/491-3527
Fax: 847/491-2530
Email:
Web page: http://www.kellogg.northwestern.edu/research/math/
More information through EDIRC

Order Information:
Email:

For technical questions regarding this item, or to correct its listing, contact: (Fran Walker).

Related research
Keywords:

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.:

  1. Aumann, Robert J. & Sorin, Sylvain, 1989. "Cooperation and bounded recall," Games and Economic Behavior, Elsevier, vol. 1(1), pages 5-39, March. [Downloadable!] (restricted)
  2. Ehud Lehrer & Eilon Solan, 2003. "No-Regret with Bounded Computational Capacity," Discussion Papers 1373, Northwestern University, Center for Mathematical Studies in Economics and Management Science. [Downloadable!]
  3. Neyman, Abraham, 1985. "Bounded complexity justifies cooperation in the finitely repeated prisoners' dilemma," Economics Letters, Elsevier, vol. 19(3), pages 227-229. [Downloadable!] (restricted)
  4. Lehrer, Ehud, 1988. "Repeated games with stationary bounded recall strategies," Journal of Economic Theory, Elsevier, vol. 46(1), pages 130-144, October. [Downloadable!] (restricted)
  5. Rubinstein, Ariel, 1986. "Finite automata play the repeated prisoner's dilemma," Journal of Economic Theory, Elsevier, vol. 39(1), pages 83-96, June. [Downloadable!] (restricted)
Full references

Statistics
Access and download statistics

Did you know? RePEc data is maintained by each archive holder on its own website. Nothing is held centrally.

This page was last updated on 2008-11-13.


This information is provided to you by IDEAS at the Department of Economics, College of Liberal Arts and Sciences, University of Connecticut using RePEc data on a server sponsored by the Society for Economic Dynamics.