LLMpediaThe first transparent, open encyclopedia generated by LLMs

Prisoner's Dilemma

Generated by DeepSeek V3.2
Note: This article was automatically generated by a large language model (LLM) from purely parametric knowledge (no retrieval). It may contain inaccuracies or hallucinations. This encyclopedia is part of a research project currently under review.
Article Genealogy
Parent: Freedom Evolves Hop 4
Expansion Funnel Raw 46 → Dedup 0 → NER 0 → Enqueued 0
1. Extracted46
2. After dedup0 (None)
3. After NER0 ()
4. Enqueued0 ()
Prisoner's Dilemma
NamePrisoner's Dilemma
CaptionA classic representation of the payoff matrix.
SolutionNash equilibrium
DiscoveredMerrill Flood, Melvin Dresher
Year1950
StrategiesCooperate, Defect

Prisoner's Dilemma is a fundamental concept in game theory that illustrates why two rational individuals might not cooperate, even when it appears to be in their best mutual interest. It was formally framed in 1950 by Merrill Flood and Melvin Dresher at the RAND Corporation, with the canonical prisoner story later popularized by Albert W. Tucker. The paradox highlights a conflict between individual and group rationality, serving as a foundational model for studying cooperation, trust, and strategic decision-making in fields ranging from economics and political science to evolutionary biology and computer science.

Definition and basic scenario

The classic narrative involves two members of a criminal organization arrested and held in solitary confinement, unable to communicate. The prosecutor lacks sufficient evidence for a major conviction and offers each prisoner a deal. If one testifies against the other (defects) and the other remains silent (cooperates), the defector goes free while the cooperator receives a long sentence. If both defect, each receives a moderate sentence. If both cooperate, each gets a light sentence. The dilemma is that while mutual cooperation yields a better collective outcome, the individual incentive to defect, fearing betrayal and seeking personal gain, leads both to choose a worse mutual outcome.

Formal description and payoff matrix

Formally, the Prisoner's Dilemma is a two-player, non-zero-sum game where each player has two strategies: cooperate (C) or defect (D). The payoffs are typically ordered such that, for each player, the reward for mutual cooperation (R) is less than the temptation to defect (T), which is greater than the punishment for mutual defection (P), which is in turn greater than the sucker's payoff (S). The standard condition is T > R > P > S, with the additional constraint 2R > T + S to ensure mutual cooperation is socially optimal. The resulting payoff matrix creates a dominant strategy for each player to defect, as defection yields a higher payoff regardless of the opponent's choice, leading to a Nash equilibrium at (D, D) that is Pareto inefficient.

Iterated prisoner's dilemma

When the game is repeated over multiple rounds, known as the iterated prisoner's dilemma, the strategic landscape changes profoundly because players can condition their future actions on past behavior. This setting, studied extensively by figures like Robert Axelrod through his famous computer tournaments, allows for the emergence of cooperation through strategies like tit for tat. The possibility of future retaliation or reward alters the calculus, making cooperative equilibria sustainable. This framework has been crucial for modeling long-term interactions in fields like evolutionary game theory, where it helps explain the development of cooperative behaviors among organisms, as explored in the work of John Maynard Smith.

Real-world examples and applications

The logic of the dilemma manifests in numerous real-world contexts. In international relations, it models arms races during the Cold War between the United States and the Soviet Union, where mutual disarmament (cooperation) was preferable but the fear of cheating led to escalation. In environmental economics, it underlies the tragedy of the commons, where individuals overuse a shared resource like a fishery. In business, it describes price wars between competitors like Coca-Cola and PepsiCo. It also applies to team production problems within firms, public goods provision, and even biological phenomena like bacterial quorum sensing.

Strategies and equilibrium analysis

Analysis of optimal strategies centers on the concept of Nash equilibrium, where no player can benefit by unilaterally changing strategy. In the one-shot game, defection is the only dominant strategy equilibrium. For the iterated version, the folk theorem in game theory suggests a multitude of equilibria are possible depending on the discount factor for future payoffs. Successful strategies identified in tournaments, such as tit for tat (cooperate first, then mimic the opponent's previous move), are simple, nice, provokable, and forgiving. The evolutionarily stable strategy concept, pioneered by John Maynard Smith, is used to analyze which strategies can resist invasion by mutants in a population.

Many variations extend the basic model. The traveler's dilemma introduces a different payoff structure based on claim amounts. The stag hunt game, discussed by Jean-Jacques Rousseau, emphasizes the risk of coordination failure for a higher reward. The chicken game models a contest of brinkmanship. The public goods game generalizes the dilemma to multiple players. The trust game and the ultimatum game explore related themes of reciprocity and fairness. These models are applied in experimental economics, often using protocols developed at institutions like the University of Zurich, to test human behavior against theoretical predictions.