Skip to content
The Intellectual Framework
Open the Atlas
The Atlas · Logos · Discipline 57 of 58

Game Theory and Strategic Thinking

The mathematics of other people.

Read it free10 lessons · about 0.6 hours · 8,514 words
The story

Two suspects sit in separate cells. If both stay silent, each gets a year. If one talks, he walks and the other gets ten. Each reasons perfectly, each betrays, and both end up worse off than if they had trusted. The Prisoner's Dilemma was written on a blackboard in 1950. It has been explaining arms races, price wars and traffic ever since.

The question to carry

When is it rational to trust someone who has every reason to betray you?

Say it at the table

The smart move depends on what the other person thinks your smart move is.

The film

Watch it in four minutes.

The briefing

What it is, in plain words.

  • 10 lessons
  • 10 modules, each with a test
  • 3 people explained
  • 24 works, places and ideas explained
  • 12 question final exam

Game theory is the study of decisions in situations where the outcome depends on what others choose too. It applies to business rivals, negotiators, voters, armies and animals. Strategic thinking is the habit it trains: working out your move by first working out theirs.

A game has players, choices and payoffs. The central idea is equilibrium, a state where nobody can do better by changing course alone. The most famous result is uncomfortable. Sensible individual choices can leave everyone worse off, as in an arms race or overfishing. The way out usually involves repetition, reputation or enforceable agreements, all of which make cooperation the smart move. The practical lesson is to look ahead, reason back, and remember that the other side is doing the same.

Five ideas to hold

1Nash equilibrium

A set of choices from which no player can gain by changing strategy alone.

A Nash equilibrium is a situation in which no player can do better by changing strategy alone, given what everyone else is doing. Driving on the right is one: if everyone else does, you should too. So is driving on the left. John Nash proved in 1950 that every finite game has at least one. An equilibrium is stable. It need not be good. Everyone standing up at a concert is an equilibrium in which nobody sees better.

2Zero-sum game

A situation in which one side's gain is exactly the other's loss.

In a zero-sum game, what one side wins the other loses, so the total is fixed. Chess and poker are zero-sum. Most of life is not. Trade, marriage and business partnerships can leave both sides better off, and wars can leave both worse off. Treating a situation that could benefit everyone as zero-sum is among the costliest errors in negotiation. The first question to ask of any conflict is whether the pie can be made bigger.

3Prisoner's dilemma

A game in which two players each do best by betraying the other, yet both lose when both do.

Two suspects are held in separate cells. If both stay silent, each gets a short sentence. If one confesses and the other stays silent, the confessor goes free and the other gets a long sentence. If both confess, both get medium sentences. Whatever the other does, confessing is better for you. So both confess, and both end up worse off than if they had kept quiet. The structure appears in arms races, price wars and overfishing.

4Dominant strategy

A choice that is best for a player whatever the others do.

A dominant strategy is the best choice no matter what the others do. In the prisoner's dilemma, confessing is dominant. When you have one, you need not guess your opponent's move. When your opponent has one, you can predict theirs. Most real games offer no dominant strategy, and that is where strategy becomes interesting. The first step in analyzing any game is to look for dominant strategies and to rule out moves that are always worse.

5Credible commitment

A promise or threat that others believe because it would be costly to abandon.

A threat or a promise works only if the other side believes that you will carry it out. Often the way to be believed is to remove your own options. The general who burns the bridges behind his army tells the enemy that retreat is impossible. A company that builds extra factory capacity shows that it will fight a price war. Thomas Schelling called this the paradox that weakness can be strength: binding yourself changes what others expect.

Five moments that made the field

  1. 1944Von Neumann and Morgenstern publish Theory of Games and Economic Behavior.
  2. 1950John Nash defines equilibrium and the Prisoner's Dilemma is posed.
  3. 1960Thomas Schelling publishes The Strategy of Conflict.
  4. 1984Robert Axelrod publishes The Evolution of Cooperation.
  5. 1994Nash, Harsanyi and Selten share the Nobel Prize in economics.

Still argued about

Open question 1

Do real people behave like the rational players in the theory?

Open question 2

Can game theory predict conflicts or only explain them afterward?

Open question 3

How does cooperation arise among people who look after themselves?

Plates

Things to look at.

Chess
Chess Traditional board game for two players · Wikipedia
Go (game)
Go (game) Abstract strategy board game · Wikipedia
Rock paper scissors
Rock paper scissors Hand game for two players or more · Wikipedia
Ideas

Three facts, one myth, one dare.

Did you know · 1More than a dozen game theorists have won the Nobel Prize in economics.
Did you know · 2Cold War nuclear strategy was built on game theory.
Did you know · 3Chess has more possible games than there are atoms in the observable universe.
The myth

Game theory assumes people are selfish.

Tap to turn it over
What is true

