Two gas stations sit across an intersection. Both currently charge $3.85 per gallon. If Station A raises to $3.95, it loses customers to Station B — a bad move. If A drops to $3.75, Station B matches within hours to avoid losing share — no lasting advantage, lower margin for both. Neither station has a profitable reason to change price unilaterally. This mutual lock-in — where neither player can do better by changing their strategy given what the other is doing — is a Nash equilibrium.
The setup
A Nash equilibrium is a combination of strategies (one per player) in which each player's strategy is the best response to the strategies chosen by all other players. No player has a unilateral incentive to deviate: changing your strategy while everyone else holds theirs fixed makes you worse off.
The concept is named after mathematician John Nash, whose 1950 proof that every finite non-cooperative game has at least one Nash equilibrium earned him a share of the 1994 Nobel Prize in Economics. The proof was foundational: it showed that strategic equilibria exist and can be identified in virtually any competitive setting.
What happens — and why
Finding Nash equilibria requires checking every strategy combination for stability. A combination is not a Nash equilibrium if any player can improve their payoff by switching strategies unilaterally. A combination is a Nash equilibrium when no such deviation exists.
Dominant strategy Nash equilibrium: if both players have dominant strategies, the Nash equilibrium is where both play their dominant strategy — the most stable outcome, reached regardless of beliefs about the opponent.
Multiple equilibria: many games have more than one Nash equilibrium. In coordination games (two firms choosing compatible technology standards, two drivers choosing which side of the road to drive on), multiple equilibria exist and the game has a coordination problem: any consistent pair of choices can be stable, so reaching the desirable equilibrium requires communication, convention, or focal points.
Mixed strategy equilibria: when no pure strategy Nash equilibrium exists (as in matching pennies — players want to match or mismatch), a stable equilibrium exists in mixed strategies, where players randomize between options with specific probabilities.
Where you see it in the wild
The FCC's spectrum auction design explicitly targets Nash equilibrium outcomes — the auction format is designed so that bidding truthfully (or near-truthfully) is a dominant strategy, making the Nash equilibrium efficient and revenue-maximizing for the government.
Oligopoly pricing frequently exhibits Nash equilibrium behavior: each firm's price is a best response to competitors' prices, and no firm has a unilateral incentive to deviate. This explains price stability in oligopolies even without explicit coordination — the Nash equilibrium structure sustains prices without any agreement.
Why it matters
Nash equilibrium is the primary prediction tool in strategic settings. It identifies stable outcomes in competition, negotiation, regulation, and international relations — any situation where outcomes depend on multiple decision-makers choosing simultaneously without binding commitment. Its limitation is that it doesn't always predict a unique outcome (multiple equilibria), and it doesn't guarantee socially efficient outcomes (Prisoner's Dilemmas reach inefficient Nash equilibria). Both limitations are features, not bugs — they map real-world complexity accurately.
