Nash Equilibrium

Named after mathematician John Forbes Nash Jr., who introduced the concept in his 1950 Princeton dissertation and a follow-up 1951 paper in the Annals of Mathematics ("Non-Cooperative Games"), the Nash equilibrium is the foundational solution concept of non-cooperative game theory. Nash proved that every finite game with a finite number of players has at least one equilibrium in mixed strategies.

Formally, a strategy profile (s₁*, s₂*, …, sₙ*) is a Nash equilibrium if, for every player i, the payoff from playing sᵢ* is at least as high as the payoff from any alternative strategy, holding the other players' choices fixed. The key feature is mutual best response: each player's strategy is optimal given what everyone else is doing.

Common applications in political science and IR include:

• Arms races and deterrence — mutual armament can be a Nash equilibrium even when mutual disarmament would leave both states better off, mirroring the Prisoner's Dilemma logic Thomas Schelling explored in The Strategy of Conflict (1960).
• Trade and tariff games — retaliatory tariffs can lock states into a suboptimal equilibrium.
• Voting and coalition formation — equilibria help predict stable legislative coalitions.
• Bargaining — Nash's separate 1950 bargaining solution complements the equilibrium concept.

Important caveats: a Nash equilibrium need not be unique, efficient, or fair. The Prisoner's Dilemma's unique equilibrium (both defect) is Pareto-inferior to mutual cooperation. Refinements such as subgame perfect equilibrium (Reinhard Selten, 1965), Bayesian Nash equilibrium (John Harsanyi, 1967–68), and trembling-hand perfection were developed to address multiplicity and credibility problems. Nash, Selten, and Harsanyi shared the 1994 Nobel Memorial Prize in Economic Sciences for this body of work.

The concept assumes rational, payoff-maximizing players with common knowledge of the game's structure — assumptions often relaxed in behavioral and evolutionary game theory.