Attainability of boundary points under reinforcement learning
This paper investigates the properties of the most common form of reinforcement learning (the "basic model" of Erev and Roth, American Economic Review, 88, 848-881, 1998). Stochastic approximation theory has been used to analyse the local stability of fixed points under this learning process. However, as we show, when such points are on the boundary of the state space, for example, pure strategy equilibria, standard results from the theory of stochastic approximation do not apply. We offer what we believe to be the correct treatment of boundary points, and provide a new and more general result: this model of learning converges with zero probability to fixed points which are unstable under the Maynard Smith or adjusted version of the evolutionary replicator dynamics. For two player games these are the fixed points that are linearly unstable under the standard replicator dynamics.
(This abstract was borrowed from another version of this item.)
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.
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.
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.:
- Ed Hopkins, 2000.
"Two Competing Models of How People Learn in Games,"
ESE Discussion Papers
51, Edinburgh School of Economics, University of Edinburgh.
- Josef Hofbauer & Ed Hopkins, 2000.
"Learning in Perturbed Asymmetric Games,"
ESE Discussion Papers
53, Edinburgh School of Economics, University of Edinburgh.
- Glenn Ellison & Drew Fudenberg, 1998.
"Learning Purified Mixed Equilibria,"
Harvard Institute of Economic Research Working Papers
1817, Harvard - Institute of Economic Research.
- Borgers, Tilman & Sarin, Rajiv, 1997.
"Learning Through Reinforcement and Replicator Dynamics,"
Journal of Economic Theory,
Elsevier, vol. 77(1), pages 1-14, November.
- Tilman Börgers & Rajiv Sarin, . "Learning Through Reinforcement and Replicator Dynamics," ELSE working papers 051, ESRC Centre on Economics Learning and Social Evolution.
- T. Borgers & R. Sarin, 2010. "Learning Through Reinforcement and Replicator Dynamics," Levine's Working Paper Archive 380, David K. Levine.
- J.-F. Laslier & R. Topol & B. Walliser, 1999.
"A behavioral learning process in games,"
THEMA Working Papers
99-03, THEMA (THéorie Economique, Modélisation et Applications), Université de Cergy-Pontoise.
- Erev, Ido & Roth, Alvin E, 1998. "Predicting How People Play Games: Reinforcement Learning in Experimental Games with Unique, Mixed Strategy Equilibria," American Economic Review, American Economic Association, vol. 88(4), pages 848-81, September.
- Martin Posch, 1997. "Cycling in a stochastic learning algorithm for normal form games," Journal of Evolutionary Economics, Springer, vol. 7(2), pages 193-207.
- Colin Camerer & Teck-Hua Ho, 1999. "Experience-weighted Attraction Learning in Normal Form Games," Econometrica, Econometric Society, vol. 67(4), pages 827-874, July.
- Duffy, John & Hopkins, Ed, 2005.
"Learning, information, and sorting in market entry games: theory and evidence,"
Games and Economic Behavior,
Elsevier, vol. 51(1), pages 31-62, April.
- John Duffy & Ed Hopkins, 2010. "Learning, Information and Sorting in Market Entry Games: Theory and Evidence," Levine's Working Paper Archive 506439000000000355, David K. Levine.
- John Duffy & Ed Hopkins, 2001. "Learning, Information and Sorting in Market Entry Games: Theory and Evidence," ESE Discussion Papers 78, Edinburgh School of Economics, University of Edinburgh.
- Arthur, W Brian, 1993. "On Designing Economic Agents That Behave Like Human Agents," Journal of Evolutionary Economics, Springer, vol. 3(1), pages 1-22, February.
- William H. Sandholm, 2002. "Evolutionary Implementation and Congestion Pricing," Review of Economic Studies, Oxford University Press, vol. 69(3), pages 667-689.
- Monderer, Dov & Shapley, Lloyd S., 1996. "Potential Games," Games and Economic Behavior, Elsevier, vol. 14(1), pages 124-143, May.
- Sarin, Rajiv & Vahid, Farshid, 1999. "Payoff Assessments without Probabilities: A Simple Dynamic Model of Choice," Games and Economic Behavior, Elsevier, vol. 28(2), pages 294-309, August.
- Roth, Alvin E. & Erev, Ido, 1995. "Learning in extensive-form games: Experimental data and simple dynamic models in the intermediate term," Games and Economic Behavior, Elsevier, vol. 8(1), pages 164-212.
- Rustichini, Aldo, 1999. "Optimal Properties of Stimulus--Response Learning Models," Games and Economic Behavior, Elsevier, vol. 29(1-2), pages 244-273, October.
When requesting a correction, please mention this item's handle: RePEc:eee:gamebe:v:53:y:2005:i:1:p:110-125. 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: (Shamier, Wendy)
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.