Prisoner’s Dilemma: A Comprehensive Guide
The Prisoner’s Dilemma, formalized in 1950 by Flood and Dresher, illustrates the conflict between individual self-interest and collective benefit. Named by Albert W. Tucker, it shows why rational actors may choose suboptimal outcomes, a key concept in game theory.
This MathMultiverse guide explores its scenarios, payoff structures, visualizations, and applications across economics, psychology, and more.
Scenarios
Classic Scenario
Two prisoners, A and B, choose to confess (C) or stay silent (S):
- Both silent: 1 year each.
- Both confess: 5 years each.
- One confesses: 0 years, other 10 years.
Iterated Version
Repeated rounds, total payoff:
Three-Player Variant
Adjusted payoffs for three prisoners.
Continuous Version
Effort \( e_i \in [0, 1] \):
Payoff Analysis
Payoff Matrix
Prison years (negative utility):
Confess dominates:
\[ u_i(C, S) = 0 > -1 = u_i(S, S) \]
Nash Equilibrium
(C, C) is stable:
Pareto Optimality
(S, S) is better but unstable:
Payoff Heatmap
Payoff matrix visualized as a heatmap (Player A’s years in prison).
Applications
Economics
Price wars:
Psychology
Cooperation rate:
Biology
Altruism vs. selfishness:
Politics
Arms races model escalation vs. cooperation.