A Nash equilibrium is a stable outcome in a strategic game where no single player can improve their own result by unilaterally changing their strategy, assuming everyone else's strategy stays fixed. John Nash proved in his 1950 doctoral thesis — written at just 22 years old — that such an equilibrium always exists in any finite game, a result that later earned him the 1994 Nobel Memorial Prize in Economic Sciences and transformed economics into a far more rigorously mathematical discipline.
Imagine you and a friend both choose, without communicating, which side of a road to drive on. If you both pick the same side (both left, or both right), you avoid collisions and neither of you has any reason to switch. But if you pick different sides, chaos ensues, and you'd both immediately want to switch given the chance. "Both drive on the same side" is a Nash equilibrium — a stable arrangement where, once reached, no individual player benefits from changing their own choice alone, assuming everyone else keeps their choice fixed.
A crucial and often counterintuitive feature: a Nash equilibrium is only guaranteed to be individually stable — it is not guaranteed to be the best possible outcome overall for the players collectively. The Prisoner's Dilemma (see the Game Theory entry) is the classic illustration: mutual betrayal is the unique Nash equilibrium, even though mutual silence would genuinely have been better for both prisoners together. Nash equilibrium describes stability under pure individual self-interest, not collective optimality.
John Nash's remarkable life — including his struggle with schizophrenia alongside his profound and lasting mathematical achievements — was portrayed (with substantial dramatic license taken for cinematic purposes) in the Oscar-winning 2001 film A Beautiful Mind, which brought unusually wide public attention to this typically quite technical area of mathematical economics.
A strategy profile (a specific choice of strategy for every player) is a Nash equilibrium if, for every individual player i, that player's chosen strategy gives them at least as high a payoff as any alternative strategy they could have chosen instead — given that every other player's strategy remains exactly as chosen. No player has any incentive to unilaterally deviate.
In the driving-side coordination game, there are two Nash equilibria in "pure strategies" (a specific, definite single choice, rather than randomising): both drive left, or both drive right. Both are equally valid, stable equilibria — the specific one a society actually settles into is typically determined by historical convention or accident rather than any inherent mathematical preference between them.
Not every game has a stable equilibrium if players are restricted to a single, definite ("pure") strategy. Consider matching pennies: two players each secretly choose heads or tails; player A wins if they match, player B wins if they differ. No pure-strategy Nash equilibrium exists here — whatever player A commits to, player B can exploit it, and vice versa. However, if each player instead randomises 50-50 between heads and tails (a mixed strategy), neither player can improve their outcome by unilaterally deviating — this mixed-strategy profile is the game's unique Nash equilibrium.
Nash's landmark 1950 result: every finite game (finitely many players, each with finitely many available strategies) has at least one Nash equilibrium, provided players are permitted to use mixed strategies. The proof relies on Kakutani's fixed-point theorem (a substantial generalisation of the Brouwer fixed-point theorem from topology), representing a strikingly elegant and unexpected use of abstract topological machinery to settle a concrete, seemingly informal question in strategic economic behaviour.
Nash's proof constructs a function that maps any given strategy profile to the set of "best response" strategies each player would prefer to switch to, given the other players' current strategies. A Nash equilibrium corresponds exactly to a fixed point of this function — a strategy profile that maps to itself, since no one wants to deviate from it. Kakutani's fixed-point theorem (1941) guarantees that such a fixed point must exist, provided the strategy spaces are compact and convex and the best-response correspondence satisfies certain natural continuity conditions — technical requirements that are automatically satisfied once mixed strategies (probability distributions over pure strategies) are permitted.
A single game can sometimes have multiple Nash equilibria, some more intuitively "reasonable" than others as genuine predictions of real strategic behaviour. This has motivated numerous proposed refinements — additional criteria for selecting among multiple equilibria. Reinhard Selten introduced subgame perfect equilibrium (1965), ruling out equilibria that rely on empty, non-credible threats in sequential (multi-stage) games. John Harsanyi and Selten later developed further, even more refined equilibrium selection criteria — Nash, Selten, and Harsanyi jointly shared the 1994 Nobel Memorial Prize in Economic Sciences for their collective, complementary contributions to modern game theory.
Nash's complete 1950 Princeton doctoral thesis, "Non-Cooperative Games," was remarkably brief — just 27 pages — yet contained the complete general existence proof along with several other genuinely foundational contributions to game theory. This combination of extraordinary brevity and profound, far-reaching mathematical depth has since made it something of a legendary and much-referenced example within mathematics of how a comparatively short piece of work can nonetheless entirely transform an entire academic field.
Nash equilibrium concepts are now used extensively across numerous fields well beyond their origins in economics: in evolutionary biology (connecting directly to evolutionarily stable strategies — see the Game Theory entry), in computer science and network design (analysing how self-interested, independent network users' routing choices settle into stable, predictable traffic patterns), and in international relations and political science (analysing nuclear deterrence, arms races, and international treaty negotiations as strategic games with identifiable, analysable equilibria).
Robert Aumann (1974) introduced an even more general solution concept, correlated equilibrium, which allows for players' strategies to be correlated via some shared external signal (such as a public traffic light, or any commonly observed but strategically irrelevant event) — potentially achieving jointly better outcomes for all players than any achievable Nash equilibrium, while still fully respecting each individual player's own rational self-interest. Aumann shared the 2005 Nobel Memorial Prize in Economic Sciences partly for this and related foundational contributions to game theory.