Game Theory: A Guide for Curious Minds — with Problems & Solutions
GAME THEORY
A Complete Guide — with Examples, Problems & Solutions
For High School and University Students
Chapter 1 — What Is Game Theory?
Every day, billions of decisions are made by people who are watching — and reacting to —
each other. A company sets its price knowing competitors will respond. A politician crafts a
policy knowing rivals will attack it. A buyer in a negotiation makes an offer knowing the seller will
counter. In all these situations, the outcome depends not just on what you do, but on what
everyone else does too.
Game theory is the scientific study of strategic interaction. It provides tools for thinking clearly
about any situation where multiple decision-makers — called players — are interdependent. It
was formalised in 1944 by mathematician John von Neumann and economist Oskar
Morgenstern, then revolutionised in the 1950s by John Nash.
💡 The Core Definition
A 'game' in game theory is any situation where: (1) there are two or more players, (2) each
player has choices (strategies), and (3) the outcome for each player depends on
everyone's choices combined — not just their own.
The Four Building Blocks
Players: The decision-makers. Could be people, firms, countries, genes, or any entity making
choices.
Strategies: The complete set of options available to each player. A strategy is not just a single
move — it's a full plan for every possible situation.
Payoffs: What each player receives for each combination of strategies. Payoffs can represent
money, utility, survival chances, votes — anything players care about.
Information: What each player knows when they make their decision. Do you know the other
player's strategy? Their payoffs? Their intentions?
A First Example: Rock, Paper, Scissors
Even a simple game like Rock, Paper, Scissors is a proper game in the game-theory sense.
There are two players, each with three strategies (Rock, Paper, Scissors), and payoffs for every
Page 1
Game Theory: A Guide for Curious Minds — with Problems & Solutions
combination (+1 for win, 0 for draw, -1 for loss). Game theory predicts that the optimal strategy
is to choose each option with equal probability — making yourself unpredictable. Any
predictable pattern can be exploited.
🌍 Real-World Connection
Professional poker players, military commanders, and sports penalty-takers all use this
'mixed strategy' logic. When Manchester City's penalty takers shoot equally to both sides,
goalkeepers can't predict which way to dive — the game-theoretic solution in action.
Chapter 2 — Nash Equilibrium: The Concept That
Changed Economics
The Nash Equilibrium, developed by John Nash in 1950 and earning him the Nobel Prize in
Economics in 1994, is the single most important concept in game theory. It tells us where a
game will "settle" when all players are rational and aware of each other's rationality.
The Formal Definition (Without the Maths)
A Nash Equilibrium is a set of strategies — one for each player — such that no player can
improve their outcome by changing their strategy, given that all other players keep their
strategies the same.
Think of it as a "stable resting point". If you're at a Nash Equilibrium and I ask each player
"Would you like to change your strategy?", every single one says "No" — because switching
would only make them worse off or no better.
🎯 The Key Test
To check if a set of strategies is a Nash Equilibrium, go through each player one at a time
and ask: given what everyone else is doing, is this player's strategy the best they can do? If
YES for every player → Nash Equilibrium. If NO for any player → Not a Nash Equilibrium.
Example 1: The Traffic Equilibrium
Two roads connect the same two cities. Road A takes 30 minutes when empty, but gets slower
as traffic builds. Road B always takes 45 minutes, regardless of traffic. Each driver chooses
their route independently.
Page 2
Game Theory: A Guide for Curious Minds — with Problems & Solutions
Initially, everyone drives Road A. As traffic builds, Road A slows to 50 minutes. Some drivers
switch to Road B. The equilibrium is reached when both roads take the same time — at that
point, no single driver benefits from switching. That's the Nash Equilibrium.
Notice: the equilibrium here isn't optimal. If drivers could coordinate, they might all be better off.
But individually, each is making the best possible choice given what others are doing.
Example 2: Price Competition Between Supermarkets
Tesco and Sainsbury's each decide whether to price their groceries 'High' or 'Low'. Here are the
annual profits (in millions):
Supermarket Pricing Game — Annual profits for each firm (£ millions)
Sainsbury's: High Price
Sainsbury's: Low Price
Tesco: High Price
£60m, £60m
£20m, £80m
Tesco: Low Price
£80m, £20m
£40m, £40m
Analysis: If Sainsbury's prices High, Tesco makes £60m at High or £80m at Low — so Tesco
prefers Low. If Sainsbury's prices Low, Tesco makes £20m at High or £40m at Low — Tesco
still prefers Low. Low is a dominant strategy for Tesco. By identical reasoning, Low is dominant
for Sainsbury's too.
The Nash Equilibrium is both pricing Low (£40m each). Yet if both priced High, both would earn
£60m. This is exactly the Prisoner's Dilemma structure — a pattern that appears constantly in
real competition.
🌍 Real-World Connection
This explains why UK supermarkets engaged in destructive 'price wars' throughout the
2010s, driving down margins industry-wide. Each firm was individually rational; the
collective outcome was irrational. Amazon's marketplace pricing algorithms have been
accused of creating similar dynamics online.
Multiple Nash Equilibria
Some games have more than one Nash Equilibrium. This creates a 'coordination problem' —
players need to find a way to select the same equilibrium.
Standard Selection — Two firms choosing technical standards
Firm B: Standard A
Firm B: Standard B
Page 3
Game Theory: A Guide for Curious Minds — with Problems & Solutions
Firm A: Standard A
£100m, £100m
£0, £0
Firm A: Standard B
£0, £0
£80m, £80m
Both (Standard A, Standard A) and (Standard B, Standard B) are Nash Equilibria. Neither firm
wants to use a different standard to the other. The challenge is coordinating on the same one —
especially when Firm A prefers Standard A and Firm B prefers Standard B. This is why technical
standards battles (VHS vs Betamax, Blu-ray vs HD-DVD, iOS vs Android) can be prolonged and
costly.
Practice Problems: Nash Equilibrium
Problem 1
Two streaming platforms, StreamFlix and WatchNow, each choose whether to invest
'Heavily' or 'Lightly' in original content. Payoffs are subscriber growth (millions) per year:
a) Write out the full payoff matrix with these values: (Heavy, Heavy) → StreamFlix: 3,
WatchNow: 3. (Heavy, Light) → StreamFlix: 7, WatchNow: 1. (Light, Heavy) → StreamFlix:
1, WatchNow: 7. (Light, Light) → StreamFlix: 4, WatchNow: 4.
b) Is 'Heavy' a dominant strategy for StreamFlix? Show your reasoning.
c) Find the Nash Equilibrium and explain why it's stable.
d) Is the Nash Equilibrium the best collective outcome? What would need to change to
achieve it?
✓ Solution
a) The Matrix:
(Heavy, Heavy): 3m each. (Heavy, Light): StreamFlix 7m, WatchNow 1m. (Light, Heavy):
StreamFlix 1m, WatchNow 7m. (Light, Light): 4m each.
b) Is Heavy dominant for StreamFlix?
If WatchNow plays Heavy: StreamFlix gets 3m (Heavy) vs 1m (Light) → prefers Heavy. If
WatchNow plays Light: StreamFlix gets 7m (Heavy) vs 4m (Light) → still prefers Heavy.
YES — Heavy is dominant for StreamFlix regardless of WatchNow's choice. By symmetry,
it is also dominant for WatchNow.
c) Nash Equilibrium:
The Nash Equilibrium is (Heavy, Heavy) → 3m each. It's stable because: given WatchNow
is playing Heavy, StreamFlix's best response is Heavy (3m > 1m). Given StreamFlix is
playing Heavy, WatchNow's best response is also Heavy. Neither player can improve by
deviating.
d) Is it the best outcome?
No. Both playing Light yields 4m each — better than the equilibrium's 3m each. This is a
Prisoner's Dilemma: individually rational behaviour (heavy investment) produces collectively
Page 4
Game Theory: A Guide for Curious Minds — with Problems & Solutions
worse results. To achieve (Light, Light), the firms could sign a content-investment
agreement — but this might face antitrust/competition law scrutiny.
Problem 2
Three fast-food chains (BurgerKing, Wendy's, McDonald's) all open outlets on the same
high street. Each must choose a location: Left End, Middle, or Right End. Customers go to
the nearest outlet. Each chain wants maximum customers.
a) If two chains choose Middle and one chooses an end, how are customers distributed?
b) Why is 'everyone in the Middle' NOT a Nash Equilibrium?
c) Describe a scenario that could be a Nash Equilibrium, and test it using the Nash test.
✓ Solution
a) Two in Middle, one at an End:
The two Middle chains split the central customers and also capture customers 'on their side'
of the end chain. The end chain only captures customers near that end. Roughly: the two
Middle chains each get ~37% of customers; the end chain gets ~26%.
b) Why is 'everyone in the Middle' not a Nash Equilibrium?
If all three are in the Middle, each gets 33% of customers. Now suppose BurgerKing moves
to the Left End — it now captures all left-side customers (about 33-40%) without
competition, while McDonald's and Wendy's split the remaining middle/right. BurgerKing is
better off deviating, so the all-Middle outcome fails the Nash test.
c) Nash Equilibrium:
One player at the Left End, one at the Middle, one at the Right End — roughly trisecting the
market. Test: Can the Middle player improve by moving? If they move left, they compete
with the left player and both do worse. If they move right, same problem. The end players
similarly have no incentive to move toward the centre (they'd face competition) or further
out (they'd lose customers). This spread-out configuration passes the Nash test. Note: this
is a simplified version of 'Hotelling's Law' — the real model predicts everyone clustering in
the middle, but that requires only two players.
Chapter 3 — The Prisoner's Dilemma: When Logic
Leads to Failure
The Prisoner's Dilemma is arguably the most important model in all of social science. It shows,
with crystalline clarity, how a group of individually rational actors can produce a collectively
irrational outcome — a trap from which no single player can escape on their own.
The Classic Setup
Page 5
Game Theory: A Guide for Curious Minds — with Problems & Solutions
Two suspects — call them Alice and Bob — are arrested and placed in separate rooms. The
police have enough evidence for a minor charge (1 year each) but want a conviction on the
major charge. Each is offered the same deal in secret:
•
•
•
Betray your partner: if they stay silent, you go free and they get 10 years.
Stay Silent: if both stay silent, you both get 1 year on the minor charge.
If you both betray: you each get 5 years (reduced for cooperation with police).
Prisoner's Dilemma — Years in prison (lower is better)
Bob: Stays Silent
Bob: Betrays
Alice: Stays Silent
1 year, 1 year
10 years, 0 years
Alice: Betrays
0 years, 10 years
5 years, 5 years
The Devastating Logic
Let's follow Alice's reasoning step by step:
1. If Bob stays silent: Alice gets 1 year by staying silent, or 0 years by betraying → better to
betray.
2. If Bob betrays: Alice gets 10 years by staying silent, or 5 years by betraying → better to
betray.
3. Conclusion: No matter what Bob does, Alice is better off betraying.
'Betray' is a dominant strategy for Alice. By identical reasoning, it's dominant for Bob too. Both
betray and each serves 5 years. Yet if both had stayed silent, each would serve only 1 year.
The Nash Equilibrium (Betray, Betray) is the worst collective outcome.
🧠 Why Can't They Just Talk?
Even if Alice and Bob could communicate and promise each other to stay silent, the
promise isn't credible. Once separated, each faces the same incentives — and knows the
other faces them too. A promise to cooperate in a one-shot Prisoner's Dilemma is 'cheap
talk' with no enforcement mechanism. This is why external enforcement (contracts, laws,
regulators) exists in the real world.
Real-World Prisoner's Dilemmas
1. The Arms Race
The Cold War arms race between the US and USSR was a textbook Prisoner's Dilemma played
over decades. Both countries would have been safer and richer spending less on weapons. But
each feared that if the other armed while it disarmed, it would be militarily defenceless. The
Page 6
Game Theory: A Guide for Curious Minds — with Problems & Solutions
dominant strategy for both was to arm heavily — producing a £-trillions-wasted equilibrium that
served neither well. The equilibrium only broke when one side (the USSR) could no longer
afford the next rung of the ladder.
2. Doping in Sport
Professional cyclists face a Prisoner's Dilemma over performance-enhancing drugs. If everyone
dopes, the field is level but all athletes suffer health risks and reputational costs. If you don't
dope while others do, you lose races and sponsorship. The dominant strategy becomes: dope.
This explains why doping scandals keep recurring across sports despite universal
condemnation — the structural incentives override individual ethics unless enforcement is
strong enough to change the payoffs.
3. Environmental Agreements
Countries negotiating climate agreements face a classic multi-player Prisoner's Dilemma. Clean
air is a 'public good' — everyone benefits from it whether they contributed or not. The dominant
strategy for any individual country is to let others pay for emissions reductions (to 'free ride')
while benefiting from others' sacrifice. Without an enforcement mechanism (like trade penalties
for non-compliance), agreements tend to be under-funded and under-honoured.
4. Restaurant Tip Splitting
When a group goes to a restaurant and splits the bill equally, each person faces an incentive to
order more expensive items than they otherwise would — because they each pay only a fraction
of the extra cost. Everyone does this, and the collective bill is higher than it would have been
with separate bills. This 'tragedy of the commons' dynamic appears in shared budgets, shared
resources, and collective action problems everywhere.
Escaping the Dilemma: Four Mechanisms
1. Repetition
In the one-shot Prisoner's Dilemma, defection is dominant. But in a repeated game — when
you'll face the same player again and again — the future matters. If you betray me today, I can
punish you tomorrow. The shadow of the future can sustain cooperation.
Robert Axelrod's famous computer tournaments found that in repeated Prisoner's Dilemmas,
the winning strategy was Tit-for-Tat: cooperate on the first move, then copy whatever your
opponent did last round. It's simple, forgiving, and retaliatory — exactly the properties that
sustain long-term cooperation.
2. Reputation
Even with strangers you'll never meet again, reputation can substitute for repetition. If others
observe and remember your behaviour, defecting today costs you future cooperative
Page 7
Game Theory: A Guide for Curious Minds — with Problems & Solutions
opportunities with the entire community. Platforms like eBay, Airbnb, and Uber work precisely
because reputation makes the Prisoner's Dilemma less of a dilemma.
3. Communication and Contracts
External enforcement transforms the payoffs. If a contract makes defection costly (via fines or
legal penalties), the payoff matrix changes — and cooperation can become the dominant
strategy. This is why businesses use contracts rather than handshakes, and why international
agreements work better with enforcement mechanisms.
4. Changing the Payoffs
If betraying becomes sufficiently costly — through taxes, penalties, or social stigma — the
dominant strategy flips. Carbon taxes, doping sanctions, and fraud laws are all attempts to
restructure the payoff matrix so that the individually optimal choice aligns with the socially
optimal one.
Practice Problems: Prisoner's Dilemma
Problem 3
Two pharmaceutical companies, PharmaCo and MediCorp, are each deciding whether to
invest in expensive clinical trials to verify their own drug safety claims ('Verify') or to rely
solely on internal data ('Trust Own Data'). Investing is costly but produces safer drugs.
Payoffs represent public trust scores (higher is better) and are: (Verify, Verify): 7, 7. (Verify,
Trust): 2, 9. (Trust, Verify): 9, 2. (Trust, Trust): 3, 3.
a) Draw the payoff matrix.
b) Identify any dominant strategies.
c) Find the Nash Equilibrium.
d) Is this a Prisoner's Dilemma? What real-world mechanism could shift both companies to
the (Verify, Verify) outcome?
✓ Solution
a) Payoff Matrix:
(Verify, Verify): 7, 7. (Verify, Trust Own): PharmaCo 2, MediCorp 9. (Trust Own, Verify):
PharmaCo 9, MediCorp 2. (Trust Own, Trust Own): 3, 3.
b) Dominant Strategies:
For PharmaCo: if MediCorp Verifies → Trust (9 > 7). If MediCorp Trusts → Trust (3 > 2).
Trust Own Data is dominant for PharmaCo. By symmetry, Trust Own Data is also dominant
for MediCorp.
c) Nash Equilibrium:
Page 8
Game Theory: A Guide for Curious Minds — with Problems & Solutions
(Trust Own, Trust Own) with payoffs 3, 3. Both firms fail to verify, even though both
verifying would give 7, 7. This is a strictly worse outcome for both parties.
d) Is this a Prisoner's Dilemma?
Yes — it has all the hallmarks: dominant strategy leads to equilibrium that is worse for both
players than mutual cooperation. Real-world mechanisms to fix this: (1) Mandatory
regulatory verification requirements (FDA, EMA) that make 'Trust Own Data' illegal —
changing the payoff matrix so verification is the only legal option. (2) Public disclosure laws
that reveal verification status to the public, so that 'Trust Own Data' damages public trust
scores more severely. (3) Industry-wide verification agreements with reputational penalties
for non-compliance. (4) Whistle-blower incentives that make defection riskier.
Chapter 4 — The Escalation Ladder: The Game of
Credible Threats
The escalation ladder is one of the most important applications of game theory to real-world
conflict — whether between nations, businesses, negotiators, or individuals. It describes how
conflicts intensify in a structured, sequential fashion, with each player responding to the other's
last move by raising the stakes.
The Core Structure
Imagine a ladder where each rung represents a higher level of commitment, cost, or aggression.
Two players stand on opposite sides, and the game proceeds rung by rung. At every step, each
player must decide: escalate further, hold at the current level, or back down. The central gametheoretic question at every rung is: who has more to lose — and who can credibly commit to
going higher?
🎮 The Chicken Game Connection
The escalation ladder is essentially a sequential version of the 'Chicken' game. In Chicken,
two drivers hurtle toward each other and whoever swerves first loses. The key insight: the
player who can most credibly commit to NOT swerving wins — even if swerving would be
the 'rational' choice if both are acting freely. Throwing your steering wheel out the window is
strategically brilliant because it removes your ability to swerve — forcing the opponent to
back down.
The Five Mechanisms of Escalation
1. Costly Signalling
A signal is only credible if it's costly to fake. Words are cheap — anyone can say 'I won't back
down.' But actions that impose real costs on the sender (deploying troops, implementing
Page 9
Game Theory: A Guide for Curious Minds — with Problems & Solutions
sanctions, making a public commitment) are harder to fake. Each rung of the ladder involves a
costlier signal, which is precisely why it conveys more information.
2. Commitment Devices
Thomas Schelling's great insight: the ability to commit — to visibly and irreversibly limit your
own future choices — is a source of strategic power, not weakness. A general who burns the
bridges behind his army cannot retreat. This is terrifying, but it sends an unmistakable message:
we will fight to the end. The opponent, knowing this, is more likely to back down.
3. The Threat That Leaves Something to Chance
You don't need to guarantee mutual catastrophe to deter an opponent — you just need to raise
the probability of it sufficiently. By escalating, you create a 'risk' of things spiralling out of control.
The opponent must now weigh the cost of further escalation against that risk. This is why
nuclear deterrence doesn't require a first-strike capability — just enough uncertainty about what
would happen.
4. Sunk Costs as Commitment
Having already paid a high price can strengthen your bargaining position, even though
economics tells us sunk costs shouldn't influence future decisions. In practice, having 'invested
too much to quit' signals resolve — opponents learn you are unlikely to back down. Politicians
use this explicitly: 'We cannot let our soldiers have died in vain' is a sunk-cost argument that
affects the game even though the rational future choice shouldn't depend on the past.
5. Face and Reputation
In repeated games, how you behave in one escalation affects how others will treat you in future
ones. Backing down — even when individually rational — sets a precedent that you will back
down. This 'reputation effect' can make it rational to fight costly battles you'd otherwise concede,
purely to maintain the credibility of future threats.
The Escalation Ladder: A Detailed Map
Rung
Action
Strategic Purpose
Real Example
1
Diplomatic protest / stern
statement
Cheap signal —
acknowledge the conflict
US statement condemning
Russia's 2022 border buildup
2
Economic sanctions
Costly signal — real pain on
both sides
EU sanctions on Russian
oligarchs, 2022
3
Military mobilisation / troop
deployment
Commitment device —
costly to reverse
NATO reinforcing Eastern
European bases
4
Proxy conflict / limited
strikes
Irreversible action — forces
opponent's response
US arming Ukraine; Israeli
strikes on Iranian proxies
Page 10
Game Theory: A Guide for Curious Minds — with Problems & Solutions
5
Direct military confrontation
Full escalation — both sides
bear catastrophic costs
Falklands War, 1982: both
sides escalated past
deterrence
6
Threat of weapons of mass
destruction
Existential risk — the 'last
rung'
Cuban Missile Crisis, 1962:
the closest ever to this rung
Case Study: The Cuban Missile Crisis (1962)
The Cuban Missile Crisis is the most-studied escalation game in history. In October 1962, the
US discovered Soviet nuclear missiles being installed in Cuba — 90 miles from Florida. What
followed was a 13-day escalation game that brought humanity to the brink of nuclear war.
The Asymmetric Escalation Problem
Kennedy faced a choice between: (1) doing nothing — politically untenable and signalling
weakness; (2) air strikes to destroy the missiles — risking Soviet retaliation; (3) naval
'quarantine' (blockade) — a middle rung that escalated without committing to war. Kennedy
chose the blockade, adding a specific deadline: Soviet ships must turn back or be boarded.
Khrushchev, meanwhile, faced his own ladder problem. Backing down would damage Soviet
prestige globally. But escalating to full confrontation risked nuclear war. He needed a facesaving exit ramp.
The Resolution: Providing the Off-Ramp
The crisis was resolved through back-channel negotiation that gave both sides a face-saving
narrative. The US secretly agreed to remove missiles from Turkey (something it had already
planned to do), giving Khrushchev a 'win' he could point to. The Soviets removed Cuban
missiles, giving Kennedy his public win. Crucially, neither side's humiliation was complete —
making the deal possible.
📖 The Lesson
Successful de-escalation almost always requires providing your opponent with a facesaving exit. A leader with no path to retreat except through total humiliation has no rational
incentive to de-escalate. This is why skilled negotiators always engineer off-ramps — not
from weakness, but from strategic necessity.
Business Escalation: The Amazon vs. Diapers.com Price War (2010)
Escalation games are not only fought between nations. One of the most dramatic business
escalation battles in recent decades was Amazon's campaign against Diapers.com (run by
Quidsi).
Page 11
Game Theory: A Guide for Curious Minds — with Problems & Solutions
When Diapers.com became a serious competitor in the online baby products market, Amazon
began cutting nappy prices — eventually by up to 30% below cost — in a deliberate campaign
of predatory pricing. Amazon was losing money on every sale, but had vastly deeper pockets
than Quidsi.
The strategic logic was pure escalation: Amazon was signalling, credibly and expensively, that it
could sustain losses for far longer than Quidsi could. The rung Amazon was willing to climb —
losing tens of millions — was one Quidsi simply couldn't match. Quidsi ran out of runway and
was acquired by Amazon for $545 million in 2010.
⚠️ The Danger of Escalation Asymmetry
The Amazon case illustrates a key principle: the player with greater resources can credibly
commit to staying on higher rungs for longer. Against such a player, a weaker opponent
faces a cruel choice — escalate and burn through resources faster, or back down early.
Recognising when you are the weaker party and de-escalating strategically (rather than
fighting to the last resource) is itself a sophisticated strategic move.
Practice Problems: Escalation Ladder
Problem 4
Two rival tech companies, AlphaTech and BetaSoft, are locked in a patent dispute. The
dispute can escalate through several rungs: (1) Private negotiation, (2) Formal legal notice,
(3) Filing a lawsuit, (4) Full litigation, (5) Scorched-earth legal warfare (both file hundreds of
cross-claims). At each stage, AlphaTech's credibility and BetaSoft's costs change.
AlphaTech has a stronger legal position but less cash. BetaSoft has a weaker position but
much deeper pockets.
a) Map this dispute onto the escalation ladder. What does each rung cost each party?
b) At Rung 3 (filing a lawsuit), is AlphaTech's threat to escalate to Rung 4 credible? Why or
why not?
c) What commitment device could AlphaTech use to make its threat credible even with less
cash?
d) Design the optimal de-escalation off-ramp for this dispute. What does each side need to
be able to accept a settlement?
✓ Solution
a) Mapping to the Escalation Ladder:
Rung 1 (Private negotiation): Low cost to both; AlphaTech wants licensing fees, BetaSoft
wants to pay little. Rung 2 (Formal legal notice): Moderate cost — legal fees, some
reputational effect. Rung 3 (Filing lawsuit): Significant cash drain — legal teams, discovery.
More painful for cash-poor AlphaTech proportionally. Rung 4 (Full litigation): Very
Page 12
Game Theory: A Guide for Curious Minds — with Problems & Solutions
expensive — months of court time, executive distraction. BetaSoft's deep pockets
advantage grows. Rung 5 (Scorched-earth): Extremely expensive for BOTH. Neither side
wins; lawyers win.
b) Is AlphaTech's Rung 4 threat credible?
Only partially. A threat is credible if following through is rational for the threatener. Full
litigation costs AlphaTech severely given its limited cash — BetaSoft knows this. So the
threat has limited credibility unless AlphaTech can demonstrate it can actually sustain the
costs. BetaSoft's rational response is to hold firm, knowing AlphaTech may blink first.
c) Commitment devices for AlphaTech:
Several options: (1) Secure litigation financing from a third party — making the threat
publicly credible ('We have external funding to fight for 5 years'). (2) Form a coalition with
other companies BetaSoft has allegedly infringed — sharing costs and sending a signal of
resolve. (3) Make a very public statement about the dispute, tying the CEO's personal
reputation to the outcome and making retreat politically costly internally. (4) Hire a famously
aggressive litigation firm publicly — a costly, visible signal of intent.
d) Optimal off-ramp design:
AlphaTech needs: a licensing payment that justifies its legal investment, public
acknowledgement that it won (or at least didn't lose) to protect reputation. BetaSoft needs:
a deal that costs less than full litigation, framed as a 'business decision' not an admission of
infringement, with confidentiality about the payment amount. Optimal structure: A private
cross-licensing agreement where BetaSoft pays AlphaTech a lump sum described publicly
as 'mutual technology sharing', allowing both to announce 'successful resolution' without a
clear winner or loser. The off-ramp must be designed so both CEOs can face their boards.
Chapter 5 — More Key Concepts
Zero-Sum vs. Non-Zero-Sum
In a zero-sum game, one player's gain is exactly another's loss. Every pound I win, you lose.
Chess, poker (the pot), and most competitive sports are zero-sum. The key feature: there are no
'wins' for both — any outcome that's better for me is worse for you.
Most real-world games are non-zero-sum: both can gain or both can lose. Trade is the
paradigmatic example. When the UK and France trade, both countries end up with goods they
value more than what they gave up. A successful negotiation creates value for both sides.
Understanding whether a game is zero-sum or non-zero-sum is one of the most important
analytical steps — treating a non-zero-sum game as zero-sum means destroying value
unnecessarily.
💼 Negotiation Application
Many failed negotiations happen because one party mistakenly treats a non-zero-sum
situation as zero-sum. In a salary negotiation, an employer who thinks 'every £1,000 I give
Page 13
Game Theory: A Guide for Curious Minds — with Problems & Solutions
you is £1,000 I lose' misses opportunities: flexible hours, project choice, training budgets, or
remote work options might cost the company little but be highly valued by the employee —
creating mutual gains unavailable in a purely zero-sum framing.
Dominant Strategies and Dominated Strategies
A dominant strategy is one that is best for a player regardless of what others do. If you have
one, play it — no further analysis needed. A dominated strategy is one that is always worse
than some other strategy, regardless of what others do. Rational players never play dominated
strategies — and knowing this lets you eliminate them from the matrix, sometimes revealing the
equilibrium.
This process — called 'iterated elimination of dominated strategies' — can solve many games
step by step, without needing to check every combination.
Mixed Strategies
Some games have no Nash Equilibrium in 'pure strategies' — where you definitely choose one
option. But they always have an equilibrium in 'mixed strategies' — where you randomise
between options with specific probabilities.
The classic example is a penalty kick in football. If the goalkeeper always dives left, the striker
should always shoot right. But then the goalkeeper should always dive right. But then the striker
should shoot left... There's no stable pure-strategy equilibrium. The equilibrium is for both to
mix: the goalkeeper dives each way with probabilities that make the striker indifferent between
sides; the striker shoots each way with probabilities that make the goalkeeper indifferent
between directions.
⚽ Evidence from Football
Researchers analysed thousands of penalty kicks in professional football and found that top
players and goalkeepers mix their strategies in almost exactly the proportions game theory
predicts. The Nash Equilibrium of the penalty kick game accurately describes real-world
professional behaviour.
Sequential Games and Backward Induction
So far, most examples have been simultaneous games — both players choose at the same
time. Many real games are sequential: players take turns, and each can see what the other has
done. These are analysed differently.
Page 14
Game Theory: A Guide for Curious Minds — with Problems & Solutions
The key technique for sequential games is backward induction: start from the end of the game
tree and work backward. What would a rational player do at the last decision node? Given that,
what would the previous player do? And so on, back to the first move.
Example: In a simple sequential bargaining game, a buyer makes a take-it-or-leave-it offer to a
seller. What should the buyer offer? Backward induction: the seller will accept any offer that's
better than their outside option (walking away with nothing). So the rational buyer offers just
barely above zero — and the rational seller accepts. This 'first-mover advantage' in sequential
games is a robust prediction.
Auctions: Mechanism Design in Practice
Mechanism design is 'reverse game theory': instead of analysing a given game, you design the
rules to produce a desired outcome. Auctions are the best-studied example.
Second-Price Sealed-Bid Auction — Why truthful bidding is dominant
You bid your true value
You bid false value
Your value is highest
Win, pay 2nd-highest bid
Lose, pay nothing
Your value is not
highest
Win, pay 2nd-highest bid
Lose, pay nothing
In a Vickrey (second-price) auction, you pay the second-highest bid if you win. The remarkable
result: bidding your true value is a dominant strategy. If you overbid, you might win when the
price exceeds your value — losing money. If you underbid, you might lose when you could have
won and profited. Your own bid only determines whether you win — not what you pay. So
there's never a reason to deviate from truth.
📱 Google's Ad Auctions
Google's advertising slots use a generalised Vickrey mechanism. When you search for a
term, an automated auction runs in milliseconds. Advertisers bid for your attention. The
mechanism is designed so that truthful bidding maximises advertiser welfare while
maximising Google's revenue. This is applied game theory generating hundreds of billions
of dollars annually.
Chapter 6 — Comprehensive Practice Problems
Problem Set A: Analysing Real Scenarios
Page 15
Game Theory: A Guide for Curious Minds — with Problems & Solutions
Problem 5
OPEC Oil Production Game: Saudi Arabia and Russia each control large oil supplies. They
can each produce 'High' or 'Low' quantities. High production keeps oil prices low (good for
consumers, bad for producers). Low production keeps prices high. Payoffs (billions USD
annual revenue): (Low, Low): 80, 80. (Low, High): 40, 100. (High, Low): 100, 40. (High,
High): 55, 55.
a) Identify each player's dominant strategy.
b) Find the Nash Equilibrium and calculate the 'efficiency loss' (how much total revenue is
lost vs. the best cooperative outcome).
c) OPEC operates as a cartel — a binding agreement to produce Low. Explain why even
with this agreement, each member has an incentive to cheat. What mechanisms does
OPEC use to enforce cooperation?
d) How does this game change if oil demand is falling due to electric vehicles? (Consider
how this changes future payoffs.)
✓ Solution
a) Dominant Strategies:
Saudi Arabia: If Russia plays Low → Saudi Arabia gets 80 (Low) or 100 (High) → prefers
High. If Russia plays High → Saudi Arabia gets 40 (Low) or 55 (High) → prefers High.
HIGH is dominant for Saudi Arabia. By symmetry, HIGH is also dominant for Russia.
b) Nash Equilibrium and Efficiency Loss:
Nash Equilibrium: (High, High) → both earn $55bn each. Total: $110bn. Best cooperative
outcome: (Low, Low) → $80bn each. Total: $160bn. Efficiency loss = $160bn - $110bn =
$50bn in total revenue destroyed by the dilemma structure. Each country's individual loss
from defecting vs cooperating: $80bn - $55bn = $25bn per country.
c) Why cheat, and OPEC's enforcement:
Even within a cartel agreement, each member faces the same dominant-strategy logic. If
everyone else keeps production Low, you can earn $100bn by secretly producing High —
$20bn more than if you honour the agreement. OPEC uses several enforcement
mechanisms: (1) Regular production monitoring through independent auditors and tanker
tracking. (2) Quotas published publicly, making cheating visible to all members. (3) Threat
of punishment — if one member cheats, others threaten to flood the market, collapsing
prices for everyone. (4) Rotating leadership that benefits from reputation for compliance.
None of these fully solves the problem — OPEC members cheat regularly, which is why
OPEC production agreements are frequently revised.
d) Effect of falling oil demand:
If electric vehicles reduce future oil demand, the future value of High production falls.
Backward induction: if the (High, High) equilibrium becomes inevitable in a few years
anyway (because demand collapse makes cooperation impossible), the incentive to
maintain the cartel today weakens. The 'shadow of the future' — which usually supports
cooperation — starts working in reverse: 'we should extract as much value as possible now,
before demand collapses.' This is exactly why OPEC has struggled to maintain production
discipline in the face of long-term demand uncertainty.
Page 16
Game Theory: A Guide for Curious Minds — with Problems & Solutions
Problem 6
Negotiation Game: A start-up is negotiating salary with a candidate. The start-up can offer
'Low' (£60k) or 'High' (£75k). The candidate can 'Accept' or 'Reject'. If rejected, the start-up
must restart the search at a cost of £20k, and the candidate loses 3 months' income. Both
parties know that the candidate's 'outside option' (another job offer) pays £65k.
a) Draw the game tree (sequential game). Who moves first?
b) Using backward induction, what salary should the start-up offer?
c) How does the candidate's outside option change the analysis? What if their outside
option were £70k instead?
d) The candidate claims they have an offer for £72k (but they're bluffing — it's only £65k).
How should the start-up respond? What makes bluffing risky in sequential games?
✓ Solution
a) Game Tree:
The start-up moves first (offers Low or High). Then the candidate responds (Accept or
Reject). If rejected → both incur costs and restart. This is a sequential game of asymmetric
information — the start-up doesn't know the candidate's true outside option.
b) Backward Induction (if start-up knows outside option = £65k):
Step 1: If the start-up offers £75k — candidate compares £75k to outside option £65k →
Accept (£75k > £65k). Start-up's payoff: hires candidate at £75k. Step 2: If the start-up
offers £60k — candidate compares £60k to outside option £65k → Reject (£60k < £65k).
Start-up's payoff: pay £20k restart cost, delay, try again. Backward induction says: the startup should offer £75k (or technically, any amount just above £65k — e.g., £65,001). Offering
£60k leads to rejection which costs £20k and delays hiring.
c) Effect of different outside options:
If outside option = £65k: Offer anything > £65k → accepted. Offer £75k, candidate accepts.
If outside option = £70k: Candidate now rejects anything below £70k. The start-up must
offer at least £70k to hire. If even £75k is not enough above the candidate's outside option
to be worthwhile... the start-up might prefer to search for a different candidate. The outside
option is the key parameter in any negotiation — it's the 'threat point' that determines the
minimum acceptable offer.
d) Responding to the bluff:
If the start-up believes the £72k claim, backward induction says offer at least £72k (or lose
the candidate). If the start-up is sceptical, it faces a Bayesian decision: what's the
probability the claim is true? If low, call the bluff by offering £67k. The candidate's dilemma:
if they bluff and get called, they must either accept £67k (below their claimed value,
revealing the bluff) or reject and lose the offer (gaining only their true outside option of
£65k). Bluffing is risky in sequential games because: (1) If your bluff gets called and you
capitulate, your credibility is destroyed for future negotiations. (2) If your bluff gets called
and you hold firm, you may end up worse than if you hadn't bluffed. Credibility — the belief
others have in your claims — is a strategic asset worth protecting.
Page 17
Game Theory: A Guide for Curious Minds — with Problems & Solutions
Chapter 7 — Evolutionary Game Theory
Game theory was invented for rational human decision-makers. But in the 1970s, biologist John
Maynard Smith realised that natural selection is itself a strategic process — and its tools could
explain animal behaviour without assuming anyone was thinking at all. The payoffs in
evolutionary game theory are reproductive fitness: strategies that produce more offspring
spread through the population.
The Hawk-Dove Game
Consider a population of animals competing for a resource worth V (say, food worth 4 units of
fitness). When two animals meet, they can play:
•
•
Hawk: Always fight aggressively. Risk injury (cost C = 6 units).
Dove: Display but never fight. Retreat if challenged by a Hawk.
Hawk-Dove Payoffs (V = 4, C = 6)
Opponent: Hawk
Opponent: Dove
You: Hawk
(V-C)/2 = -1
V=4
You: Dove
0
V/2 = 2
Analysis: If the population is mostly Doves, a Hawk mutant does very well (wins every resource
without a fight). Hawks spread. But as Hawks become common, more fights occur — and the
average Hawk payoff falls (frequent injuries). When Hawks are common, a Dove does better by
avoiding costly fights. The stable population mix — where neither strategy can invade —
depends on V and C.
🌿 Real-World Hawk-Dove
This model explains why most animals have evolved ritualised display rather than all-out
fighting. Stags lock antlers but rarely fight to the death. Wolves use submissive postures.
Fish inflate themselves to look larger. These are 'Dove' strategies that avoid the (Hawk vs
Hawk) mutual cost of serious injury — the evolutionary equilibrium predicts their
prevalence.
Cooperation in Nature: Why Ants Help Each Other
How does cooperation evolve when selfish behaviour seems dominant? William Hamilton's kin
selection theory solved part of the puzzle: organisms share genes with relatives, so helping a
relative who shares your genes can propagate those genes even at personal cost. A worker ant
helping its queen is not 'altruistic' in a game-theory sense — it's investing in shared genetic
material.
Page 18
Game Theory: A Guide for Curious Minds — with Problems & Solutions
For non-relatives, Robert Trivers' reciprocal altruism theory explains cooperation: 'I'll scratch
your back if you'll scratch mine.' This works exactly like a repeated Prisoner's Dilemma — future
interactions make cooperation rational. Vampire bats share blood meals with unrelated bats
who need food, but remember who shared and who didn't — exhibiting Tit-for-Tat in nature.
Chapter 8 — Thinking Strategically: Key Takeaways
Game theory is not just an academic discipline — it's a way of seeing the world. Here are the
most valuable thinking habits it instils:
4. Think from the other player's perspective first. Before deciding what to do, ask: what is
rational for them? What are their payoffs, their outside options, their constraints?
5. Ask whether the situation is zero-sum or non-zero-sum. If there are potential mutual
gains, look for them — don't treat every negotiation like a battle over a fixed pie.
6. Test for dominant strategies. If you have one, use it. If your opponent has one, assume
they'll use it.
7. Find the Nash Equilibrium — but don't assume it's good. Know where the game will
settle, but also understand whether it's a trap (Prisoner's Dilemma) or a genuine
optimum.
8. Assess the credibility of threats and promises. A threat only works if following through is
rational. A commitment device — an irreversible action that makes backing down
impossible — can make incredible threats credible.
9. Consider the shadow of the future. In repeated games, reputation and future interactions
change everything. Cooperate with people you'll deal with again; punish defection
quickly and proportionally.
10. Design off-ramps in escalation situations. The best negotiators always identify how their
opponent can back down without total humiliation — because an opponent with no exit
has no reason to stop escalating.
📚 Recommended Reading
Introductory: 'The Art of Strategy' by Dixit and Nalebuff — the best accessible introduction.
'Thinking Strategically' by Dixit and Nalebuff — slightly more formal. Intermediate: 'An
Introduction to Game Theory' by Martin Osborne (freely available online). Advanced: 'Game
Theory' by Drew Fudenberg and Jean Tirole. For applications: 'The Evolution of
Cooperation' by Robert Axelrod. 'Micromotives and Macrobehavior' by Thomas Schelling.
Quick-Reference Glossary
Term
Definition
Page 19
Game Theory: A Guide for Curious Minds — with Problems & Solutions
Nash Equilibrium
A stable outcome where no player can improve by changing strategy
alone, given what others are doing.
Dominant Strategy
A strategy that is best for a player regardless of what all other players
choose.
Dominated Strategy
A strategy that is always worse than some other available strategy —
rational players never play these.
Prisoner's Dilemma
A game where individual rationality leads both players to an outcome
that's worse than if they had cooperated.
Zero-Sum Game
A game where one player's gain exactly equals another's loss. Total
payoffs always sum to zero.
Non-Zero-Sum Game
A game where mutual gains (or mutual losses) are possible — most realworld situations.
Payoff Matrix
A table showing the outcome for every possible combination of player
strategies.
Backward Induction
Solving a sequential game by starting from the final moves and reasoning
backward to the first.
Mixed Strategy
Randomising between options according to specific probabilities, rather
than always choosing the same option.
Commitment Device
An action that irreversibly limits your own future choices, making threats
or promises credible.
Schelling Point
A solution people naturally converge on without communication, due to its
salience or obviousness.
Tit-for-Tat
A strategy: cooperate first, then copy whatever your opponent did in the
previous round.
Escalation Ladder
A model of sequential conflict where each player raises stakes in
response to the other's last move.
Mechanism Design
Designing the rules of a game to produce a desired outcome — 'reverse
game theory'.
ESS
Evolutionarily Stable Strategy: a strategy that, once adopted by most of a
population, cannot be invaded by any alternative.
Outside Option
What a player gets if they leave the current game entirely — sets the
minimum acceptable deal in negotiation.
Page 20
0
You can add this document to your study collection(s)
Sign in Available only to authorized usersYou can add this document to your saved list
Sign in Available only to authorized users(For complaints, use another form )