Game Theory: How to Think When Someone Else Is Thinking Back

In 1944, a mathematician and an economist published a book thick enough to stop a door. John von Neumann and Oskar Morgenstern had been trying to solve a problem that ordinary calculus could not touch: how do you make a rational decision when the value of your choice depends entirely on someone else's choice?¹ Their answer, Theory of Games and Economic Behavior, launched a field that has since reshaped economics, evolutionary biology, political science, and the way most serious people think about conflict.

The field they built is game theory, and the core problem it solves comes up everywhere. Two grocery chains deciding where to put a new location. A home buyer and a seller circling a final number. Two countries weighing whether to escalate or de-escalate. A driver deciding whether to merge now or hang back. In each of these situations, you cannot optimize in isolation. You are not playing against the world; you are playing against another mind that is reasoning about you at the same time you are reasoning about it.

What a game actually is

In the technical sense game theorists use, a game is any situation with three ingredients.

First, there are players: the decision-makers. They can be people, firms, governments, or anything with a choice to make and something at stake.

Second, there are strategies. A strategy is not just one move but a complete plan, a full specification of what a player will do in every situation they might face.

Third, there are payoffs: the value each player receives under every possible combination of strategies. Payoffs can be dollars, years in prison, market share, or any measure of what the player cares about.¹ The Library of Economics and Liberty defines game theory as the analysis of decisions in which "the optimal choice of one player depends on what the others are likely to do," and that dependency is precisely what payoffs capture.¹

The discipline is then the study of what rational players will do once those three things are in place. What I find most useful about this framing is that it forces you to do the work most people skip: they know what they want, but they have never written down what the other side wants, which combinations of moves produce which outcomes, and whether anyone has a move so good they would play it no matter what.

The idea of a dominant strategy

Let's start with the easiest case. Start with the question: does any player have a strategy that beats all of their other strategies, no matter what the other players do? If yes, that strategy is called dominant, and a rational player will always play it. You do not even need to guess what the other side will do.

Consider two cereal makers choosing between a heavy and a light advertising budget. Heavy advertising mostly steals share from the rival rather than growing the whole market. The payoffs, in millions of dollars of annual profit, look like this.

Check your options. If the rival spends big, you earn $40M by spending big or $30M by holding back. Spend big. If the rival holds back, you earn $70M by spending big or $60M by holding back. Spend big again. Heavy advertising is dominant: it beats the alternative in every scenario. The rival's math is identical, so both firms spend heavily and each lands at $40M, even though both would be better off at $60M if they could cooperate and hold back.

This is the shape of countless real standoffs. Both firms spend big, both end up worse than they would have been with a handshake agreement, and neither is irrational. The structure trapped them. That is what the payoff table surfaces.

When no dominant strategy exists

Most real situations are not that clean. There is no move that beats everything else regardless of what the other side does, so players have to reason about what the other side will do, and each side knows the other is doing the same reasoning.

Consider two coffee chains, North and South, each deciding whether to open a store in a small town that can profitably support only one location. The payoffs, in thousands of dollars of annual profit:

Neither chain has a dominant strategy: North wants to enter if South stays out, but wants to stay out if South enters. The same logic holds for South. There are two stable outcomes where no one regrets their choice given what the other did, one chain in and one chain out, and the contest becomes a race to commit credibly before the rival can react. The structure tells you the fight will be about who can sign a lease first, not about who has better coffee.

That stable resting point has a name: the Nash equilibrium, after the mathematician John Nash, who characterized it rigorously in a 1950 paper when he was 21 years old.⁶ An equilibrium is a set of strategies, one per player, where no player wants to switch unilaterally given what everyone else is doing. It is the prediction game theory offers. The genius of it is that you do not need intuition about what people will do; you derive it from the structure of incentives.

One shot vs. repeat play

The single most important refinement in game theory is whether a game is played once or many times. In a one-shot game, players interact a single time. There is no future to protect and no way to punish betrayal, so cooperation is fragile. The cereal-maker standoff above is one-shot in spirit: both firms play heavy, end up at $40M, and there is nothing to do about it.

In a repeated game, the same players meet again and again, and the shadow of future encounters changes everything. A player who cheats today can be punished tomorrow. Strategies like tit-for-tat, where you cooperate on the first move and then mirror whatever the other player did last round, can sustain cooperation that would be impossible in a single interaction. The Library of Economics and Liberty notes in its treatment of the prisoners' dilemma that repetition is one of the main reasons real-world rivals manage to cooperate at all.² This is why long-term supplier relationships, established trading partners, and tight-knit communities behave so differently from one-time dealings with a stranger.

The formal recognition of all this is not trivial. The 1994 Nobel Prize in Economics went to John Nash, John Harsanyi, and Reinhard Selten for their work analyzing equilibria in non-cooperative games, an award the Nobel committee credited with transforming how economists think about strategic interaction.³ A second prize in 2005 honored Thomas Schelling and Robert Aumann for extending game theory to illuminate conflict and cooperation across arms races, trade disputes, and international agreements.⁴

Where the framework runs into walls

Game theory is a model, and every model has edges where it fails. The part most treatments skip is how quickly those edges arrive in practice.

The framework assumes players are rational and that the payoffs are common knowledge: you know what I value, I know what you value, and we each know the other knows. Real people routinely violate all of this. We misjudge probabilities, act on emotion, value fairness for its own sake, and frequently misread what the other side wants. The Stanford Encyclopedia of Philosophy's survey of the field catalogs how relaxing the rationality assumption changes the predictions, sometimes dramatically.⁵

The framework also struggles when there are many equilibria and no obvious way to predict which one a group of players will land on. Multiple stable outcomes are possible, and the theory alone does not select among them without additional structure.

And it can be misapplied. Dressing up a guess in a payoff matrix does not make it true if the payoffs were invented to support the conclusion the analyst already wanted.

None of this makes the framework useless. What it does is make it a starting point rather than a verdict. The discipline of writing down who the players are, what each can do, and what each gets under every combination forces a clarity about why a standoff is happening and what would actually have to change to break it. The next time you are staring down a negotiation, a bidding war, or a competitive situation where the outcome hinges on someone else's choice, sketch the payoffs before you act. You will often find the situation has a logic you can see. Sometimes you will find a way out you would have missed.

The world is full of games. The ones that look most chaotic usually have a structure underneath. Find it.