Skip to content

Glossary · Game Theory

Nash Equilibrium

also: Nash equilibria · equilibrium strategy · mutual best response

Definition

A Nash equilibrium is a strategy profile in which no player can improve their payoff by unilaterally changing strategy, given what everyone else is doing. Nash (1950) proved every finite game has at least one, possibly in mixed strategies. In pricing and platform competition it predicts where rivalry settles absent coordination, not where firms would like it to settle.

John Nash's 1950 existence theorem established that every game with finitely many players and strategies has at least one equilibrium once players are allowed to randomize. The concept is a consistency condition, not a welfare claim: an equilibrium can be collectively terrible, as the prisoner's dilemma shows, and a game can have many equilibria with nothing inside the theory to pick between them. For operators the practical use is diagnostic. Whenever a pricing policy, a promotional calendar, or a launch sequence keeps drifting back to the same unsatisfying place no matter who runs it, the place is usually an equilibrium, and changing it requires changing the game (payoffs, information, or commitment) rather than exhorting the players.

Essays on this concept