# El Farol Bar problem

The El Farol bar problem is a problem in game theory. Every Thursday night, a fixed population want to go have fun at the El Farol Bar, unless it's too crowded.
* If less than 60% of the population go to the bar, they'll all have more fun than if they stayed home.
* If more than 60% of the population go to the bar, they'll all have less fun than if they stayed home.
Everyone must decide at the same time whether to go or not, with no knowledge of others' choices.
Paradoxically, if everyone uses a deterministic pure strategy which is symmetric (same strategy for all players), it is guaranteed to fail no matter what it is. If the strategy suggests it will not be crowded, everyone will go, and thus it will be crowded; but if the strategy suggests it will be crowded, nobody will go, and thus it will not be crowded, but again no one will have fun. Better success is possible with a probabilistic mixed strategy. For 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, determined according to the number of players, the threshold for crowdedness, and the relative utility of going to a crowded or uncrowded bar compared to staying home. There are also multiple Nash equilibria in which one or more players use a pure strategy, but these equilibria are not symmetric. Several variants are considered in Game Theory Evolving by Herbert Gintis.
In some variants of the problem, the players are allowed to communicate before deciding to go to the bar. However, they are not required to tell the truth.
Named after a bar in Santa Fe, New Mexico, the problem was created in 1994 by W. Brian Arthur. However, under another name, the problem was formulated and solved dynamically six years earlier by B. A. Huberman and T. Hogg.

## Minority game

A variant is the Minority Game proposed by Yi-Cheng Zhang and Damien Challet from the University of Fribourg. An odd number of players each must make a binary choice independently at each turn, and the winners are those players who end up on the minority side. As in the El Farol Bar problem, no single (symmetric) deterministic strategy can give an equilibrium, but for mixed strategies, there is a unique symmetric Nash equilibrium (each player chooses with 50% probability), as well as multiple asymmetric equilibria.
A multi-stage, cooperative Minority Game was featured in the manga Liar Game, in which the majority was repeatedly eliminated until only one player was left.

## Kolkata Paise Restaurant Problem

Another variant of the El Farol Bar problem is the Kolkata Paise Restaurant Problem (KPR), named for the many cheap restaurants where laborers can grab a quick lunch, but may have to return to work hungry if their chosen restaurant is too crowded. Formally, a large number N of players each choose one of a large number n of restaurants, typically N = n (while in the El Farol Bar Problem, n = 2, including the stay-home option). At each restaurant, one customer at random is served lunch (payoff = 1) while all others lose (payoff = 0). The players do not know each others' choices on a given day, but the game is repeated daily, and the history of all players' choices is available to everyone. Optimally, each player chooses a different restaurant, but this is practically impossible without coordination, resulting in both hungry customers and unattended restaurants wasting capacity.
In a similar problem, there are hospital beds in every locality, but patients are tempted to go to prestigious hospitals out of their district. However, if too many patients go to a prestige hospital, some get no hospital bed at all, while additionally wasting the unused beds at their local hospitals. Strategies are evaluated based on their aggregate payoff and/or the proportion of attended restaurants (utilization ratio). A leading stochastic strategy, with utilization ~0.79, gives each customer a probability p of choosing the same restaurant as yesterday (p varying inversely with the number of players who chose that restaurant yesterday), while choosing among other restaurants with uniform probability. This is a better result than deterministic algorithms or simple random choice (noise trader), with utilization fraction 1 - $^1$/$_e$ ≈ 0.63. Increased utilization for customers having allowance for local optimization search using Traveling Salesman Problem type algorithms have also been studied. Extensions of KPR for on-call car hire problems have been explored in. Stability of the KPR, induced by the introduction of dining clubs have also studied.
Extensions to quantum games for three player KPR have been studied; see for a recent review.