Folk theorem (game theory)

In game theory, folk theorems are a class of theorems describing an abundance of Nash equilibrium payoff profiles in repeated games (Friedman 1971).[1] The original Folk Theorem concerned the payoffs of all the Nash equilibria of an infinitely repeated game. This result was called the Folk Theorem because it was widely known among game theorists in the 1950s, even though no one had published it. Friedman's (1971) Theorem concerns the payoffs of certain subgame-perfect Nash equilibria (SPE) of an infinitely repeated game, and so strengthens the original Folk Theorem by using a stronger equilibrium concept: subgame-perfect Nash equilibria rather than Nash equilibria.[2]

The Folk Theorem suggests that if the players are patient enough and far-sighted (i.e. if the discount factor ), then repeated interaction can result in virtually any average payoff in an SPE equilibrium.[3] "Virtually any" is here technically defined as "feasible" and "individually rational".

  1. ^ In mathematics, the term folk theorem refers generally to any theorem that is believed and discussed, but has not been published. Roger Myerson has recommended the more descriptive term "general feasibility theorem" for the game theory theorems discussed here. See Myerson, Roger B. Game Theory, Analysis of conflict, Cambridge, Harvard University Press (1991)
  2. ^ R. Gibbons (1992). A Primer in Game Theory. Harvester Wheatsheaf. p. 89. ISBN 0-7450-1160-8.
  3. ^ Jonathan Levin (2002). "Bargaining and Repeated Games" (PDF).

From Wikipedia, the free encyclopedia · View on Wikipedia

Developed by Tubidy