An Adaptive Learning Model in Coordination Games
In this paper, we provide a theoretical prediction of the way in which adaptive players behave in the long run in normal form games with strict Nash equilibria. In the model, each player assigns subjective payoff assessments to his own actions, where the assessment of each action is a weighted average of its past payoffs, and chooses the action which has the highest assessment. After receiving a payoff, each player updates the assessment of his chosen action in an adaptive manner. We show almost sure convergence to a Nash equilibrium under one of the following conditions: (i) that, at any non-Nash equilibrium action profile, there exists a player who receives a payoff, which is less than his maximin payoff; (ii) that all non-Nash equilibrium action profiles give the same payoff. In particular, the convergence is shown in the following games: the battle of the sexes game, the stag hunt game and the first order statistic game. In the game of chicken and market entry games, players may end up playing the action profile, which consists of each player’s unique maximin action.
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.:
- Drew Fudenberg & David K. Levine, 1996.
"The Theory of Learning in Games,"
Levine's Working Paper Archive
624, David K. Levine.
- Sarin, R. & Vahid, F., 1999.
"Predicting how People Play Games: a Simple Dynamic Model of Choice,"
Monash Econometrics and Business Statistics Working Papers
12/99, Monash University, Department of Econometrics and Business Statistics.
- Sarin, Rajiv & Vahid, Farshid, 2001. "Predicting How People Play Games: A Simple Dynamic Model of Choice," Games and Economic Behavior, Elsevier, vol. 34(1), pages 104-122, January.
- 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.
- Cooper, Russell, et al, 1990. "Selection Criteria in Coordination Games: Some Experimental Results," American Economic Review, American Economic Association, vol. 80(1), pages 218-33, March.
- Alan Beggs, 2002.
"On the Convergence of Reinforcement Learning,"
Economics Series Working Papers
96, University of Oxford, Department of Economics.
- Sarin, Rajiv, 1999. "Simple play in the Prisoner's Dilemma," Journal of Economic Behavior & Organization, Elsevier, vol. 40(1), pages 105-113, September.
- John B Van Huyck & Raymond C Battalio & Richard O Beil, 1997.
"Tacit coordination games, strategic uncertainty, and coordination failure,"
Levine's Working Paper Archive
1225, David K. Levine.
- Van Huyck, John B & Battalio, Raymond C & Beil, Richard O, 1990. "Tacit Coordination Games, Strategic Uncertainty, and Coordination Failure," American Economic Review, American Economic Association, vol. 80(1), pages 234-48, March.
- J. B. Van Huyck & R. C. Battalio & R. O. Beil, 2010. "Tacit coordination games, strategic uncertainty, and coordination failure," Levine's Working Paper Archive 661465000000000393, David K. Levine.
- 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.
- 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.
- Monderer, Dov & Shapley, Lloyd S., 1996. "Fictitious Play Property for Games with Identical Interests," Journal of Economic Theory, Elsevier, vol. 68(1), pages 258-265, January.
- Chen, Yan & Khoroshilov, Yuri, 2003. "Learning under limited information," Games and Economic Behavior, Elsevier, vol. 44(1), pages 1-25, July.
When requesting a correction, please mention this item's handle: RePEc:gam:jgames:v:4:y:2013:i:4:p:648-669:d:30467. 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: (XML Conversion Team)
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.