← All Games

Prisoner's Dilemma

You and a partner are being interrogated. Each round, choose to stay silent (Cooperate) or betray (Defect) — without knowing what they'll do.

Round
1 / 10
Your Score
0
Opponent Score
0

Play 10 rounds of the classic Prisoner's Dilemma against a simulated opponent.
Your goal is to maximize your own total score — but mutual cooperation pays off more than mutual betrayal.

Opponent Strategy
Both Cooperate
You +3  ·  Them +3
You Defect, They Cooperate
You +5  ·  Them +0
You Cooperate, They Defect
You +0  ·  Them +5
Both Defect
You +1  ·  Them +1
Game Over
Your Score
0
Opponent Score
0
Coop Rate
0%
All Rounds

What is the Prisoner's Dilemma?

First formalized in 1950 by Merrill Flood and Melvin Dresher at RAND Corporation, the Prisoner's Dilemma is the cornerstone of game theory and behavioral economics. It reveals a fundamental tension: what is individually rational (defecting) can lead to a collectively worse outcome than mutual cooperation.


The payoff matrix:

They Cooperate
They Defect
You Cooperate
You +3, Them +3
You +0, Them +5
You Defect
You +5, Them +0
You +1, Them +1

Tit-for-Tat — cooperate first, then mirror the opponent's last move — famously won Robert Axelrod's 1980 computer tournaments, beating pure defection strategies. It demonstrates that in repeated interactions, reciprocal altruism and conditional cooperation outperform pure self-interest.


The dilemma models real-world situations: arms races, climate agreements, business competition, and even everyday social cooperation. It explains why trust is hard to establish but easy to destroy.