It assumes only that people have goals. Cooperation is one of its main results.

Try this

Notice one situation this week where everyone would gain if everyone trusted.

Once you understand game theory, you understand the worldVeritasium · one of the films in this discipline
Inside

10 sections, 10 lessons.

  1. 1

    The briefing

    Nash equilibrium · Zero-sum game · Prisoner's dilemma · Dominant strategy

  2. 2

    Introduction to Game Theory

    Definition and Scope · Historical Development · Basic Concepts

  3. 3

    Fundamental Models and Equilibria

    The Prisoner's Dilemma · The Nash Equilibrium · Zero-Sum Games · Repeated Games and SuperGames

  4. 4

    Applications in Economics and Business

    Market Competition and Oligopolies · Auction Theory · Contract Theory and Mechanism Design · Corporate Strategy and Negotiation

  5. 5

    Political Science and International Relations

    Voting Systems and Electoral Competition · International Conflict and Alliances · Public Goods and Collective Action

  6. 6

    Psychology and Evolutionary Biology

    Evolutionary Game Theory · Social Dilemmas and Cooperation · Behavioral Game Theory

  7. 7

    Information and Communication

    Signaling Games · Cheap Talk · Network Theory

  8. 8

    Advanced Topics in Game Theory

    Stochastic and Bayesian Games · Cooperative Game Theory · Algorithmic Game Theory

  9. 9

    Critical Perspectives and Limitations

    Critiques of Game Theory · Ethical Considerations

  10. 10

    Conclusion

    The Universality of Game Theory · Future Directions

From the text

A game has players, choices and payoffs. The central idea is equilibrium, a state where nobody can do better by changing course alone. The most famous result is uncomfortable. Sensible individual choices can leave everyone worse off, as in an arms race or overfishing. The way out usually involves repetition, reputation or enforceable agreements, all of which make cooperation the smart move. The practical lesson is to look ahead, reason back, and remember that the other side is doing the same.

Keep reading in the Atlas

Figures

People to know.

John von Neumann1903-1957

Founded game theory

John Nash1928-2015

The equilibrium that bears his name

Thomas Schelling1921-2016

The strategy of conflict

Robert Axelrodborn 1943

The evolution of cooperation

Canon

Books to read.

  • The Strategy of ConflictThomas Schelling
  • The Evolution of CooperationRobert Axelrod
  • Thinking StrategicallyDixit and Nalebuff
From the viva

A question from its final exam.

In a Nash equilibrium, no player can gain by

Who is in it

3 people, each one explained.

Twelve of them are below. In the Atlas every name, work and place in the text opens a short account of who or what it is.

  • John von Neumann 1903 to 1957
    Hungarian and American mathematician and physicist
  • Oskar Morgenstern 1902 to 1977
    Austrian economist
  • Reinhard Selten 1930 to 2016
    German economist

Descriptions and dates from Wikidata. Portraits from Wikimedia Commons, each linked to its author and license.

Also worth knowing

What a full picture of the field includes.

Every chapter was checked against a list of the names and terms a student of the subject should meet. These are the most important ones the book itself does not name.

Minimax

Choosing the move that keeps your worst possible outcome as good as it can be. Von Neumann proved it solves two-player zero-sum games.

Mixed strategy

Choosing among moves at random with set probabilities, as a goalkeeper must, so that an opponent cannot predict you.

Robert Aumannborn 1930

Game theorist who analyzed repeated games and what it means for something to be common knowledge.

Game of chicken

Two drivers head toward each other, and the one who swerves loses face. Each wants the other to give way.

Stag hunt

Two hunters can cooperate for a stag or each take a hare alone. It models the tension between safety and trust.

Ultimatum game

One player offers a split of money and the other can accept it or refuse, leaving both with nothing. People reject unfair offers.

Albert W. Tucker1905 to 1995

The mathematician who gave the prisoner's dilemma its story and its name in 1950.

Cournot competition

A model from 1838 in which firms choose how much to produce. It is the oldest example of what we now call a Nash equilibrium.

Mechanism design

Designing the rules of a game so that self-interested players produce the result you want. It is used for auctions and for matching.

Evolutionarily stable strategy

John Maynard Smith's idea of a strategy that, once common in a population, cannot be invaded by a rival one.

Backward induction

Solving a game by starting from the last move and reasoning back to the first.

Braess's paradox

Adding a road to a network can make everyone's journey slower, because each driver chooses selfishly.

More of the field

10 more people and ideas a student of this subject should meet. In the Atlas each one opens a card with facts, dates and a portrait.

Bertrand RussellBlaise PascalCarl von ClausewitzErnst ZermeloHarold HotellingJohn Maynard KeynesNiccolò MachiavelliSun TzuTucker CarlsonVilfredo Pareto

Read Game Theory and Strategic Thinking.

Free. The film, the briefing and the first section open without an account.