Folk theorem (game theory)

From Wikipedia, the free encyclopedia

Jump to: navigation, search
Folk theorem
A solution concept in game theory
Relationships
Subset of: Minimax, Nash Equilibrium
Significance
Proposed by: various, notably Ariel Rubinstein
Used for: Infinitely repeated games
Example: Repeated prisoner's dilemma
This box: view  talk  edit

In game theory, folk theorems are a class of theorems which imply that in repeated games, any outcome is a feasible solution concept, if under that outcome the players' minimax conditions are satisfied. The minimax condition states that a player will minimize the maximum possible loss which he could face in the game. An outcome is said to be feasible if it satisfies this condition for each player of the game. A repeated game is one in which there is not necessarily a final move, but rather, there is a sequence of rounds, during which the player may gather information and choose moves. An early published example is Friedman (1971).

In mathematics, the term folk theorem refers generally to a theorem which is believed and discussed, but has not been published. In order that the name of the theorem be more descriptive, Roger Myerson has recommended the phrase general feasibility theorem in the place of folk theorem for describing theorems which are of this class.

A commonly referenced proof of a folk theorem was published in 1979 by Ariel Rubinstein.

The method for proving folk theorems is actually quite simple. A grim trigger strategy is a strategy which punishes an opponent for any deviation from some certain behavior. So, all of the players of the game first must have a certain feasible outcome in mind. Then the players need only adhere to an almost grim trigger strategy under which any deviation from the strategy which will bring about the intended outcome is punished to a degree such that any gains made by the deviator on account of the deviation are exactly cancelled out. Thus, there is no advantage to any player for deviating from the course which will bring out the intended, and arbitrary outcome, and the game will proceed in exactly the manner to bring about that outcome.

It is possible to apply this class of theorems to a diverse number of fields. An application in anthropology, for example, would be that in a community where all behavior is well known, and where members of the community know that they will continue to have to deal with each other, then any pattern of behavior (traditions, taboos, etc) may be sustained by social norms so long as the individuals of the community are better off remaining in the community than they would be leaving the community (the minimax condition).

On the other hand, MIT economist Franklin Fisher has noted that the folk theorem is not a positive theory. In considering, for instance, oligopoly behavior, the folk theorem does not tell the economist what firms will do, but rather that cost and demand functions are not sufficient for a general theory of oligopoly, and the economists must include the context within which oligopolies operate in their theory [1].

  • Myerson, Roger B. Game Theory, Analysis of conflict, Cambridge, Harvard University Press (1991)
  • Rubinstein, Ariel. "Equilibrium in Supergames with the Overtaking Criterion." Journal of Economic Theory 21:1-9
  • Mas-Collel, A., Whinston, M and Green, J. (1995) Micreoconomic Theory, Oxford University Press, New York (readable; suitable for advanced undergraduates.)
  • Tirole, J. (1988) The Theory of Industrial Organization, MIT Press, Cambridge MA (An organized introduction to industrial organization)
  1. ^ Fisher, Franklin M. Games Economists Play: A Noncooperative View The RAND Journal of Economics, Vol. 20, No. 1. (Spring, 1989), pp. 113-124, this particular discussion is on page 118
Classical paper on this subject
  • Friedman, J. (1971). A non-cooperative equilibrium for supergames, Review of Economic Studies 38, 1-12.


 view  Topics in game theory

Definitions

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

Equilibrium concepts

Nash equilibrium · Subgame perfection · Bayesian-Nash · Perfect Bayesian · Trembling hand · Proper equilibrium · Epsilon-equilibrium · Correlated equilibrium · Sequential equilibrium · Quasi-perfect equilibrium · Evolutionarily stable strategy · Risk dominance

Strategies

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

Classes of games

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

Games

Prisoner's dilemma · Traveler's dilemma · Coordination game · Chicken · Volunteer's dilemma · Dollar auction · 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 · Blotto games  · War of attrition

Theorems

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

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.