While it is known how players may learn to play in a game they know, the issue of how their model of the game evolves over time is largely unexplored. This paper introduces small forgetfulness and shows that it may destabilize standard full-memory solutions. Players are repeatedly matched to play a game. After any match, they forget with infinitesimal probability the feasibility of any opponents' unobserved action, and they are reminded of all actions that they observe. During each period, they play an equilibrium consistent with their perception of the game. We show that the unique backward induction path drifts into a non-Nash, self-confirming equilibrium, in a class of extensive-form games that are fully characterized. Such a long-run prediction is always Pareto-undominated, and may Pareto dominate the original backward induction path. In one-shot simultaneous-move games, forgetfulness yields a refinement stronger than trembling hand perfection. Our results imply that there are games that players may never fully learn.
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.
Publisher Info
Paper provided by Northwestern University, Center for Mathematical Studies in Economics and Management Science in its series Discussion Papers with number
1273.
Length: Date of creation: Aug 1999 Date of revision: Handle: RePEc:nwu:cmsems:1273
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.:
Matthew Jackson & Ehud Kalai, 1995.
"Social Learning in Recurring Games,"
Discussion Papers
1138, Northwestern University, Center for Mathematical Studies in Economics and Management Science.
[Downloadable!]
Other versions: