El Farol Bar problem

El Farol Bar problem
El Farol in Santa Fe

The El Farol bar problem is a problem in game theory. Based on a bar in Santa Fe, New Mexico, it was created in 1994 by W. Brian Arthur.

The problem is as follows: There is a particular, finite population of people. Every Thursday night, all of these people want to go to the El Farol Bar. However, the El Farol is quite small, and it's no fun to go there if it's too crowded. So much so, in fact, that the preferences of the population can be described as follows:

  • If less than 60% of the population go to the bar, they'll all have a better time than if they stayed at home.
  • If more than 60% of the population go to the bar, they'll all have a worse time than if they stayed at home.

Unfortunately, it is necessary for everyone to decide at the same time whether they will go to the bar or not. They cannot wait and see how many others go on a particular Thursday before deciding to go themselves on that Thursday.

One aspect of the problem is that, no matter what method each person uses to decide if they will go to the bar or not, if everyone uses the same pure strategy it is guaranteed to fail. If everyone uses the same deterministic method, then if that method suggests that the bar will not be crowded, everyone will go, and thus it will be crowded; likewise, if that method suggests that the bar will be crowded, nobody will go, and thus it will not be crowded. Often the solution to such problems in game theory is to permit each player to use a mixed strategy, where a choice is made with a particular probability. In the case of the single-stage El Farol Bar problem, there exists a unique symmetric Nash equilibrium mixed strategy where all players choose to go to the bar with a certain probability that is a function of the number of players, the threshold for crowdedness, and the relative utility of going to a crowded or an uncrowded bar compared to staying home. There are also multiple Nash equilibria where one or more players use a pure strategy, but these equilibria are not symmetric[1]Several variants are considered in [2].

In some variants of the problem, the people are allowed to communicate with each other before deciding to go to the bar. However, they are not required to tell the truth.

Minority Game

One variant of the El Farol Bar problem is the minority game proposed by Yi-Cheng Zhang and Damien Challet from the University of Fribourg. In the minority game, an odd number of players each must choose one of two choices independently at each turn.

The players who end up on the minority side win. While the El Farol Bar problem was originally formulated to analyze a decision-making method other than deductive rationality, the minority game examines the characteristic of the game that no single deterministic strategy may be adopted by all participants in equilibrium. Allowing for mixed strategies in the single-stage minority game produces a unique symmetric Nash equilibrium, which is for each player to choose each action with 50% probability, as well as multiple equilibria that are not symmetric.

The minority game was featured in the manga Liar Game. In that multi-stage minority game, the majority was eliminated from the game until only one player was left. Players were shown engaging in cooperative strategies.

External links


  1. ^ Whitehead, Duncan. "The El Farol Bar Problem Revisited: Reinforcement Learning in a Potential Game", University of Edinburgh, September 17, 2008
  2. ^ Gintis, Herbert. Game Theory Evolving (Princeton: Princeton University Press, 2009), Section 6.24: El Farol, p. 134

Wikimedia Foundation. 2010.

Игры ⚽ Поможем написать реферат

Look at other dictionaries:

  • El-Farol-Bar-Problem — Das El Farol Bar Problem ist ein Problem in der Spieltheorie und dort ein Spezialfall eines Minderheiten Spiels. Es wurde 1984 von Brian Arthur aufgestellt. Hierbei stand eine Bar in Santa Fe (New Mexico) Taufpate[1]. Das Problem lautet wie folgt …   Deutsch Wikipedia

  • Bargaining problem — The two person bargaining problem is a problem of understanding how two agents should cooperate when non cooperation leads to Pareto inefficient results. It is in essence an equilibrium selection problem; Many games have multiple equilibria with… …   Wikipedia

  • Problème du bar d'El Farol — Le problème du bar d El Farol a été créé en 1994 par l économiste Brian Arthur, chercheur à l Institut de Santa Fe, pour étudier la modélisation de systèmes économiques où les agents ont une rationalité limitée et utilisent un raisonnement par… …   Wikipédia en Français

  • Coordination game — In game theory, coordination games are a class of games with multiple pure strategy Nash equilibria in which players choose the same or corresponding strategies. Coordination games are a formalization of the idea of a coordination problem, which… …   Wikipedia

  • Dynamic inconsistency — In economics, dynamic inconsistency, or time inconsistency, describes a situation where a decision maker s preferences change over time in such a way that what is preferred at one point in time is inconsistent with what is preferred at another… …   Wikipedia

  • Fair division — Cake cutting redirects here. For the wedding tradition, see Wedding reception#Wedding cake. Fair division, also known as the cake cutting problem, is the problem of dividing a resource in such a way that all recipients believe that they have… …   Wikipedia

  • Tragedy of the commons — Cows on Selsley Common. The tragedy of the commons is one way of accounting for overexploitation. The tragedy of the commons is a dilemma arising from the situation in which multiple individuals, acting independently and rationally consulting… …   Wikipedia

  • Prisoner's dilemma — This article is about game theory. For the 1988 novel, see Prisoner s Dilemma (novel). For the Doctor Who audiobook, see The Prisoner s Dilemma. For the 2001 play, see The Prisoner s Dilemma (play). The prisoner’s dilemma is a canonical example… …   Wikipedia

  • Mechanism design — The Stanley Reiter diagram above illustrates a game of mechanism design. The upper left space Θ depicts the type space and the upper right space X the space of outcomes. The social choice function f(θ) maps a type profile to an outcome. In games… …   Wikipedia

  • Stackelberg competition — The Stackelberg leadership model is a strategic game in economics in which the leader firm moves first and then the follower firms move sequentially. It is named after the German economist Heinrich Freiherr von Stackelberg who published Market… …   Wikipedia

Share the article and excerpts

Direct link
Do a right-click on the link above
and select “Copy Link”