The El Farol Bar Problem as an Iterated N-Person Game
Miklos N. Szilagyi
Department of Electrical and Computer Engineering
University of Arizona
Abstract
The El Farol Bar problem is treated as an iterated N-person battle of the sexes or leader game for any initial attendance ratio and any value of the bar capacity. It is shown that the bar attendance always fluctuates around the value of the bar capacity. The fluctuations' amplitude is inversely proportional to the total number of the participating agents.
