Game Theory · Nash equilibrium

Nash equilibrium, explained with examples

It sounds like college economics, but it comes down to one question a ten-year-old can ask: would anyone do better by switching on their own? Tap the squares of four classic games and find out.

Quick answer

A Nash equilibrium is a situation where every player is already making their best choice, given what the others are choosing, so nobody can do better by changing only their own move. Example: if everyone drives on the right, you should drive on the right too, so nobody switches. It’s named after mathematician John Nash, who described it in 1950. A Nash equilibrium is stable, but not always good.

Try it: find the stable squares

Each square shows what the two players get. Tap one. If an arrow appears, that player would rather switch. If nobody wants to switch, you’ve found a Nash equilibrium.

Mia and Leo lost their phones. They both want to meet. Where do they go? Tap a square to test it.

Column player
ParkLibrary
Row playerPark
Library

First number: Row player’s points. Second: Column player’s points.

Pick a square. Ask: would either player do better by switching, if the other one stays put?

How to find a Nash equilibrium in 3 steps

  1. 1

    Fix the other player

    Pretend the other player’s choice is locked in. Look only along your own options.

  2. 2

    Mark your best reply

    For each thing they might do, circle the choice that gives you the most points. Then do the same from their side.

  3. 3

    Look for double circles

    A square circled for both players is a Nash equilibrium: each is already giving the best reply to the other.

In the share-or-keep game, “keep” is circled for you whatever your partner does, and the same for them, so the double circle lands on keep–keep. That one is stable even though share–share pays more. See why on the prisoner’s dilemma page.

Nash equilibrium in real life

🚗 Which side of the road

If everyone drives on the right, driving on the right is your best choice. On 3 September 1967 Sweden moved from the left side to the right, and it only worked because everyone switched at the same moment.

🍦 Ice cream carts on a beach

Two carts each inch toward the middle to grab more customers, until both sit side by side at the center. Harold Hotelling described this in 1929. It’s why similar shops often cluster together.

🛝 The usual meeting spot

Friends who always meet at the same place keep going there. Any spot would work if everyone chose it; the habit is what makes one of them stick.

🚦 Traffic

Each driver picks the fastest-looking route. Routes fill up until none is faster than another, and switching alone wouldn’t help anyone.

✌️ Rock, paper, scissors

There’s no stable plain move: whatever you always throw can be beaten. The equilibrium is to mix, a third each, at random.

🛒 Price wars

Two shops selling the same thing keep undercutting each other until prices sit near cost. Stable, and not much fun for either shop.

Three mistakes people make

“It’s the best result”

Not always. In share-or-keep, the only equilibrium (both keep) is worse for both than both sharing.

“There’s always exactly one”

A meeting game has two. Odd-or-even has none in plain moves. Its equilibrium is to mix at random.

“It says what people will do”

It finds the stable spots. Real people sometimes do better (they trust each other) or worse (they make mistakes).

Who was John Nash?

John Forbes Nash Jr. (1928–2015) was an American mathematician. In 1950, at 21, he published a very short paper, Equilibrium Points in N-Person Games, and wrote his Princeton thesis on the same idea. He proved that every game with a limited number of players and moves has at least one equilibrium, as long as players are allowed to mix their moves at random.

In 1994 he shared the Nobel memorial prize in economics with John Harsanyi and Reinhard Selten “for their pioneering analysis of equilibria in the theory of non-cooperative games.” The film A Beautiful Mind tells his story.

The idea in one line

“If everyone is already doing the best they can, given what everyone else is doing, nobody has a reason to change.”

Nash equilibrium practice questions

Eight questions for grades 6 to 7. Tap an answer to check it.

Stable or not? Check yourself

8 questions · tap an answer

  1. Question 1 · Grade 6

    What is a Nash equilibrium?

  2. Question 2 · Grade 6

    Mia and Leo both go to the park (2 points each). If Leo switches to the library alone, he gets 0. Is park–park stable?

  3. Question 3 · Grade 6

    In share-or-keep, both keeping (1 point each) is the Nash equilibrium. What does that tell you?

  4. Question 4 · Grade 6

    How many Nash equilibria (in plain moves) does a meet-up game with two good places usually have?

  5. Question 5 · Grade 6

    In odd-or-even (matching fingers), whoever loses always wants to switch. What is the best plan?

  6. Question 6 · Grade 7

    Everyone in a country drives on the right. Why does nobody switch to the left alone?

  7. Question 7 · Grade 7

    Two ice cream carts on a beach each want the most customers. Where do they end up?

  8. Question 8 · Grade 6

    Who is the Nash equilibrium named after?

no sign-up

Play the full lessons

These are real lessons from the course, played in the browser with no account. Answers are checked as you go. Try 2 lessons, then sign up to keep going.

Where it fits in the Game Theory course

Kids build up to it. In grade 3 they learn the best reply: the smartest move if you know what the other player will do. In grade 5 they meet games with stable spots and learn to mix it up when there aren’t any. In grade 6 they find Nash equilibria in tables (none, one or two), then use the idea on price wars, ice cream carts and road networks. See the full Game Theory for kids course.

Questions about Nash equilibrium

What is Nash equilibrium in simple terms?
A Nash equilibrium is a situation in a game where every player is already making their best choice, given what everyone else is choosing. So nobody can do better by changing only their own move. You test it by asking: if the others stay put, would I want to switch?
What is an example of a Nash equilibrium?
Driving on the same side of the road. If everyone drives on the right, your best choice is to drive on the right too, so nobody switches alone. Another: two friends who usually meet at the park both go to the park, because going anywhere else alone would mean missing each other.
Is a Nash equilibrium always the best outcome?
No. In the prisoner’s dilemma, both players not cooperating is the only Nash equilibrium, even though both cooperating would be better for both. A Nash equilibrium is stable, which is not the same as good.
Can a game have more than one Nash equilibrium, or none?
Yes to both. A meeting game has two (both at place A, or both at place B). A game like odd-or-even or rock, paper, scissors has none in plain moves; its equilibrium is to mix your moves at random. John Nash proved that every game with a limited number of players and moves has at least one equilibrium once mixing is allowed.
What grade learns Nash equilibrium?
It is usually taught in high school or college economics, but the idea fits middle school. In iMasterly’s Game Theory course kids find Nash equilibria in grade 6 with 2×2 tables, after learning best replies in grade 3 and mixing in grade 5.
Who was John Nash?
An American mathematician (1928–2015). He described the equilibrium in a short 1950 paper and his Princeton thesis, and shared the 1994 Nobel memorial prize in economics with John Harsanyi and Reinhard Selten. The film A Beautiful Mind is about his life.

Big ideas, made playable

Game Theory for every grade, K–8. Kids play first, find the pattern, then learn the idea that beats the game.