The state where no one regrets their choice—given what everyone else did.
A Nash equilibrium is a set of strategies—one for each player—where no player can improve their outcome by unilaterally changing their own strategy. Named after mathematician John Nash, it is the central solution concept in non-cooperative game theory: if every player has chosen and no one wants to deviate alone, the game is in equilibrium.
It predicts stable outcomes: If a game has a Nash equilibrium, play is likely to settle there—because no individual has an incentive to move.
It may not be optimal: The Prisoner’s Dilemma’s Nash equilibrium (both defect) is worse for both players than mutual cooperation. Equilibrium does not mean fairness or efficiency.
Multiple equilibria: Many games have more than one Nash equilibrium. Which one emerges depends on expectations, communication, and focal points—Schelling points that players naturally gravitate toward.
Best-response analysis: For each player, find what strategy maximizes their payoff given the other player’s choice. Where best responses coincide, you have an equilibrium.
Iterated elimination of dominated strategies: Remove strategies that are always worse than another, regardless of what opponents do. If one strategy survives, the game has a unique equilibrium.
Mixed strategies: Sometimes no pure-strategy equilibrium exists. Players randomize—for example, rock-paper-scissors has an equilibrium where each choice is played with probability one-third.
Auctions and bidding: Each bidder’s optimal bid depends on what others bid—the auction settles at an equilibrium where no one wants to change their bid.
Traffic routing: Drivers choose routes until no one can save time by switching—the resulting traffic pattern is a Nash equilibrium, often inefficient (Braess’s paradox).
Market competition: Firms choose prices or quantities in light of competitors’ actions. The resulting market outcome is a Nash equilibrium in strategic form.