TOPICS
Search

Prisoner's Dilemma


The prisoner's dilemma is a problem in game theory framed by A. Tucker. Suppose each of two prisoners A and B, who are not allowed to communicate with each other, is offered to be set free if he implicates the other. If neither implicates the other, both will receive the usual sentence. However, if the prisoners implicate each other, then both are presumed guilty and granted harsh sentences.

A dilemma arises in deciding the best course of action in the absence of knowledge of the other prisoner's decision. Each prisoner's best strategy is to turn the other in, regardless of the other's choice. However, if the prisoners turn each other in, both fare worse than if both remain silent.

Writing cooperation for remaining silent and defection for implicating the other prisoner, a general payoff matrix for the game is

 [(R,R) (S,T); (T,S) (P,P)],

where T>R>P>S and, in the usual repeated-game formulation, 2R>T+S. Here T, R, P, and S are conventionally called the temptation, reward, punishment, and sucker's payoff. Mutual defection is the unique Nash equilibrium, although mutual cooperation gives both players the larger payoff R>P.

The underlying game was developed and experimentally tested by M. Flood and M. Dresher at RAND in 1949-1950. Tucker subsequently supplied the prisoner story and the name "prisoner's dilemma" (Poundstone 1992).

A repeated version of the game, in which strategies can depend on the history of previous moves, is known as the iterated prisoner's dilemma.

Mosteller (1987) describes a different problem he terms "the prisoner's dilemma." In this problem, three prisoners A, B, and C with apparently equally good records have applied for parole, and the parole board has decided to release two, but not all three. A warder knows which two are to be released, and one of the prisoners (A) asks the warder for the name of the one prisoner other than himself who is to be released. While his chances of being released before asking are 2/3, he thinks his chances after asking and being told "B will be released" are reduced to 1/2, since now either A and B or B and C are to be released. However, he is mistaken since his chances remain 2/3.

The Season 1 episode "Dirty Bomb" (2005) of the television crime drama NUMB3RS mentions the Prisoner's dilemma.


See also

Dilemma, Iterated Prisoner's Dilemma, Nash Equilibrium, Payoff Matrix, Tit-for-Tat

Explore with Wolfram|Alpha

References

Axelrod, R. The Evolution of Cooperation. New York: BasicBooks, 1985.Erickson, G. W. and Fossa, J. A. Dictionary of Paradox. Lanham, MD: University Press of America, pp. 164-165, 1998.Flood, M. M. "Some Experimental Games." Santa Monica, CA: RAND Corporation, Research Memorandum RM-789-1, rev. Jun. 20, 1952. https://www.rand.org/pubs/research_memoranda/RM789-1.html.Goetz, P. "Phil Goetz's Complexity Dictionary." https://web.archive.org/web/20001209121200/http://www.cs.buffalo.edu/~goetz/DICT/dict2.html#P.Mosteller, F. "The Prisoner's Dilemma." Problem 13 in Fifty Challenging Problems in Probability with Solutions. New York: Dover, pp. 4 and 14-15, 1987.Poundstone, W. Prisoner's Dilemma. New York: Doubleday, 1992.Veritasium. "This Game Theory Problem Will Change the Way You See the World." Dec. 23, 2023. https://www.youtube.com/watch?v=mScpHTIi-kM.

Referenced on Wolfram|Alpha

Prisoner's Dilemma

Cite this as:

Weisstein, Eric W. "Prisoner's Dilemma." From MathWorld--A Wolfram Resource. https://mathworld.wolfram.com/PrisonersDilemma.html

Subject classifications