The El Farol Bar Problem Revisited: Reinforcement Learning in a Potential Game
We revisit the El Farol bar problem developed by Brian W. Arthur (1994) to investigate how one might best model bounded rationality in economics. We begin by modelling the El Farol bar problem as a market entry game and describing its Nash equilibria. Then, assuming agents are boundedly rational in accordance with a reinforcement learning model, we analyse long-run behaviour in the repeated game. We then state our main result. In a single population of individuals playing the El Farol game, learning theory predicts that the population is eventually subdivided into two distinct groups: those who invariably go to the bar and those who almost never do. In doing so we demonstrate that learning theory predicts sorting in the El Farol bar problem.
|Date of creation:||Sep 2008|
|Contact details of provider:|| Postal: 31 Buccleuch Place, EH8 9JT, Edinburgh|
Web page: http://www.econ.ed.ac.uk/
More information through EDIRC
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.:
- Franke, Reiner, 2003. "Reinforcement learning in the El Farol model," Journal of Economic Behavior & Organization, Elsevier, vol. 51(3), pages 367-388, 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, 2001. "Learning, Information and Sorting in Market Entry Games: Theory and Evidence," ESE Discussion Papers 78, Edinburgh School of Economics, University of Edinburgh.
- 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.
When requesting a correction, please mention this item's handle: RePEc:edn:esedps:186. 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: (Hannah Chater)
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.