Nash equilibrium explained simply, with examples
What a Nash equilibrium is, how to find one in a payoff grid, and everyday examples, from driving on the left to price wars. No maths needed.
A Nash equilibrium sounds technical, but the idea is simple: it's a situation where nobody has a reason to change what they're doing, given what everyone else is doing.
It's named after John Nash, who described it in 1950 as a young mathematician at Princeton and later shared the 1994 Nobel prize in economics for it. You may know him from the film A Beautiful Mind.
The one-sentence test
Freeze everyone's choices. Now ask each player: "If everyone else keeps doing what they're doing, would you be better off switching?"
If the answer is no for every player, you've found a Nash equilibrium.
Example 1: which side of the road
In the UK, everyone drives on the left. If you alone switched to the right, you'd crash. So nobody switches. That's an equilibrium.
But driving on the right is also an equilibrium, as any trip to France shows. Neither is "better"; they're just stable once everyone does them. Games like this, with several equilibria, are coordination games, and which one we land on often comes down to history or a focal point.
Example 2: the prisoner's dilemma
In the prisoner's dilemma, both players confessing is the Nash equilibrium. If your partner confesses, staying silent only makes things worse for you, so you confess too.
This is the key lesson: a Nash equilibrium is stable, not necessarily good. Both players would prefer the outcome where they both stay silent, but it isn't stable, because each is tempted to switch.
Example 3: two cafés and a price
Two cafés on the same street each charge £3.50 for a coffee. If one raises its price, customers walk next door. If one cuts its price, the other matches and both earn less. Neither wants to move first, so prices stay put. That's an equilibrium too, and it explains why prices in competitive markets often look "stuck".
How to find one in a payoff grid
Game theorists draw simple tables with one player's choices down the side, the other's along the top, and the payoffs in each cell. To find the equilibria:
- For each of the column player's choices, circle the row player's best response.
- For each of the row player's choices, circle the column player's best response.
- Any cell where both payoffs are circled is a Nash equilibrium.
It takes a minute to learn and works on any small game.
Why it's useful
The Nash equilibrium helps you predict where a situation will settle, and that's useful well beyond economics:
- In negotiation, it tells you which agreements will hold without enforcement, and which will unravel as soon as one side spots a better move.
- In business, it explains why competitors end up in price wars nobody wanted.
- In policy, it shows why rules and penalties are sometimes needed to shift people from a bad equilibrium to a better one.
If you can spot the equilibrium, you can ask the more interesting question: what would change the game so a better outcome becomes stable?
Questions people ask
What is a Nash equilibrium in simple terms?
A set of choices where nobody can do better by changing only their own choice, given what everyone else is doing.
Is a Nash equilibrium always the best outcome?
No. In the prisoner's dilemma the Nash equilibrium leaves both players worse off than if they had cooperated.
Can a game have more than one Nash equilibrium?
Yes. Driving on the left and driving on the right are both equilibria. Which one a country lands on is a matter of history and coordination.
Who was John Nash?
An American mathematician who described the equilibrium in 1950 and shared the 1994 Nobel prize in economics for his work on game theory.