Nash equilibrium
In game theory, the Nash equilibrium is a proposed solution of a non-cooperative game having two or more players in which each player knows the equilibrium strategies of the other players, and no player can gain anything more by changing only their own strategy.[1] The equilibrium is named after John Forbes Nash Jr..
If each player has chosen, and no player can win anything more by choosing a different strategy for themselves, then they have a Nash equilibrium.
Nash Equilibrium Media
Sample network graph. Values on edges are the travel time experienced by a "car" traveling down that edge. x is the number of cars traveling via that edge.
Extensive and Normal form illustrations that show the difference between SPNE and other NE. The blue equilibrium is not subgame perfect because player two makes a non-credible threat at 2(2) to be unkind (U).
References
- ↑ Osborne, Martin J.; Rubinstein, Ariel (12 Jul 1994). A Course in Game Theory. Cambridge, MA: MIT. p. 14. ISBN 9780262150415.