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! ]

No-Regret with Bounded Computational Capacity

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 page. 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/1373.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 1373.

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

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:

Other versions of this item:

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. Lehrer, Ehud, 2003. "A wide range no-regret theorem," Games and Economic Behavior, Elsevier, vol. 42(1), pages 101-115, January. [Downloadable!] (restricted)
    Other versions:
  2. Ben-porath, Elchanan, 1990. "The complexity of computing a best response automaton in repeated games with mixed strategies," Games and Economic Behavior, Elsevier, vol. 2(1), pages 1-12, March. [Downloadable!] (restricted)
  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. Drew Fudenberg & David K. Levine, 1997. "Conditional Universal Consistency," Levine's Working Paper Archive 471, David K. Levine. [Downloadable!]
    Other versions:
  5. Sergiu Hart & Andreu Mas-Colell, 2000. "A Simple Adaptive Procedure Leading to Correlated Equilibrium," Econometrica, Econometric Society, vol. 68(5), pages 1127-1150, September.
    Other versions:
  6. Foster, Dean P. & Vohra, Rakesh, 1999. "Regret in the On-Line Decision Problem," Games and Economic Behavior, Elsevier, vol. 29(1-2), pages 7-35, October. [Downloadable!] (restricted)
  7. Rustichini, Aldo, 1999. "Minimizing Regret: The General Case," Games and Economic Behavior, Elsevier, vol. 29(1-2), pages 224-243, October. [Downloadable!] (restricted)
  8. Lehrer, Ehud, 1988. "Repeated games with stationary bounded recall strategies," Journal of Economic Theory, Elsevier, vol. 46(1), pages 130-144, October. [Downloadable!] (restricted)
  9. 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

Cited by:
(explanations, 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. Andriy Zapechelnyuk, 2007. "Better-Reply Strategies with Bounded Recall," Levine's Bibliography 321307000000000961, UCLA Department of Economics. [Downloadable!]
    Other versions:
  2. Andriy Zapechelnyuk, 2008. "Better-Reply Dynamics with Bounded Recall," Discussion Papers 2, Kyiv School of Economics, revised Mar 2008. [Downloadable!]
  3. Ehud Lehrer & Eilon Solan, 2003. "Excludability and Bounded Computational Capacity Strategies," Discussion Papers 1374, Northwestern University, Center for Mathematical Studies in Economics and Management Science. [Downloadable!]
  4. Alvaro Sandroni & Wojciech Olszewski, 2008. "Strategic Manipulation of Empirical Tests," PIER Working Paper Archive 08-015, Penn Institute for Economic Research, Department of Economics, University of Pennsylvania. [Downloadable!]
    Other versions:
  5. Alvaro Sandroni & Wojciech Olszewski, 2008. "Falsifiability," PIER Working Paper Archive 08-016, Penn Institute for Economic Research, Department of Economics, University of Pennsylvania. [Downloadable!]
Statistics
Access and download statistics

Did you know? IDEAS was sponsored from 1997 to 2002 by the Université du Québec à Montréal.

This page was last updated on 2009-11-25.

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.