Nash Equilibrium

Visualize best response functions and find mixed-strategy equilibria in real time

What Is a Nash Equilibrium?

A Nash equilibrium is a strategy profile where no player can improve their payoff by unilaterally changing their strategy. Named after John Nash, who proved in 1950 that every finite game has at least one Nash equilibrium (possibly in mixed strategies).

In mixed strategies, players randomize between their options with specific probabilities. The key insight: at a mixed equilibrium, each player is indifferent between their strategies — their opponent's mix makes every option equally good.

Best Response Visualization

The green curve is Row's best response to Col's mixing probability q. The blue curve is Col's best response to Row's mixing probability p. Nash equilibria are the yellow dots where the curves intersect — neither player wants to deviate.

Best response curves for each player. Nash equilibria occur where the curves intersect.

Try this: Switch between games and notice how the best response structure changes. Matching Pennies has only a mixed equilibrium at (0.5, 0.5). The Coordination Game has two pure equilibria but no interior mixed equilibrium where both players mix with probability strictly between 0 and 1.

Explore with Custom Payoffs

Modify the payoffs below and watch how equilibria appear and vanish. Can you create a game with exactly three Nash equilibria? (Hint: two pure and one mixed.)

Column Player
CooperateDefect
Row PlayerCooperate
,
,
Defect
,
,
Green = Row payoffBlue = Col payoffHighlighted = Nash equilibrium

Analysis

Dominated strategies: Cooperate (row player, strictly dominated by Defect); Cooperate (col player, strictly dominated by Defect)
Nash equilibria: Pure (Defect, Defect) → payoffs (1, 1)

Key Takeaways

  • Nash equilibrium — no player benefits from unilateral deviation
  • Mixed strategies — randomize to make the opponent indifferent
  • Existence — every finite game has at least one Nash equilibrium