El Farol Bar problem

From Wikipedia, the free encyclopedia

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 Brian Arthur.

The problem is as follows: There is a particular, finite population of people. On 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 following rules are in place:

  • 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 before deciding to go themselves.

The significance of the problem is that, no matter what deterministic method each person uses to decide if they will go to the bar or not, if everyone uses the same deterministic method it is guaranteed to fail. If everyone uses the same 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.

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.

The minority game is a game proposed by Yi-Cheng Zhang and Damien Challet from the University of Fribourg is a generalization of the El Farol bar problem. In the game, an odd number of players each have to choose one of two choices independently at each turn. The players who end up on the minority side win.


 view  Topics in game theory

Definitions

Normal form game · Extensive form game · Cooperative game · Information set · Preference

Equilibrium concepts

Nash equilibrium · Subgame perfection · Bayes-Nash · Trembling hand · Proper equilibrium · Epsilon-equilibrium · Correlated equilibrium · Sequential equilibrium · Quasi-perfect equilibrium · ESS · Risk dominance

Strategies

Dominant strategies · Mixed strategy · Tit for tat · Grim trigger

Classes of games

Symmetric game · Perfect information · Dynamic game · Repeated game · Signaling game · Cheap talk · Zero-sum game · Mechanism design

Games

Prisoner's dilemma · Coordination game · Chicken · Battle of the sexes · Stag hunt · Matching pennies · Ultimatum game · Minority game · Rock, Paper, Scissors · Pirate game · Dictator game · Public goods game · Nash bargaining game

Theorems

Minimax theorem · Purification theorems · Folk theorem · Revelation principle · Arrow's Theorem

Related topics

Mathematics · Economics · Behavioral economics · Evolutionary game theory · Population genetics · Behavioral ecology · Adaptive dynamics · List of game theorists

Advanced Search
Included Web Search Engines


Safe Search

close

Top Matching Results

Occasionally Search.com will highlight specialized results that are based on the context of your query. Examples of specialized results include specific links to news, images, or video.

Top Matching Results may highlight information from other Search.com pages, content from the CNET Network of sites, or third party content. The listings are based purely on relevance. Search.com does not receive payment for listings in this section but our partners that provide this data may get paid for listing these products.

Sponsored Links

This section contains paid listings which have been purchased by companies that want to have their sites appear for specific search terms and related content. These listings are administered, sorted and maintained by a third party and are not endorsed by Search.com.

Search Results

Search.com sends your search query to several search engines at one time and integrates the results into one list which has been sorted by relevance using Search.com's proprietary algorithm. You can customize the list of search engines included in your metasearch from the preferences.

The search engines that are used in your metasearch may allow companies to pay to have their Web sites included within the results. To view the Paid Inclusion policy for a specific search engine, please visit their Web site. Search.com does not accept payment or share revenue with any search engine partner for listings in this section.