Advanced Search
MyIDEAS: Login

Regret Matching with Finite Memory

Contents:

Author Info

  • Rene Saran
  • Roberto Serrano

Abstract

We consider the regret matching process with finite memory. For general games in normal form, it is shown that any recurrent class of the dynamics must be such that the action profiles that appear in it constitute a closed set under the “same or better reply” correspondence (CUSOBR set) that does not contain a smaller product set that is closed under “same or better replies,” i.e., a smaller PCUSOBR set. Two characterizations of the recurrent classes are offered. First, for the class of weakly acyclic games under better replies, each recurrent class is monomorphic and corresponds to each pure Nash equilibrium. Second, for a modified process with random sampling, if the sample size is sufficiently small with respect to the memory bound, the recurrent classes consist of action profiles that are minimal PCUSOBR sets. Our results are used in a robust example that shows that the limiting empirical distribution of play can be arbitrarily far from correlated equilibria for any large but finite choice of the memory bound.

(This abstract was borrowed from another version of this item.)

Download Info

If 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.
File URL: http://www.dklevine.com/archive/refs4661465000000000078.pdf
Download Restriction: no

Bibliographic Info

Paper provided by David K. Levine in its series Levine's Working Paper Archive with number 661465000000000078.

as in new window
Length:
Date of creation: 03 Jun 2010
Date of revision:
Handle: RePEc:cla:levarc:661465000000000078

Contact details of provider:
Web page: http://www.dklevine.com/

Related research

Keywords:

Other versions of this item:

Find related papers by JEL classification:

This paper has been announced in the following NEP Reports:

References

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.:
as in new window
  1. Josephson, Jens & Matros, Alexander, 2000. "Stochastic Imitation in Finite Games," Working Paper Series in Economics and Finance 363, Stockholm School of Economics, revised 26 Nov 2002.
  2. Sergiu Hart, 2004. "Adaptive Heuristics," Levine's Bibliography 122247000000000471, UCLA Department of Economics.
  3. Lehrer, Ehud & Solan, Eilon, 2009. "Approachability with bounded memory," Games and Economic Behavior, Elsevier, vol. 66(2), pages 995-1004, July.
  4. Drew Fudenberg & David K. Levine, 1996. "Consistency and Cautious Fictitious Play," Levine's Working Paper Archive 470, David K. Levine.
  5. Sergiu Hart & Andreu Mas-Colell, 1996. "A simple adaptive procedure leading to correlated equilibrium," Economics Working Papers 200, Department of Economics and Business, Universitat Pompeu Fabra, revised Dec 1996.
  6. Young, H Peyton, 1993. "The Evolution of Conventions," Econometrica, Econometric Society, vol. 61(1), pages 57-84, January.
  7. Hurkens Sjaak, 1995. "Learning by Forgetful Players," Games and Economic Behavior, Elsevier, vol. 11(2), pages 304-329, November.
  8. Rene Saran & Roberto Serrano, 2010. "Ex-post regret learning in games with fixed and random matching: The case of private values," Working Papers 2010-11, Instituto Madrileño de Estudios Avanzados (IMDEA) Ciencias Sociales.
  9. K. Ritzberger & J. Weibull, 2010. "Evolutionary Selection in Normal-Form Games," Levine's Working Paper Archive 452, David K. Levine.
  10. Andriy Zapechelnyuk, 2008. "Better-Reply Dynamics with Bounded Recall," Discussion Papers 2, Kyiv School of Economics, revised Mar 2008.
  11. Saran Rene & Serrano Roberto, 2010. "Ex-Post Regret Learning in Games with Fixed and Random Matching: The Case of Private Values," Research Memorandum 032, Maastricht University, Maastricht Research School of Economics of Technology and Organization (METEOR).
Full references (including those not matched with items on IDEAS)

Citations

Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
as in new window

Cited by:
  1. Rene Saran & Roberto Serrano, 2010. "Ex-Post Regret Learning in Games with Fixed and Random Matching: The Case of Private Values," Working Papers 2010-11, Brown University, Department of Economics.
  2. Saran Rene & Serrano Roberto, 2010. "Ex-Post Regret Learning in Games with Fixed and Random Matching: The Case of Private Values," Research Memorandum 032, Maastricht University, Maastricht Research School of Economics of Technology and Organization (METEOR).

Lists

This item is not listed on Wikipedia, on a reading list or among the top items on IDEAS.

Statistics

Access and download statistics

Corrections

When requesting a correction, please mention this item's handle: RePEc:cla:levarc:661465000000000078. 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: (David K. Levine).

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.