Epsilon-equilibrium

From Wikipedia, the free encyclopedia

Epsilon-equilibrium
A solution concept in game theory
Relationships
Superset of: Nash Equilibrium
Significance
Used for: stochastic games
This box: view  talk  edit

In game theory, an Epsilon-equilibrium is a strategy profile that approximately satisfies the condition of Nash Equilibrium.

Given a game and a real non-negative parameter ε, a strategy profile is said to be an ε-equilibrium if it is not possible for any player to gain more than ε in expected payoff by deviating from his strategy, assuming that all other players stick to their strategies.

The notion of ε-equilibria is important in the theory of stochastic games of potentially infinite duration. There are simple examples of stochastic games with no Nash equilibrium but with an ε-equilibrium for any ε strictly bigger than 0.

Perhaps the simplest such example is the following variant of Matching Pennies, suggested by Everett. Player 1 hides a penny and Player 2 must guess if it is heads up or tails up. If Player 2 guesses correctly, he wins the penny from Player 1 and the game ends. If Player 2 incorrectly guesses that the penny is heads up, the game ends with payoff zero to both players. If he incorrectly guesses that it is tails up, the game repeats. If the play continues forever, the payoff to both players is zero.

Given a parameter ε > 0, any strategy profile where Player 2 guesses heads up with probability ε and tails up with probability 1-ε (at every stage of the game, and independently from previous stages) is an ε-equilibrium for the game. The expected payoff of Player 2 in such a strategy profile is at least 1-ε. However, it is easy to see that there is no strategy for Player 2 that can guarantee an expected payoff of exactly 1. Therefore, the game has no Nash equilibrium.

  • H. Everett. Recursive Games. In H.W. Kuhn and A.W. Tucker, editors. Contributions to the theory of games, vol. III, volume 39 of Annals of Mathematical Studies. Princeton University Press, 1957.


 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 · Stochastic game

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.