Two supermarkets sit across the street from each other, and last spring they started a price war. One dropped its milk to cost, the other matched, then went a cent lower, and now — months later — both sell milk at a loss and glare at each other across the road. Ask either manager why they don’t just raise the price back, and you’ll get the same haunted answer: “If I go up alone, everyone crosses the street to them.” So nobody moves. Both are miserable. Nobody moves.
Now zoom out to two nations in an arms race. Each spends a fortune it would rather spend on roads and hospitals, each knows the other feels exactly the same, and yet neither disarms first — because the one who disarms alone is the one who gets steamrolled. So the missiles pile up. Both are poorer. Nobody moves.
These two stories look nothing alike — milk and missiles — but they are the same story, and the thing that makes them the same is the single most important idea in strategy. Both situations are frozen at a point where, given exactly what the other side is doing, no one can improve by changing their own move alone. That frozen point has a name.
The idea, named
A Nash equilibrium is a combination of moves — one for each player — where no player can raise their own payoff by changing only their own move, holding everyone else’s move fixed. It’s the place the reasoning lands: not because anyone likes it, but because from there, every unilateral step is a step downhill.
The one-sentence version
A Nash equilibrium is a combination of moves, one per player, where no player can raise their own payoff by changing only their own move. Everyone is already doing the best they can given what everyone else is doing — so nobody has any reason to budge.
The whole idea hides in the word alone. The test never asks “could we all do better if we changed together?” — that’s a different, often heartbreaking question. It asks only the narrow, selfish one: holding their move fixed, can I do better by switching mine? If the answer is “no” for every player at once, the situation is at rest. It’s a point of no unilateral regret — nobody, looking only at their own steering wheel, wishes they’d turned it differently.
Before you read — take a guess
Two rival gas stations on the same corner both slashed their prices during a turf war, and now both sell fuel at rock-bottom margins. Each owner privately admits they'd both be richer if prices were high. Yet neither raises their price. Is this stuck situation a Nash equilibrium?
You just correctly predicted the behaviour of two gas stations using nothing but the logic of an arms race between superpowers. That portability — the same resting-point test predicting standoffs, price wars, traffic, and treaties — is why the equilibrium earns a permanent place in your latticework, not a footnote in an economics text.
Why the equilibrium earns a place in the latticework
Three things make this idea worth carrying everywhere:
- It predicts where strategic reasoning settles. Whenever your best move depends on their move, and theirs on yours, the “but then I’d switch, so then they’d switch…” can spin forever. The Nash equilibrium is where that spin stops — the natural forecast for where rational players actually end up.
- Stable is not the same as good. The equilibrium is the outcome that resists lone defections. That’s a statement about stability, not fairness, efficiency, or virtue. The most important situations in this course are exactly the ones where the stable outcome is one everybody would love to escape — but can’t, alone.
- Its most useful move: change the payoffs, not the players. If you dislike where a game settles, lecturing the players to “just cooperate” almost never works — they’re already best-responding. What works is changing the incentives so the good outcome becomes the stable one. Contracts, laws, reputations, and referees are all machines for moving an equilibrium. This is the lever the model hands you.
Meet the machine: the prisoner’s dilemma
Here’s the most famous game in the world, laid out on the workbench you’ll use all course. Two partners in crime, held in separate rooms, each choose to Cooperate (stay silent) or Defect (rat the other out). The numbers are payoffs — higher is better for that player, written as (row, col).
Play with it. Nudge the numbers, watch the rings (a ringed payoff is a player’s best response), and hunt for the cell wearing the NE badge. Then try to escape it.
Payoff matrix
The prisoner's dilemma
Each cell shows (Prisoner A's payoff, Prisoner B's payoff). A ringed number is that player's best response to the rival's choice; a cell where both are ringed wears the NE badge. Nudge payoffs to see the equilibrium move.
| Prisoner B | ||
|---|---|---|
| Cooperate | Defect | |
| Prisoner ACooperate | 33 | 05 |
| Defect | 50 | NE11 |
A ringed payoff is that player’s best response to the rival’s choice. A cell where both are ringed is a Nash equilibrium.
What the matrix says
Prisoner A — dominant strategy: Defect
Prisoner B — dominant strategy: Defect
Nash equilibrium (pure): (Defect, Defect)
Look at what the matrix is telling you. Whatever Prisoner B does, Prisoner A scores higher by defecting: if B cooperates, A gets 5 by defecting versus 3 by cooperating; if B defects, A gets 1 by defecting versus 0 by cooperating. Defect wins for A in both columns — that’s a dominant strategy — and by symmetry the same is true for B. So both defect, landing at (1, 1), the one cell no one wants to leave alone. Yet (Cooperate, Cooperate) = (3, 3) sits right there, better for both — reachable only if they could move together, which the game forbids. That gap between the stable outcome and the good one is the beating heart of this whole subject.
The map of the course
Six short teaching lessons build the idea from its atom up to its limits, then one exam locks it in. The route:
- The Best Response — the atom the equilibrium is built from: your best move given one specific choice by the other player. Master this and the rest is assembly.
- Mutual Best Response — the real definition, and the mechanical method to find every equilibrium in a game by ringing each player’s best responses and spotting where they coincide.
- Stable Isn’t Good — the prisoner’s dilemma in full, the case where the single equilibrium is worse for everyone than an outcome they can all see but cannot reach.
- Many Equilibria — coordination games, where several outcomes are stable at once. Focal points, expectations, and the hard problem of picking which equilibrium you’ll actually land on.
- No Pure Equilibrium — matching pennies and pure conflict, where no fixed pair of moves is stable and the only equilibrium is to deliberately randomise — the world of mixed strategies.
- Change the Game, Not the Players — the practitioner’s lever: moving the equilibrium by rewiring incentives, plus an honest accounting of where the model quietly lies to you.
Then a Final Exam — graded, one question at a time, one-way: once you answer, it locks. No back button, no retries, 70% to pass.
How to use this course
One rule does most of the work: guess before you peek. When you hit an exercise, commit to an answer before revealing the explanation — the small sting of being wrong is what welds the idea into memory. And play with the matrix above until the trap feels obvious in your hands: drag the payoffs around, watch the NE badge jump to a new cell, try to make (3, 3) stable and notice what you had to change to do it. An equilibrium you’ve watched move sticks far better than one you’ve only read about.
Next up: lesson 1, The Best Response — the single, humble building block that every equilibrium in the course is assembled from.