Zero-sum games are pure conflict: what I win, you lose. But most of life isn't like that. Two firms advertising, two countries arming, two commuters choosing routes, two flatmates deciding whether to do the washing-up — their interests are partly aligned and partly opposed. These are non-zero-sum games, and they need a subtler idea of "solution" than a single value. The answer, and one of the most influential ideas of the twentieth century, is the Nash equilibrium — the notion that won John Nash a Nobel Prize and reshaped economics.
When both players can win or lose independently, one number per cell is not enough — we need a
bimatrix, each cell holding a pair
| Colin: Cooperate | Colin: Defect | |
|---|---|---|
| Rose: Cooperate | (3, 3) | (0, 5) |
| Rose: Defect | (5, 0) | (1, 1) ◀ Nash |
If they could trust each other, both would cooperate and score
A Nash equilibrium is a combination of strategies — one for each player — that is stable against second-guessing:
It is a self-enforcing agreement: at a Nash equilibrium nobody has a private incentive to break ranks, so it tends to be where a system settles. Crucially, "no one wants to deviate alone" says nothing about whether a coordinated change would help everyone — and that gap is where the drama lives.
Look at the game from Rose's side. If Colin cooperates, Rose gets
Check that
Best responses make the equilibrium leap out of the grid. In each column circle the row Rose prefers; in each row circle the column Colin prefers. Wherever both circles land in the same cell, neither player wants to move — that cell is the Nash equilibrium. Step through it:
Rose's circles both fall on the Defect row; Colin's both fall on the
Defect column; they coincide only at
The Prisoner's Dilemma has one equilibrium in pure strategies. Other games have none in pure strategies — matching pennies, for one — but Nash proved the general rescue:
This generalises von Neumann's minimax theorem beyond the zero-sum world: where minimax gives one game a single value, Nash gives every game at least one stable resting point.
Because a Nash equilibrium need not be good for the group, we can measure exactly how bad it is: the price of anarchy is the ratio between the social cost at the worst equilibrium and the cost of the best possible coordinated outcome. In road traffic it is startlingly concrete — Braess's paradox shows that adding a road can make everyone's commute longer, because selfish route-choosing settles into a worse equilibrium. Quantifying the price of anarchy is a whole research field, and it tells designers of networks, markets and traffic systems how much a little central coordination (tolls, protocols, incentives) could be worth.
The seductive error is to assume that because rational players land on a Nash equilibrium, that outcome
must be good. The Prisoner's Dilemma is the permanent warning: its unique equilibrium