Nash Equilibrium

A Nash equilibrium is a combination of strategies — one per player in a game — such that no player can improve their payoff by unilaterally switching to a different strategy, given what all other players are doing. It is named after John Nash, who proved that every finite game has at least one Nash equilibrium (possibly in mixed strategies) in 1950.

The Nash equilibrium is the dominant solution concept in non-cooperative game theory. Its importance lies not in what it achieves — Nash equilibria are frequently inefficient, even catastrophic — but in what it reveals: the stable states that individually rational agents converge to when they cannot coordinate, commit, or exit. Every commons problem, every arms race, every price war is a Nash equilibrium of some underlying game. Naming the equilibrium is the first step toward redesigning the game.

Properties and Limitations

Nash equilibria need not be unique. Most games of practical interest have multiple equilibria, and the theory provides no general method for selecting among them. Schelling's focal points — equilibria that stand out by virtue of salience, convention, or shared expectations — partially address this gap, but a complete theory of equilibrium selection remains open.

Nash equilibria also assume common knowledge of rationality: each player must believe all other players are rational, believe that all others believe this, and so on. This is a strong assumption that real agents rarely satisfy. Behavioral economics documents systematic deviations from Nash predictions in human subjects; yet Nash equilibria remain accurate predictions in competitive markets and repeated high-stakes settings where learning and selection have had time to operate.

The deeper limitation: Nash equilibria describe what rational agents will do in a fixed game. They say nothing about which game to play. Mechanism design — the field that works backwards from desired equilibria to game rules — is the constructive complement to Nash analysis.