File:Nash_graph_equilibrium.png · Wikimedia Commons · See Wikimedia Commons
Nash equilibrium
Sign in to saveAlso known as Nash solution
solution concept of a non-cooperative game involving two or more players in which each player is assumed to know the equilibrium strategies of the other players, and no player has anything to gain by changing only their own strategy
Key facts
- Subset of
- Rationalizability , Epsilon-equilibrium , Correlated equilibrium
- Superset of
- Evolutionarily stable strategy , Subgame perfect equilibrium , Perfect Bayesian equilibrium , Trembling hand perfect equilibrium , Stable Nash equilibrium , Strong Nash equilibrium
- Proposed by
- John Forbes Nash Jr.
- Used for
- All non-cooperative games
via Wikipedia infobox
Wikidata facts
- Subclass of
- solution concept
- Named after
- John Forbes Nash
Show 3 more facts
- facet of
- game theory
- theorized by
- John Forbes Nash
- maintained by WikiProject
- WikiProject Mathematics
via Wikidata · CC0
~40 min read
Encyclopedic overview
In game theory, a Nash equilibrium is a situation where no player could gain more by changing their own strategy (holding all other players' strategies fixed) in a game. A Nash equilibrium is the most commonly used solution concept for non-cooperative games.
If each player has chosen a strategy — an action plan based on what has happened so far in the game — and no one can increase one's own expected payoff by changing one's strategy while the other players keep theirs unchanged, then the current set of strategy choices constitutes a Nash equilibrium.
Excerpted from Wikipedia’s “Nash equilibrium” article, available under the CC BY-SA 4.0 licence.