The prisoner's dilemma is a standard example in game theory of a game in which two rational participants, each acting in their own individual self interest, do not produce the outcome that would be best for the two of them jointly. In its classic formulation, two members of a criminal gang are held separately and each is offered a lighter sentence for betraying the other; if both stay silent both receive a light sentence, if both betray each other both receive a moderate sentence, but if only one betrays the other the betrayer goes free while the other receives the harshest sentence, so that betrayal is the individually rational choice for each prisoner regardless of what the other does, even though mutual silence would have produced a better outcome for both. The game was framed in its familiar prisoner narrative by Albert Tucker in 1950 based on earlier work at the RAND Corporation by Merrill Flood and Melvin Dresher, and it has since become a central model for studying cooperation and conflict in economics, evolutionary biology and political science, particularly in its iterated form, in which the same two players face the dilemma repeatedly.
Facts
Connections
In Branch
Source Wikipedia: Prisoner's dilemma
Is Kind Of Object
Entity-backed identity for the object-kind enum value this mathematical object already carries, resolved to a mathematics concept by an explicit value-to-entity map (phase 3 bucket conversion, docs\design_entity_backed_browse_buckets_20260928.md). The object-kind fact itself stays on the object unchanged.
Sources
1. Wikipedia: Prisoner's dilemma
Premise section
The puzzle was designed by Merrill Flood and Melvin Dresher in 1950 during their work at the RAND Corporation.
In Branch: Game Theory, Lead sentence
In game theory, the prisoner's dilemma is a thought experiment involving two rational agents, each of whom can either cooperate fo
View the SourceReader Challenges (0)
No disputes yet. Spotted an error or a better source? Open the first one.
Sign in to dispute this or suggest a correction.