text:
Prisoner's dilemma
From Wikipedia, the free encyclopedia
Jump to navigation Jump to search
For other uses, see Prisoner's dilemma (disambiguation).
Prisoner's dilemma payoff matrix
B
A
B stays
silent
B
betrays
A stays
silent
-1
-1
0
-3
A
betrays
-3
0
-2
-2
The prisoner's dilemma is a standard example of a game analyzed in game theory that shows why two completely rational individuals might not cooperate, even if it appears that it is in their best interests to do so. It was originally framed by Merrill Flood and Melvin Dresher while working at RAND in 1950. Albert W. Tucker formalized the game with prison sentence rewards and named it "prisoner's dilemma",[1] presenting it as follows:
Two members of a criminal gang are arrested and imprisoned. Each prisoner is in solitary confinement with no means of communicating with the other. The prosecutors lack sufficient evidence to convict the pair on the principal charge, but they have enough to convict both on a lesser charge. Simultaneously, the prosecutors offer each prisoner a bargain. Each prisoner is given the opportunity either to betray the other by testifying that the other committed the crime, or to cooperate with the other by remaining silent. The offer is:
If A and B each betray the other, each of them serves two years in prison
If A betrays B but B remains silent, A will be set free and B will serve three years in prison (and vice versa)
If A and B both remain silent, both of them will only serve one year in prison (on the lesser charge).
It is implied that the prisoners will have no opportunity to reward or punish their partner other than the prison sentences they get and that their decision will not affect their reputation in the future. Because betraying a partner offers a greater reward than cooperating with them, all purely rational self-interested prisoners will betray the other, meaning the only possible outcome for two purely rational prisoners is for them to betray each other.[2] The interesting part of this result is that pursuing individual reward logically leads both of the prisoners to betray when they would get a better reward if they both kept silent. In reality, humans display a systemic bias towards cooperative behavior in this and similar games despite what is predicted by simple models of "rational" self-interested action.[3][4][5][6]
An extended "iterated" version of the game also exists. In this version, the classic game is played repeatedly between the same prisoners, who continuously have the opportunity to penalize the other for previous decisions. If the number of times the game will be played is known to the players, then (by backward induction) two classically rational players will betray each other repeatedly, for the same reasons as the single-shot variant. In an infinite or unknown length game there is no fixed optimum strategy, and prisoner's dilemma tournaments have been held to compete and test algorithms for such cases.[7]
The prisoner's dilemma game can be used as a model for many real world situations involving cooperative behavior. In casual usage, the label "prisoner's dilemma" may be applied to situations not strictly matching the formal criteria of the classic or iterative games: for instance, those in which two entities could gain important benefits from cooperating or suffer from the failure to do so, but find it difficult or expensive—not necessarily impossible—to coordinate their activities.
Contents
1 Strategy for the prisoner's dilemma
2 Generalized form
2.1 Special case: Donation game
3 The iterated prisoner's dilemma
3.1 Strategy for the iterated prisoner's dilemma
3.2 Stochastic iterated prisoner's dilemma
3.2.1 Zero-determinant strategies
3.3 Continuous iterated prisoner's dilemma
3.4 Emergence of stable strategies
4 Real-life examples
4.1 In environmental studies
4.2 In animals
4.3 In psychology
4.4 In economics
4.5 In sport
4.6 In international politics
4.7 Multiplayer dilemmas
5 Related games
5.1 Closed-bag exchange
5.2 Friend or Foe?
5.3 Iterated snowdrift
6 Software
7 In fiction
8 See also
9 References
10 Further reading
11 External links
Strategy for the prisoner's dilemma[edit]
Two prisoners are separated into individual rooms and cannot communicate with each other. The normal game is shown below:
Prisoner B
Prisoner A
Prisoner B stays silent
(cooperates)
Prisoner B betrays
(defects)
Prisoner A stays silent
(cooperates)
Each serves 1 year Prisoner A: 3 years
Prisoner B: goes free
Prisoner A betrays
(defects)
Prisoner A: goes free
Prisoner B: 3 years Each serves 2 years
It is assumed that both prisoners understand the nature of the game, have no loyalty to each other, and will have no opportunity for retribution or reward outside the game. Regardless of what the other decides, each prisoner gets a higher reward by betraying the other ("defecting"). The reasoning involves an argument by dilemma: B will either cooperate or defect. If B cooperates, A should defect, because going free is better than serving 1 year. If B defects, A should also defect, because serving 2 years is better than serving 3. So either way, A should defect. Parallel reasoning will show that B should defect.
Because defection always results in a better payoff than cooperation regardless of the other player's choice, it is a dominant strategy. Mutual defection is the only strong Nash equilibrium in the game (i.e. the only outcome from which each player could only do worse by unilaterally changing strategy). The dilemma, then, is that mutual cooperation yields a better outcome than mutual defection but is not the rational outcome because the choice to cooperate, from a self-interested perspective, is irrational.
Generalized form[edit]
The structure of the traditional Prisoner's Dilemma can be generalized from its original prisoner setting. Suppose that the two players are represented by the colors, red and blue, and that each player chooses to either "Cooperate" or "Defect".
If both players cooperate, they both receive the reward R for cooperating. If both players defect, they both receive the punishment payoff P. If Blue defects while Red cooperates, then Blue receives the temptation payoff T, while Red receives the "sucker's" payoff, S. Similarly, if Blue cooperates while Red defects, then Blue receives the sucker's payoff S, while Red receives the temptation payoff T.
This can be expressed in normal form:
Canonical PD payoff matrix
Red
Blue
Cooperate
Defect
Cooperate
R
R
T
S
Defect
S
T
P
P
and to be a prisoner's dilemma game in the strong sense, the following condition must hold for the payoffs:
T > R > P > S
The payoff relationship R > P implies that mutual cooperation is superior to mutual defection, while the payoff relationships T > R and P > S imply that defection is the dominant strategy for both agents.
Special case: Donation game[edit]
The "donation game"[8] is a form of prisoner's dilemma in which cooperation corresponds to offering the other player a benefit b at a personal cost c with b > c. Defection means offering nothing. The payoff matrix is thus
Red
Blue
Cooperate
Defect
Cooperate
b-c
b-c
b
-c
Defect
-c
b
0
0
Note that 2 R > T + S {\displaystyle 2R>T+S} (i.e. 2 ( b − c ) > b − c {\displaystyle 2(b-c)>b-c} ) which qualifies the donation game to be an iterated game (see next section).
The donation game may be applied to markets. Suppose X grows oranges, Y grows apples. The marginal utility of an apple to the orange-grower X is b, which is higher than the marginal utility (c) of an orange, since X has a surplus of oranges and no apples. Similarly, for apple-grower Y, the marginal utility of an orange is b while the marginal utility of an apple is c. If X and Y contract to exchange an apple and an orange, and each fulfills their end of the deal, then each receive a payoff of b-c. If one "defects" and does not deliver as promised, the defector will receive a payoff of b, while the cooperator will lose c. If both defect, then neither one gains or loses anything.
The iterated prisoner's dilemma[edit]
This section needs additional citations for verification. Please help improve this article by adding citations to reliable sources. Unsourced material may be challenged and removed. (November 2012) (Learn how and when to remove this template message)
If two players play prisoner's dilemma more than once in succession and they remember previous actions of their opponent and change their strategy accordingly, the game is called iterated prisoner's dilemma.
In addition to the general form above, the iterative version also requires that 2R > T + S, to prevent alternating cooperation and defection giving a greater reward than mutual cooperation.
The iterated prisoner's dilemma game is fundamental to some theories of human cooperation and trust. On the assumption that the game can model transactions between two people requiring trust, cooperative behaviour in populations may be modeled by a multi-player, iterated, version of the game. It has, consequently, fascinated many scholars over the years. In 1975, Grofman and Pool estimated the count of scholarly articles devoted to it at over 2,000. The iterated prisoner's dilemma has also been referred to as the "Peace-War game".[9]
If the game is played exactly N times and both players know this, then it is optimal to defect in all rounds. The only possible Nash equilibrium is to always defect. The proof is inductive: one might as well defect on the last turn, since the opponent will not have a chance to later retaliate. Therefore, both will defect on the last turn. Thus, the player might as well defect on the second-to-last turn, since the opponent will defect on the last no matter what is done, and so on. The same applies if the game length is unknown but has a known upper limit.
Unlike the standard prisoner's dilemma, in the iterated prisoner's dilemma the defection strategy is counter-intuitive and fails badly to predict the behavior of human players. Within standard economic theory, though, this is the only correct answer. The superrational strategy in the iterated prisoner's dilemma with fixed N is to cooperate against a superrational opponent, and in the limit of large N, experimental results on strategies agree with the superrational version, not the game-theoretic rational one.
For cooperation to emerge between game theoretic rational players, the total number of rounds N must be unknown to the players. In this case 'always defect' may no longer be a strictly dominant strategy, only a Nash equilibrium. Amongst results shown by Robert Aumann in a 1959 paper, rational players repeatedly interacting for indefinitely long games can sustain the cooperative outcome.
Strategy for the iterated prisoner's dilemma[edit]
Interest in the iterated prisoner's dilemma (IPD) was kindled by Robert Axelrod in his book The Evolution of Cooperation (1984). In it he reports on a tournament he organized of the N step prisoner's dilemma (with N fixed) in which participants have to choose their mutual strategy again and again, and have memory of their previous encounters. Axelrod invited academic colleagues all over the world to devise computer strategies to compete in an IPD tournament. The programs that were entered varied widely in algorithmic complexity, initial hostility, capacity for forgiveness, and so forth.
Axelrod discovered that when these encounters were repeated over a long period of time with many players, each with different strategies, greedy strategies tended to do very poorly in the long run while more altruistic strategies did better, as judged purely by self-interest. He used this to show a possible mechanism for the evolution of altruistic behaviour from mechanisms that are initially purely selfish, by natural selection.
The winning deterministic strategy was tit for tat, which Anatol Rapoport developed and entered into the tournament. It was the simplest of any program entered, containing only four lines of BASIC, and won the contest. The strategy is simply to cooperate on the first iteration of the game; after that, the player does what his or her opponent did on the previous move. Depending on the situation, a slightly better strategy can be "tit for tat with forgiveness". When the opponent defects, on the next move, the player sometimes cooperates anyway, with a small probability (around 1–5%). This allows for occasional recovery from getting trapped in a cycle of defections. The exact probability depends on the line-up of opponents.
By analysing the top-scoring strategies, Axelrod stated several conditions necessary for a strategy to be successful.
Nice
The most important condition is that the strategy must be "nice", that is, it will not defect before its opponent does (this is sometimes referred to as an "optimistic" algorithm). Almost all of the top-scoring strategies were nice; therefore, a purely selfish strategy will not "cheat" on its opponent, for purely self-interested reasons first.
Retaliating
However, Axelrod contended, the successful strategy must not be a blind optimist. It must sometimes retaliate. An example of a non-retaliating strategy is Always Cooperate. This is a very bad choice, as "nasty" strategies will ruthlessly exploit such players.
Forgiving
Successful strategies must also be forgiving. Though players will retaliate, they will once again fall back to cooperating if the opponent does not continue to defect. This stops long runs of revenge and counter-revenge, maximizing points.
Non-envious
The last quality is being non-envious, that is not striving to score more than the opponent.
The optimal (points-maximizing) strategy for the one-time PD game is simply defection; as explained above, this is true whatever the composition of opponents may be. However, in the iterated-PD game the optimal strategy depends upon the strategies of likely opponents, and how they will react to defections and cooperations. For example, consider a population where everyone defects every time, except for a single individual following the tit for tat strategy. That individual is at a slight disadvantage because of the loss on the first turn. In such a population, the optimal strategy for that individual is to defect every time. In a population with a certain percentage of always-defectors and the rest being tit for tat players, the optimal strategy for an individual depends on the percentage, and on the length of the game.
In the strategy called Pavlov, win-stay, lose-switch, faced with a failure to cooperate, the player switches strategy the next turn.[10] In certain circumstances,[specify] Pavlov beats all other strategies by giving preferential treatment to co-players using a similar strategy.
Deriving the optimal strategy is generally done in two ways:
Bayesian Nash Equilibrium: If the statistical distribution of opposing strategies can be determined (e.g. 50% tit for tat, 50% always cooperate) an optimal counter-strategy can be derived analytically.[11]
Monte Carlo simulations of populations have been made, where individuals with low scores die off, and those with high scores reproduce (a genetic algorithm for finding an optimal strategy). The mix of algorithms in the final population generally depends on the mix in the initial population. The introduction of mutation (random variation during reproduction) lessens the dependency on the initial population; empirical experiments with such systems tend to produce tit for tat players (see for instance Chess 1988),[clarification needed] but no analytic proof exists that this will always occur.
Although tit for tat is considered to be the most robust basic strategy, a team from Southampton University in England (led by Professor Nicholas Jennings and consisting of Rajdeep Dash, Sarvapali Ramchurn, Alex Rogers, Perukrishnen Vytelingum) introduced a new strategy at the 20th-anniversary iterated prisoner's dilemma competition, which proved to be more successful than tit for tat. This strategy relied on collusion between programs to achieve the highest number of points for a single program. The university submitted 60 programs to the competition, which were designed to recognize each other through a series of five to ten moves at the start.[12] Once this recognition was made, one program would always cooperate and the other would always defect, assuring the maximum number of points for the defector. If the program realized that it was playing a non-Southampton player, it would continuously defect in an attempt to minimize the score of the competing program. As a result,[13] this strategy ended up taking the top three positions in the competition, as well as a number of positions towards the bottom.
This strategy takes advantage of the fact that multiple entries were allowed in this particular competition and that the performance of a team was measured by that of the highest-scoring player (meaning that the use of self-sacrificing players was a form of minmaxing). In a competition where one has control of only a single player, tit for tat is certainly a better strategy. Because of this new rule, this competition also has little theoretical significance when analysing single agent strategies as compared to Axelrod's seminal tournament. However, it provided a basis for analysing how to achieve cooperative strategies in multi-agent frameworks, especially in the presence of noise. In fact, long before this new-rules tournament was played, Richard Dawkins in his book The Selfish Gene pointed out the possibility of such strategies winning if multiple entries were allowed, but he remarked that most probably Axelrod would not have allowed them if they had been submitted. It also relies on circumventing rules about the prisoner's dilemma in that there is no communication allowed between the two players, which the Southampton programs arguably did with their opening "ten move dance" to recognize one another; this only reinforces just how valuable communication can be in shifting the balance of the game.
Stochastic iterated prisoner's dilemma[edit]
In a stochastic iterated prisoner's dilemma game, strategies are specified by in terms of "cooperation probabilities".[14] In an encounter between player X and player Y, X 's strategy is specified by a set of probabilities P of cooperating with Y. P is a function of the outcomes of their previous encounters or some subset thereof. If P is a function of only their most recent n encounters, it is called a "memory-n" strategy. A memory-1 strategy is then specified by four cooperation probabilities: P = { P c c , P c d , P d c , P d d } {\displaystyle P=\{P_{cc},P_{cd},P_{dc},P_{dd}\}} , where P a b {\displaystyle P_{ab}} is the probability that X will cooperate in the present encounter given that the previous encounter was characterized by (ab). For example, if the previous encounter was one in which X cooperated and Y defected, then P c d {\displaystyle P_{cd}} is the probability that X will cooperate in the present encounter. If each of the probabilities are either 1 or 0, the strategy is called deterministic. An example of a deterministic strategy is the "tit for tat" strategy written as P={1,0,1,0}, in which X responds as Y did in the previous encounter. Another is the win–stay, lose–switch strategy written as P={1,0,0,1}, in which X responds as in the previous encounter, if it was a "win" (i.e. cc or dc) but changes strategy if it was a loss (i.e. cd or dd). It has been shown that for any memory-n strategy there is a corresponding memory-1 strategy which gives the same statistical results, so that only memory-1 strategies need be considered.[14]
If we define P as the above 4-element strategy vector of X and Q = { Q c c , Q c d , Q d c , Q d d } {\displaystyle Q=\{Q_{cc},Q_{cd},Q_{dc},Q_{dd}\}} as the 4-element strategy vector of Y, a transition matrix M may be defined for X whose ij th entry is the probability that the outcome of a particular encounter between X and Y will be j given that the previous encounter was i, where i and j are one of the four outcome indices: cc, cd, dc, or dd. For example, from X 's point of view, the probability that the outcome of the present encounter is cd given that the previous encounter was cd is equal to M c d , c d = P c d ( 1 − Q d c ) {\displaystyle M_{cd,cd}=P_{cd}(1-Q_{dc})} . (Note that the indices for Q are from Y 's point of view: a cd outcome for X is a dc outcome for Y.) Under these definitions, the iterated prisoner's dilemma qualifies as a stochastic process and M is a stochastic matrix, allowing all of the theory of stochastic processes to be applied.[14]
One result of stochastic theory is that there exists a stationary vector v for the matrix M such that v ⋅ M = v {\displaystyle v\cdot M=v} . Without loss of generality, it may be specified that v is normalized so that the sum of its four components is unity. The ij th entry in M n {\displaystyle M^{n}} will give the probability that the outcome of an encounter between X and Y will be j given that the encounter n steps previous is i. In the limit as n approaches infinity, M will converge to a matrix with fixed values, giving the long-term probabilities of an encounter producing j which will be independent of i. In other words, the rows of M ∞ {\displaystyle M^{\infty }} will be identical, giving the long-term equilibrium result probabilities of the iterated prisoners dilemma without the need to explicitly evaluate a large number of interactions. It can be seen that v is a stationary vector for M n {\displaystyle M^{n}} and particularly M ∞ {\displaystyle M^{\infty }} , so that each row of M ∞ {\displaystyle M^{\infty }} will be equal to v. Thus the stationary vector specifies the equilibrium outcome probabilities for X. Defining S x = { R , S , T , P } {\displaystyle S_{x}=\{R,S,T,P\}} and S y = { R , T , S , P } {\displaystyle S_{y}=\{R,T,S,P\}} as the short-term payoff vectors for the {cc,cd,dc,dd} outcomes (From X 's point of view), the equilibrium payoffs for X and Y can now be specified as s x = v ⋅ S x {\displaystyle s_{x}=v\cdot S_{x}} and s y = v ⋅ S y {\displaystyle s_{y}=v\cdot S_{y}} , allowing the two strategies P and Q to be compared for their long term payoffs.
Zero-determinant strategies[edit]
The relationship between zero-determinant (ZD), cooperating and defecting strategies in the Iterated Prisoner’s Dilemma (IPD) illustrated in a Venn diagram. Cooperating strategies always cooperate with other cooperating strategies, and defecting strategies always defect against other defecting strategies. Both contain subsets of strategies that are robust under strong selection, meaning no other memory-1 strategy is selected to invade such strategies when they are resident in a population. Only cooperating strategies contain a subset that are always robust, meaning that no other memory-1 strategy is selected to invade and replace such strategies, under both strong and weak selection. The intersection between ZD and good cooperating strategies is the set of generous ZD strategies. Extortion strategies are the intersection between ZD and non-robust defecting strategies. Tit-for-tat lies at the intersection of cooperating, defecting and ZD strategies.
In 2012, William H. Press and Freeman Dyson published a new class of strategies for the stochastic iterated prisoner's dilemma called "zero-determinant" (ZD) strategies.[14] The long term payoffs for encounters between X and Y can be expressed as the determinant of a matrix which is a function of the two strategies and the short term payoff vectors: s x = D ( P , Q , S x ) {\displaystyle s_{x}=D(P,Q,S_{x})} and s y = D ( P , Q , S y ) {\displaystyle s_{y}=D(P,Q,S_{y})} , which do not involve the stationary vector v. Since the determinant function s y = D ( P , Q , f ) {\displaystyle s_{y}=D(P,Q,f)} is linear in f, it follows that α s x + β s y + γ = D ( P , Q , α S x + β S y + γ U ) {\displaystyle \alpha s_{x}+\beta s_{y}+\gamma =D(P,Q,\alpha S_{x}+\beta S_{y}+\gamma U)} (where U={1,1,1,1}). Any strategies for which D ( P , Q , α S x + β S y + γ U ) = 0 {\displaystyle D(P,Q,\alpha S_{x}+\beta S_{y}+\gamma U)=0} is by definition a ZD strategy, and the long term payoffs obey the relation α s x + β s y + γ = 0 {\displaystyle \alpha s_{x}+\beta s_{y}+\gamma =0} .
Tit-for-tat is a ZD strategy which is "fair" in the sense of not gaining advantage over the other player. However, the ZD space also contains strategies that, in the case of two players, can allow one player to unilaterally set the other player's score or alternatively, force an evolutionary player to achieve a payoff some percentage lower than his own. The extorted player could defect but would thereby hurt himself by getting lower payoff. Thus, extortion solutions turn the iterated prisoner's dilemma into a sort of ultimatum game. Specifically, X is able to choose a strategy for which D ( P , Q , β S y + γ U ) = 0 {\displaystyle D(P,Q,\beta S_{y}+\gamma U)=0} , unilaterally setting s y {\displaystyle s_{y}} to a specific value within a particular range of values, independent of Y 's strategy, offering an opportunity for X to "extort" player Y (and vice versa). (It turns out that if X tries to set s x {\displaystyle s_{x}} to a particular value, the range of possibilities is much smaller, only consisting of complete cooperation or complete defection.[14])
An extension of the IPD is an evolutionary stochastic IPD, in which the relative abundance of particular strategies is allowed to change, with more successful strategies relatively increasing. This process may be accomplished by having less successful players imitate the more successful strategies, or by eliminating less successful players from the game, while multiplying the more successful ones. It has been shown that unfair ZD strategies are not evolutionarily stable. The key intuition is that an evolutionarily stable strategy must not only be able to invade another population (which extortionary ZD strategies can do) but must also perform well against other players of the same type (which extortionary ZD players do poorly, because they reduce each other's surplus).[15]
Theory and simulations confirm that beyond a critical population size, ZD extortion loses out in evolutionary competition against more cooperative strategies, and as a result, the average payoff in the population increases when the population is bigger. In addition, there are some cases in which extortioners may even catalyze cooperation by helping to break out of a face-off between uniform defectors and win–stay, lose–switch agents.[8]
While extortionary ZD strategies are not stable in large populations, another ZD class called "generous" strategies is both stable and robust. In fact, when the population is not too small, these strategies can supplant any other ZD strategy and even perform well against a broad array of generic strategies for iterated prisoner's dilemma, including win–stay, lose–switch. This was proven specifically for the donation game by Alexander Stewart and Joshua Plotkin in 2013.[16] Generous strategies will cooperate with other cooperative players, and in the face of defection, the generous player loses more utility than its rival. Generous strategies are the intersection of ZD strategies and so-called "good" strategies, which were defined by Akin (2013)[17] to be those for which the player responds to past mutual cooperation with future cooperation and splits expected payoffs equally if he receives at least the cooperative expected payoff. Among good strategies, the generous (ZD) subset performs well when the population is not too small. If the population is very small, defection strategies tend to dominate.[16]
Continuous iterated prisoner's dilemma[edit]
Most work on the iterated prisoner's dilemma has focused on the discrete case, in which players either cooperate or defect, because this model is relatively simple to analyze. However, some researchers have looked at models of the continuous iterated prisoner's dilemma, in which players are able to make a variable contribution to the other player. Le and Boyd[18] found that in such situations, cooperation is much harder to evolve than in the discrete iterated prisoner's dilemma. The basic intuition for this result is straightforward: in a continuous prisoner's dilemma, if a population starts off in a non-cooperative equilibrium, players who are only marginally more cooperative than non-cooperators get little benefit from assorting with one another. By contrast, in a discrete prisoner's dilemma, tit for tat cooperators get a big payoff boost from assorting with one another in a non-cooperative equilibrium, relative to non-cooperators. Since nature arguably offers more opportunities for variable cooperation rather than a strict dichotomy of cooperation or defection, the continuous prisoner's dilemma may help explain why real-life examples of tit for tat-like cooperation are extremely rare in nature (ex. Hammerstein[19]) even though tit for tat seems robust in theoretical models.
Emergence of stable strategies[edit]
Players cannot seem to coordinate mutual cooperation, thus often get locked into the inferior yet stable strategy of defection. In this way, iterated rounds facilitate the evolution of stable strategies.[20] Iterated rounds often produce novel strategies, which have implications to complex social interaction. One such strategy is win-stay lose-shift. This strategy outperforms a simple Tit-For-Tat strategy – that is, if you can get away with cheating, repeat that behavior, however if you get caught, switch.[21]
The only problem of this tit-for-tat strategy is that they are vulnerable to signal error. The problem arises when one individual shows cooperative behavior but the other interprets it as cheating. As a result of this, the second individual now cheats and then it starts a see-saw pattern of cheating in a chain reaction.
Real-life examples[edit]
The prisoner setting may seem contrived, but there are in fact many examples in human interaction as well as interactions in nature that have the same payoff matrix. The prisoner's dilemma is therefore of interest to the social sciences such as economics, politics, and sociology, as well as to the biological sciences such as ethology and evolutionary biology. Many natural processes have been abstracted into models in which living beings are engaged in endless games of prisoner's dilemma. This wide applicability of the PD gives the game its substantial importance.
In environmental studies[edit]
In environmental studies, the PD is evident in crises such as global climate-change. It is argued all countries will benefit from a stable climate, but any single country is often hesitant to curb CO2 emissions. The immediate benefit to any one country from maintaining current behavior is wrongly perceived to be greater than the purported eventual benefit to that country if all countries' behavior was changed, therefore explaining the impasse concerning climate-change in 2007.[22]
An important difference between climate-change politics and the prisoner's dilemma is uncertainty; the extent and pace at which pollution can change climate is not known. The dilemma faced by government is therefore different from the prisoner's dilemma in that the payoffs of cooperation are unknown. This difference suggests that states will cooperate much less than in a real iterated prisoner's dilemma, so that the probability of avoiding a possible climate catastrophe is much smaller than that suggested by a game-theoretical analysis of the situation using a real iterated prisoner's dilemma.[23]
Osang and Nandy provide a theoretical explanation with proofs for a regulation-driven win-win situation along the lines of Michael Porter's hypothesis, in which government regulation of competing firms is substantial.[24]
In animals[edit]
Cooperative behavior of many animals can be understood as an example of the prisoner's dilemma. Often animals engage in long term partnerships, which can be more specifically modeled as iterated prisoner's dilemma. For example, guppies inspect predators cooperatively in groups, and they are thought to punish non-cooperative inspectors.
Vampire bats are social animals that engage in reciprocal food exchange. Applying the payoffs from the prisoner's dilemma can help explain this behavior:[25]
C/C: "Reward: I get blood on my unlucky nights, which saves me from starving. I have to give blood on my lucky nights, which doesn't cost me too much."
D/C: "Temptation: You save my life on my poor night. But then I get the added benefit of not having to pay the slight cost of feeding you on my good night."
C/D: "Sucker's Payoff: I pay the cost of saving your life on my good night. But on my bad night you don't feed me and I run a real risk of starving to death."
D/D: "Punishment: I don't have to pay the slight costs of feeding you on my good nights. But I run a real risk of starving on my poor nights."
In psychology[edit]
In addiction research / behavioral economics, George Ainslie points out[26] that addiction can be cast as an intertemporal PD problem between the present and future selves of the addict. In this case, defecting means relapsing, and it is easy to see that not defecting both today and in the future is by far the best outcome. The case where one abstains today but relapses in the future is the worst outcome – in some sense the discipline and self-sacrifice involved in abstaining today have been "wasted" because the future relapse means that the addict is right back where he started and will have to start over (which is quite demoralizing, and makes starting over more difficult). Relapsing today and tomorrow is a slightly "better" outcome, because while the addict is still addicted, they haven't put the effort in to trying to stop. The final case, where one engages in the addictive behavior today while abstaining "tomorrow" will be familiar to anyone who has struggled with an addiction. The problem here is that (as in other PDs) there is an obvious benefit to defecting "today", but tomorrow one will face the same PD, and the same obvious benefit will be present then, ultimately leading to an endless string of defections.
John Gottman in his research described in "the science of trust" defines good relationships as those where partners know not to enter the (D,D) cell or at least not to get dynamically stuck there in a loop.
In economics[edit]
Advertising is sometimes cited as a real-example of the prisoner’s dilemma. When cigarette advertising was legal in the United States, competing cigarette manufacturers had to decide how much money to spend on advertising. The effectiveness of Firm A’s advertising was partially determined by the advertising conducted by Firm B. Likewise, the profit derived from advertising for Firm B is affected by the advertising conducted by Firm A. If both Firm A and Firm B chose to advertise during a given period, then the advertising cancels out, receipts remain constant, and expenses increase due to the cost of advertising. Both firms would benefit from a reduction in advertising. However, should Firm B choose not to advertise, Firm A could benefit greatly by advertising. Nevertheless, the optimal amount of advertising by one firm depends on how much advertising the other undertakes. As the best strategy is dependent on what the other firm chooses there is no dominant strategy, which makes it slightly different from a prisoner's dilemma. The outcome is similar, though, in that both firms would be better off were they to advertise less than in the equilibrium. Sometimes cooperative behaviors do emerge in business situations. For instance, cigarette manufacturers endorsed the making of laws banning cigarette advertising, understanding that this would reduce costs and increase profits across the industry.[citation needed][27] This analysis is likely to be pertinent in many other business situations involving advertising.[citation needed]
Without enforceable agreements, members of a cartel are also involved in a (multi-player) prisoner's dilemma.[28] 'Cooperating' typically means keeping prices at a pre-agreed minimum level. 'Defecting' means selling under this minimum level, instantly taking business (and profits) from other cartel members. Anti-trust authorities want potential cartel members to mutually defect, ensuring the lowest possible prices for consumers.
In sport[edit]
Doping in sport has been cited as an example of a prisoner's dilemma.[29]
Two competing athletes have the option to use an illegal and/or dangerous drug to boost their performance. If neither athlete takes the drug, then neither gains an advantage. If only one does, then that athlete gains a significant advantage over their competitor, reduced by the legal and/or medical dangers of having taken the drug. If both athletes take the drug, however, the benefits cancel out and only the dangers remain, putting them both in a worse position than if neither had used doping.[29]
In international politics[edit]
In international political theory, the Prisoner's Dilemma is often used to demonstrate the coherence of strategic realism, which holds that in international relations, all states (regardless of their internal policies or professed ideology), will act in their rational self-interest given international anarchy. A classic example is an arms race like the Cold War and similar conflicts.[30] During the Cold War the opposing alliances of NATO and the Warsaw Pact both had the choice to arm or disarm. From each side's point of view, disarming whilst their opponent continued to arm would have led to military inferiority and possible annihilation. Conversely, arming whilst their opponent disarmed would have led to superiority. If both sides chose to arm, neither could afford to attack the other, but both incurred the high cost of developing and maintaining a nuclear arsenal. If both sides chose to disarm, war would be avoided and there would be no costs.
Although the 'best' overall outcome is for both sides to disarm, the rational course for both sides is to arm, and this is indeed what happened. Both sides poured enormous resources into military research and armament in a war of attrition for the next thirty years until the Soviet Union could not withstand the economic cost.[citation needed] The same logic could be applied in any similar scenario, be it economic or technological competition between sovereign states.
Multiplayer dilemmas[edit]
Many real-life dilemmas involve multiple players.[31] Although metaphorical, Hardin's tragedy of the commons may be viewed as an example of a multi-player generalization of the PD: Each villager makes a choice for personal gain or restraint. The collective reward for unanimous (or even frequent) defection is very low payoffs (representing the destruction of the "commons"). A commons dilemma most people can relate to is washing the dishes in a shared house. By not washing dishes an individual can gain by saving his time, but if that behavior is adopted by every resident the collective cost is no clean plates for anyone.
The commons are not always exploited: William Poundstone, in a book about the prisoner's dilemma (see References below), describes a situation in New Zealand where newspaper boxes are left unlocked. It is possible for people to take a paper without paying (defecting) but very few do, feeling that if they do not pay then neither will others, destroying the system. Subsequent research by Elinor Ostrom, winner of the 2009 Sveriges Riksbank Prize in Economic Sciences in Memory of Alfred Nobel, hypothesized that the tragedy of the commons is oversimplified, with the negative outcome influenced by outside influences. Without complicating pressures, groups communicate and manage the commons among themselves for their mutual benefit, enforcing social norms to preserve the resource and achieve the maximum good for the group, an example of effecting the best case outcome for PD.[32]
Related games[edit]
Closed-bag exchange[edit]
The prisoner's dilemma as a briefcase exchange
Douglas Hofstadter[33] once suggested that people often find problems such as the PD problem easier to understand when it is illustrated in the form of a simple game, or trade-off. One of several examples he used was "closed bag exchange":
Two people meet and exchange closed bags, with the understanding that one of them contains money, and the other contains a purchase. Either player can choose to honor the deal by putting into his or her bag what he or she agreed, or he or she can defect by handing over an empty bag.
In this game, defection always gives a game-theoretically preferable outcome.
Friend or Foe?[edit]
Friend or Foe? is a game show that aired from 2002 to 2005 on the Game Show Network in the US. It is an example of the prisoner's dilemma game tested on real people, but in an artificial setting. On the game show, three pairs of people compete. When a pair is eliminated, they play a game similar to the prisoner's dilemma to determine how the winnings are split. If they both cooperate (Friend), they share the winnings 50–50. If one cooperates and the other defects (Foe), the defector gets all the winnings and the cooperator gets nothing. If both defect, both leave with nothing. Notice that the reward matrix is slightly different from the standard one given above, as the rewards for the "both defect" and the "cooperate while the opponent defects" cases are identical. This makes the "both defect" case a weak equilibrium, compared with being a strict equilibrium in the standard prisoner's dilemma. If a contestant knows that their opponent is going to vote "Foe", then their own choice does not affect their own winnings. In a specific sense, Friend or Foe has a rewards model between prisoner's dilemma and the game of Chicken.
The rewards matrix is
Pair 2
Pair 1
"Friend"
(cooperate)
"Foe"
(defect)
"Friend"
(cooperate)
1
1
2
0
"Foe"
(defect)
0
2
0
0
This payoff matrix has also been used on the British television programmes Trust Me, Shafted, The Bank Job and Golden Balls, and on the American shows Bachelor Pad and Take It All. Game data from the Golden Balls series has been analyzed by a team of economists, who found that cooperation was "surprisingly high" for amounts of money that would seem consequential in the real world, but were comparatively low in the context of the game.[34]
Iterated snowdrift[edit]
Researchers from the University of Lausanne and the University of Edinburgh have suggested that the "Iterated Snowdrift Game" may more closely reflect real-world social situations. Although this model is actually a chicken game, it will be described here. In this model, the risk of being exploited through defection is lower, and individuals always gain from taking the cooperative choice. The snowdrift game imagines two drivers who are stuck on opposite sides of a snowdrift, each of whom is given the option of shoveling snow to clear a path, or remaining in their car. A player's highest payoff comes from leaving the opponent to clear all the snow by themselves, but the opponent is still nominally rewarded for their work.
This may better reflect real world scenarios, the researchers giving the example of two scientists collaborating on a report, both of whom would benefit if the other worked harder. "But when your collaborator doesn’t do any work, it’s probably better for you to do all the work yourself. You’ll still end up with a completed project."[35]
Example snowdrift payouts (A, B)
B
A
Cooperates
Defects
Cooperates
200, 200 100, 300
Defects
300, 100 0, 0
Example PD payouts (A, B)
B
A
Cooperates
Defects
Cooperates
200, 200 -100, 300
Defects
300, -100 0, 0
Software[edit]
Several software packages have been created to run prisoner's dilemma simulations and tournaments, some of which have available source code.
The source code for the second tournament run by Robert Axelrod (written by Axelrod and many contributors in Fortran) is available online
Prison, a library written in Java, last updated in 1998
Axelrod-Python, written in Python (programming language)
play the Iterative Prisonerr's Dilemma in the browser, play against strategies or let strategies play against other strategies
In fiction[edit]
Hannu Rajaniemi set the opening scene of his The Quantum Thief trilogy in a "dilemma prison". The main theme of the series has been described as the "inadequacy of a binary universe" and the ultimate antagonist is a character called the All-Defector. Rajaniemi is particularly interesting as an artist treating this subject in that he is a Cambridge-trained mathematician and holds a PhD in mathematical physics – the interchangeability of matter and information is a major feature of the books, which take place in a "post-singularity" future. The first book in the series was published in 2010, with the two sequels, The Fractal Prince and The Causal Angel, published in 2012 and 2014, respectively.
A game modeled after the (iterated) prisoner's dilemma is a central focus of the 2012 video game Zero Escape: Virtue's Last Reward and a minor part in its 2016 sequel Zero Escape: Zero Time Dilemma.
In The Mysterious Benedict Society and the Prisoner's Dilemma by Trenton Lee Stewart, the main characters start by playing a version of the game and escaping from the "prison" altogether. Later they become actual prisoners and escape once again.
See also[edit]
Abilene paradox
Centipede game
Christmas truce
Folk theorem (game theory)
Hobbesian trap
Innocent prisoner's dilemma
Liar Game
Optional prisoner's dilemma
Prisoner's dilemma and cooperation an experimental study
Public goods game
Reciprocal altruism
Swift trust theory
Unscrupulous diner's dilemma
References[edit]
Jump up ^ Poundstone, 1992
Jump up ^ Milovsky, Nicholas. "The Basics of Game Theory and Associated Games". Retrieved 11 February 2014.
Jump up ^ Fehr, Ernst; Fischbacher, Urs (Oct 23, 2003). "The Nature of human altruism" (PDF). Nature. Nature Publishing Group. 425 (6960): 785–91. Bibcode:2003Natur.425..785F. doi:10.1038/nature02043. PMID 14574401. Retrieved February 27, 2013.
Jump up ^ Tversky, Amos; Shafir, Eldar (2004). Preference, belief, and similarity: selected writings (PDF). Massachusetts Institute of Technology Press. ISBN 9780262700931. Retrieved February 27, 2013.
Jump up ^ Toh-Kyeong, Ahn; Ostrom, Elinor; Walker, James (Sep 5, 2002). "Incorporating Motivational Heterogeneity into Game-Theoretic Models of Collective Action" (PDF). Public Choice. 117 (3–4): 295–314. doi:10.1023/b:puch.0000003739.54365.fd. Retrieved June 27, 2015.
Jump up ^ Oosterbeek, Hessel; Sloof, Randolph; Van de Kuilen, Gus (Dec 3, 2003). "Cultural Differences in Ultimatum Game Experiments: Evidence from a Meta-Analysis" (PDF). Experimental Economics. Springer Science and Business Media B.V. 7 (2): 171–88. doi:10.1023/B:EXEC.0000026978.14316.74. Archived from the original (PDF) on May 12, 2013. Retrieved February 27, 2013.
Jump up ^ Kaznatcheev, Artem (March 2, 2015). "Short history of iterated prisoner's dilemma tournaments". Theory, Evolution, and Games Group. Retrieved February 8, 2016.
^ Jump up to: a b Hilbe, Christian; Martin A. Nowak; Karl Sigmund (April 2013). "Evolution of extortion in Iterated Prisoner's Dilemma games". PNAS. 110 (17): 6913–18. arXiv:1212.1067  . Bibcode:2013PNAS..110.6913H. doi:10.1073/pnas.1214834110. Retrieved 25 November 2013.
Jump up ^ Shy, Oz (1995). Industrial Organization: Theory and Applications. Massachusetts Institute of Technology Press. ISBN 0262193663. Retrieved February 27, 2013.
Jump up ^ http://www.pnas.org/content/pnas/93/7/2686.full.pdf
Jump up ^ For example see the 2003 study "Bayesian Nash equilibrium; a statistical test of the hypothesis" Archived 2005-10-02 at the Wayback Machine. for discussion of the concept and whether it can apply in real economic or strategic situations (from Tel Aviv University).
Jump up ^ : University of Southampton Archived 2014-04-21 at the Wayback Machine.
Jump up ^ The 2004 Prisoners' Dilemma Tournament Results show University of Southampton's strategies in the first three places, despite having fewer wins and many more losses than the GRIM strategy. (Note that in a PD tournament, the aim of the game is not to "win" matches – that can easily be achieved by frequent defection). It should also be pointed out that even without implicit collusion between software strategies (exploited by the Southampton team) tit for tat is not always the absolute winner of any given tournament; it would be more precise to say that its long run results over a series of tournaments outperform its rivals. (In any one event a given strategy can be slightly better adjusted to the competition than tit for tat, but tit for tat is more robust). The same applies for the tit for tat with forgiveness variant, and other optimal strategies: on any given day they might not 'win' against a specific mix of counter-strategies. An alternative way of putting it is using the Darwinian ESS simulation. In such a simulation, tit for tat will almost always come to dominate, though nasty strategies will drift in and out of the population because a tit for tat population is penetrable by non-retaliating nice strategies, which in turn are easy prey for the nasty strategies. Richard Dawkins showed that here, no static mix of strategies form a stable equilibrium and the system will always oscillate between bounds.
^ Jump up to: a b c d e Press, WH; Dyson, FJ (26 June 2012). "Iterated Prisoner's Dilemma contains strategies that dominate any evolutionary opponent". Proceedings of the National Academy of Sciences of the United States of America. 109 (26): 10409–13. Bibcode:2012PNAS..10910409P. doi:10.1073/pnas.1206569109. PMC 3387070  . PMID 22615375.
Jump up ^ Adami, Christoph; Arend Hintze (2013). "Evolutionary instability of Zero Determinant strategies demonstrates that winning isn't everything": 3. arXiv:1208.2666  . Bibcode:2013NatCo...4E2193A. doi:10.1038/ncomms3193.
^ Jump up to: a b Stewart, Alexander J.; Joshua B. Plotkin (2013). "From extortion to generosity, evolution in the Iterated Prisoner's Dilemma". Proceedings of the National Academy of Sciences of the United States of America. 110 (38): 15348–53. Bibcode:2013PNAS..11015348S. doi:10.1073/pnas.1306246110. PMC 3780848  .
Jump up ^ Akin, Ethan (2013). "Stable Cooperative Solutions for the Iterated Prisoner's Dilemma": 9. arXiv:1211.0969  . Bibcode:2012arXiv1211.0969A.
Jump up ^ Le S, Boyd R (2007). "Evolutionary Dynamics of the Continuous Iterated Prisoner's Dilemma". Journal of Theoretical Biology. 245 (2): 258–67. doi:10.1016/j.jtbi.2006.09.016. PMID 17125798.
Jump up ^ Hammerstein, P. (2003). Why is reciprocity so rare in social animals? A protestant appeal. In: P. Hammerstein, Editor, Genetic and Cultural Evolution of Cooperation, MIT Press. pp. 83–94.
Jump up ^ Spaniel, William (2011). Game Theory 101: The Complete Textbook.
Jump up ^ Nowak, Martin; Karl Sigmund (1993). "A strategy of win-stay, lose-shift that outperforms tit-for-tat in the Prisoner's Dilemma game". Nature. 364 (6432): 56–58. Bibcode:1993Natur.364...56N. doi:10.1038/364056a0. PMID 8316296.
Jump up ^ "Markets & Data". The Economist. 2007-09-27.
Jump up ^ Rehmeyer, Julie (2012-10-29). "Game theory suggests current climate negotiations won't avert catastrophe". Science News. Society for Science & the Public.
Jump up ^ Osang and Nandy 2003
Jump up ^ Dawkins, Richard (1976). The Selfish Gene. Oxford University Press.
Jump up ^ Ainslie, George (2001). Breakdown of Will. ISBN 0-521-59694-7.
Jump up ^ This argument for the development of cooperation through trust is given in The Wisdom of Crowds , where it is argued that long-distance capitalism was able to form around a nucleus of Quakers, who always dealt honourably with their business partners. (Rather than defecting and reneging on promises – a phenomenon that had discouraged earlier long-term unenforceable overseas contracts). It is argued that dealings with reliable merchants allowed the meme for cooperation to spread to other traders, who spread it further until a high degree of cooperation became a profitable strategy in general commerce
Jump up ^ Nicholson, Walter (2000). "Intermediate Microeconomics" (8th ed.). Harcourt.
^ Jump up to: a b Schneier, Bruce (2012-10-26). "Lance Armstrong and the Prisoners' Dilemma of Doping in Professional Sports | Wired Opinion". Wired.com. Retrieved 2012-10-29.
Jump up ^ Stephen J. Majeski (1984). "Arms races as iterated prisoner's dilemma games". Mathematical and Social Sciences. 7 (3): 253–66. doi:10.1016/0165-4896(84)90022-2.
Jump up ^ Gokhale CS, Traulsen A. Evolutionary games in the multiverse. Proceedings of the National Academy of Sciences. 2010 Mar 23. 107(12):5500–04.
Jump up ^ "The Volokh Conspiracy " Elinor Ostrom and the Tragedy of the Commons". Volokh.com. 2009-10-12. Retrieved 2011-12-17.
Jump up ^ Hofstadter, Douglas R. (1985). "Ch.29 The Prisoner's Dilemma Computer Tournaments and the Evolution of Cooperation.". Metamagical Themas: questing for the essence of mind and pattern. Bantam Dell Pub Group. ISBN 0-465-04566-9.
Jump up ^ Van den Assem, Martijn J. (January 2012). "Split or Steal? Cooperative Behavior When the Stakes Are Large" (PDF). Management Science. 58 (1): 2–20. doi:10.1287/mnsc.1110.1413. SSRN 1592456  .
Jump up ^ Kümmerli, Rolf. "'Snowdrift' game tops 'Prisoner's Dilemma' in explaining cooperation". Retrieved 11 April 2012.
Further reading[edit]
Amadae, S. (2016). 'Prisoner's Dilemma,' Prisoners of Reason. Cambridge University Press, NY, pp. 24–61.
Aumann, Robert (1959). "Acceptable points in general cooperative n-person games". In Luce, R. D.; Tucker, A. W. Contributions to the Theory 23 of Games IV. Annals of Mathematics Study. 40. Princeton NJ: Princeton University Press. pp. 287–324. MR 0104521.
Axelrod, R. (1984). The Evolution of Cooperation. ISBN 0-465-02121-2
Bicchieri, Cristina (1993). Rationality and Coordination. Cambridge University Press.
Chess, David M. (December 1988). "Simulating the evolution of behavior: the iterated prisoners' dilemma problem" (PDF). Complex Systems. 2 (6): 663–70.
Dresher, M. (1961). The Mathematics of Games of Strategy: Theory and Applications Prentice-Hall, Englewood Cliffs, NJ.
Greif, A. (2006). Institutions and the Path to the Modern Economy: Lessons from Medieval Trade. Cambridge University Press, Cambridge, UK.
Rapoport, Anatol and Albert M. Chammah (1965). Prisoner's Dilemma. University of Michigan Press.
External links[edit]
Listen to this article (info/dl)

This audio file was created from a revision of the article "Prisoner's dilemma" dated 2007-06-25, and does not reflect subsequent edits to the article. (Audio help)
More spoken articles
Media related to Prisoner's dilemma at Wikimedia Commons
Prisoner's Dilemma (Stanford Encyclopedia of Philosophy)
The Bowerbird's Dilemma The Prisoner's Dilemma in ornithology – mathematical cartoon by Larry Gonick.
The Prisoner's Dilemma The Prisoner's Dilemma with Lego minifigures.
Dixit, Avinash; Nalebuff, Barry (2008). "Prisoner's Dilemma". In David R. Henderson (ed.). Concise Encyclopedia of Economics (2nd ed.). Indianapolis: Library of Economics and Liberty. ISBN 978-0865976658. OCLC 237794267. CS1 maint: Extra text: editors list (link)
Game Theory 101: Prisoner's Dilemma
Dawkins: Nice Guys Finish First
Axelrod Iterated Prisoner's Dilemma Python library
Play the Iterated Prisoner's Dilemma on gametheorygames.nl
Play Prisoner's Dilemma on oTree (N/A 11-5-17)
show
v
t
e
Paradoxes
Philosophical
Analysis
Buridan's bridge
Dream argument
Epicurean
Fiction
Fitch's knowability
Free will
Goodman's
Hedonism
Liberal
Meno's
Mere addition
Moore's
Newcomb's
Nihilism
Omnipotence
Preface
Rule-following
White horse
Zeno's
Logical
Self-reference
Barber
Berry
Bhartrhari's
Court
Crocodile
Curry's
Epimenides
Grelling–Nelson
Kleene–Rosser
Liar
Card
Pinocchio
Quine's
Yablo's
Richard's
Russell's
Socratic
Hilbert's Hotel
Vagueness
Theseus' ship
Sorites
Others
Barbershop
Catch-22
Drinker
Entailment
Lottery
Plato's beard
Raven
Ross'
Unexpected hanging
Economic
Allais
Antitrust
Arrow information
Bertrand
Braess's
Competition
Income and fertility
Downs–Thomson
Easterlin
Edgeworth
Ellsberg
European
Gibson's
Giffen good
Icarus
Jevons
Leontief
Lucas
Mandeville's
Mayfield's
Metzler
Plenty
Productivity
Prosperity
Scitovsky
Service recovery
St. Petersburg
Thrift
Toil
Tullock
Value
Decision theory
Abilene
Apportionment
Arrow's
Buridan's ass
Chainstore
Condorcet's
Decision-making
Downs
Ellsberg
Fenno's
Fredkin's
Green
Hedgehog's
Inventor's
Kavka's toxin puzzle
Morton's fork
Navigation
Newcomb's
Parrondo's
Prevention
Prisoner's dilemma
Tolerance
Willpower
List of paradoxes
show
v
t
e
Topics in game theory
Definitions
Cooperative game
Determinacy
Escalation of commitment
Extensive-form game
First-player and second-player win
Game complexity
Graphical game
Hierarchy of beliefs
Information set
Normal-form game
Preference
Sequential game
Simultaneous game
Simultaneous action selection
Solved game
Succinct game
Equilibrium
concepts
Nash equilibrium
Subgame perfection
Mertens-stable equilibrium
Bayesian Nash equilibrium
Perfect Bayesian equilibrium
Trembling hand
Proper equilibrium
Epsilon-equilibrium
Correlated equilibrium
Sequential equilibrium
Quasi-perfect equilibrium
Evolutionarily stable strategy
Risk dominance
Core
Shapley value
Pareto efficiency
Gibbs equilibrium
Quantal response equilibrium
Self-confirming equilibrium
Strong Nash equilibrium
Markov perfect equilibrium
Strategies
Dominant strategies
Pure strategy
Mixed strategy
Strategy-stealing argument
Tit for tat
Grim trigger
Collusion
Backward induction
Forward induction
Markov strategy
Classes
of games
Symmetric game
Perfect information
Repeated game
Signaling game
Screening game
Cheap talk
Zero-sum game
Mechanism design
Bargaining problem
Stochastic game
n-player game
Large Poisson game
Nontransitive game
Global game
Strictly determined game
Potential game
Games
Chess
Infinite chess
Checkers
Tic-tac-toe
Prisoner's dilemma
Optional prisoner's dilemma
Traveler's dilemma
Coordination game
Chicken
Centipede game
Volunteer's dilemma
Dollar auction
Battle of the sexes
Stag hunt
Matching pennies
Ultimatum game
Rock–paper–scissors
Pirate game
Dictator game
Public goods game
Blotto game
War of attrition
El Farol Bar problem
Fair division
Fair cake-cutting
Cournot game
Deadlock
Diner's dilemma
Guess 2/3 of the average
Kuhn poker
Nash bargaining game
Prisoners and hats puzzle
Trust game
Princess and Monster game
Rendezvous problem
Theorems
Minimax theorem
Nash's theorem
Purification theorem
Zermelo's theorem
Folk theorem
Revelation principle
Arrow's impossibility theorem
Key
figures
Albert W. Tucker
Amos Tversky
Ariel Rubinstein
Claude Shannon
Daniel Kahneman
David K. Levine
David M. Kreps
Donald B. Gillies
Drew Fudenberg
Eric Maskin
Harold W. Kuhn
Herbert Simon
Hervé Moulin
Jean Tirole
Jean-François Mertens
Jennifer Tour Chayes
John Harsanyi
John Maynard Smith
Antoine Augustin Cournot
John Nash
John von Neumann
Kenneth Arrow
Kenneth Binmore
Leonid Hurwicz
Lloyd Shapley
Melvin Dresher
Merrill M. Flood
Olga Bondareva
Oskar Morgenstern
Paul Milgrom
Peyton Young
Reinhard Selten
Robert Axelrod
Robert Aumann
Robert B. Wilson
Roger Myerson
Samuel Bowles
Suzanne Scotchmer
Thomas Schelling
William Vickrey
See also
All-pay auction
Alpha–beta pruning
Bertrand paradox
Bounded rationality
Combinatorial game theory
Confrontation analysis
Coopetition
First-move advantage in chess
Game mechanics
Glossary of game theory
List of game theorists
List of games in game theory
No-win situation
Solving chess
Topological game
Tragedy of the commons
Tyranny of small decisions
Authority control
BNE: XX550497
BNF: cb12526229f (data)
GND: 4139587-6
LCCN: sh85106969
SUDOC: 034513272
Retrieved from "https://en.wikipedia.org/w/index.php?title=Prisoner%27s_dilemma&oldid=851828090"
Categories:
Non-cooperative games
Thought experiments
Dilemmas
Environmental studies
Hidden categories:
Webarchive template wayback links
Articles needing additional references from November 2012
All articles needing additional references
Articles needing more detailed references
Wikipedia articles needing clarification from August 2016
All articles with unsourced statements
Articles with unsourced statements from December 2012
Articles with unsourced statements from November 2012
Articles with unsourced statements from October 2016
Spoken articles
Articles with hAudio microformats
CS1 maint: Extra text: editors list
Wikipedia articles with BNE identifiers
Wikipedia articles with BNF identifiers
Wikipedia articles with GND identifiers
Wikipedia articles with LCCN identifiers
Wikipedia articles with SUDOC identifiers
Navigation menu
Personal tools
Not logged in
Talk
Contributions
Create account
Log in
Namespaces
Article
Talk
Variants
Views
Read
Edit
View history
More
Search
Navigation
Main page
Contents
Featured content
Current events
Random article
Donate to Wikipedia
Wikipedia store
Interaction
Help
About Wikipedia
Community portal
Recent changes
Contact page
Tools
What links here
Related changes
Upload file
Special pages
Permanent link
Page information
Wikidata item
Cite this page
Print/export
Create a book
Download as PDF
Printable version
In other projects
Wikimedia Commons
Wikiquote
Languages
العربية
Български
Català
Čeština
Dansk
Deutsch
Eesti
Ελληνικά
Español
Esperanto
Euskara
فارسی
Français
한국어
हिन्दी
Hrvatski
Ido
Bahasa Indonesia
Íslenska
Italiano
עברית
ქართული
Latina
Latviešu
Lietuvių
Magyar
Nederlands
日本語
Norsk
ਪੰਜਾਬੀ
Polski
Português
Română
Русский
Simple English
Slovenčina
Slovenščina
Српски / srpski
Srpskohrvatski / српскохрватски
Suomi
Svenska
Tagalog
தமிழ்
ไทย
Türkçe
Українська
Tiếng Việt
粵語
中文
40 more
Edit links
This page was last edited on 24 July 2018, at 21:28 (UTC).
Text is available under the Creative Commons Attribution-ShareAlike License; additional terms may apply. By using this site, you agree to the Terms of Use and Privacy Policy. Wikipedia® is a registered trademark of the Wikimedia Foundation, Inc., a non-profit organization.
Privacy policy
About Wikipedia
Disclaimers
Contact Wikipedia
Developers
Cookie statement
Mobile view
Enable previews

values: mw-page-base noprint

values: mw-head-base noprint

attrs: alt src width height srcset data-file-width data-file-height

attrs: class id

values: firstHeading firstHeading en

values: siteSub noprint

attrs: class href

values: mw-jump-link #mw-head

values: mw-jump-link #p-search

attrs: href class title

attrs: role class

values:
note
hatnote navigation-not-searchable

value: caption

values: background:linear-gradient(to top right,#eaecf0 49.5%,#aaa 49.5%,#aaa 50.5%,#eaecf0 50.5%);line-height:1;

values: background:linear-gradient(to top right,transparent 49.5%,#aaa 49.5%,#aaa 50.5%,transparent 50.5%);line-height:1;

values:
/wiki/Merrill_Flood
mw-redirect
Merrill Flood

values: checkbox button toctogglecheckbox toctogglecheckbox display:none

values: Edit section: Strategy for the prisoner's dilemma

values:
/wiki/Dominant_strategy
mw-redirect
Dominant strategy

values: Edit section: Special case: Donation game

values: vertical-align: -0.505ex; width:12.001ex; height:2.343ex;

values: vertical-align: -0.838ex; width:15.76ex; height:2.843ex;

values: Edit section: The iterated prisoner's dilemma

values: Help:Introduction to referencing with Wiki Markup/1

values: plainlinks metadata ambox ambox-content ambox-Refimprove

values: Edit section: Strategy for the iterated prisoner's dilemma

values:
/wiki/Win-stay,_lose-switch
mw-redirect
Win-stay, lose-switch

values: Statement needs to be more specific about the content to which it refers. (November 2012)

values:
/wiki/Bayesian_Nash_equilibrium
mw-redirect
Bayesian Nash equilibrium

values: The text near this tag may need clarification or removal of jargon. (August 2016)

values:
noprint Inline-Template
margin-left:0.1em; white-space:nowrap;

values:
/wiki/Southampton_University
mw-redirect
Southampton University

values: Edit section: Stochastic iterated prisoner's dilemma

values: vertical-align: -0.838ex; width:23.456ex; height:2.843ex;

values: vertical-align: -0.671ex; width:3.3ex; height:2.509ex;

values: vertical-align: -0.671ex; width:3.296ex; height:2.509ex;

values: vertical-align: -0.838ex; width:24.933ex; height:2.843ex;

values: vertical-align: -1.005ex; width:21.936ex; height:3.009ex;

values: vertical-align: -0.338ex; width:9.475ex; height:2.176ex;

values: vertical-align: -0.338ex; width:3.717ex; height:2.343ex;

values: vertical-align: -0.338ex; width:4.374ex; height:2.343ex;

values: vertical-align: -0.838ex; width:17.768ex; height:2.843ex;

values: vertical-align: -1.005ex; width:17.644ex; height:3.009ex;

values: vertical-align: -0.671ex; width:10.766ex; height:2.509ex;

values: vertical-align: -1.005ex; width:10.519ex; height:2.843ex;

values: Edit section: Zero-determinant strategies

values: vertical-align: -0.838ex; width:17.344ex; height:2.843ex;

values: vertical-align: -1.005ex; width:17.098ex; height:3.009ex;

values: vertical-align: -1.005ex; width:15.902ex; height:3.009ex;

values: vertical-align: -1.005ex; width:43.266ex; height:3.009ex;

values: vertical-align: -1.005ex; width:30.263ex; height:3.009ex;

values: D(P,Q,\alpha S_{x}+\beta S_{y}+\gamma U)=0

values: {\displaystyle \alpha s_{x}+\beta s_{y}+\gamma =0}

values: vertical-align: -1.005ex; width:18.426ex; height:2.843ex;

values: {\displaystyle D(P,Q,\beta S_{y}+\gamma U)=0}

values: vertical-align: -1.005ex; width:23.338ex; height:3.009ex;

values: vertical-align: -1.005ex; width:2.14ex; height:2.343ex;

values: vertical-align: -0.671ex; width:2.263ex; height:2.009ex;

values: Edit section: Continuous iterated prisoner's dilemma

values: Edit section: Emergence of stable strategies

values:
/wiki/Vampire_bats
mw-redirect
Vampire bats

values:
/wiki/Cigarette_advertising
mw-redirect
Cigarette advertising

values: This reference doesn't mention or support the claimed historical account. (December 2012)

values:
noprint Inline-Template Template-Fact
white-space:nowrap;

values: This doesn't sound like cooperation (November 2012)

values:
/wiki/International_politics
mw-redirect
International politics

values: This claim needs references to reliable sources. (October 2016)

values:
/wiki/The_Bank_Job_(TV_series)
mw-redirect
The Bank Job (TV series)

values:
/wiki/Chicken_game
mw-redirect
Chicken game

values:
nofollow
external text
http://www.lifl.fr/IPD/ipd.frame.html

values:
nofollow
http://selborne.nl/ipd/
external text

values:
/wiki/Zero_Escape:_Zero_Time_Dilemma
mw-redirect
Zero Escape: Zero Time Dilemma

values:
nofollow
external text
//doi.org/10.1038/nature02043

values:
/wiki/PubMed_Identifier
mw-redirect
PubMed Identifier

values:
nofollow
external text
//www.ncbi.nlm.nih.gov/pubmed/14574401

values:
nofollow
external text
//arxiv.org/abs/1212.1067

attrs: alt src title width height srcset data-file-width data-file-height

values:
nofollow
external text
//doi.org/10.1073/pnas.1214834110

values:
nofollow
external text
//doi.org/10.1073/pnas.1206569109

values:
nofollow
external text
//www.ncbi.nlm.nih.gov/pubmed/22615375

values:
nofollow
external text
//arxiv.org/abs/1208.2666

values:
nofollow
external text
//doi.org/10.1038/ncomms3193

values:
nofollow
external text
//doi.org/10.1073/pnas.1306246110

values:
nofollow
external text
//arxiv.org/abs/1211.0969

values:
nofollow
external text
//doi.org/10.1016/j.jtbi.2006.09.016

values:
nofollow
external text
//www.ncbi.nlm.nih.gov/pubmed/17125798

values:
nofollow
external text
//doi.org/10.1038/364056a0

values:
nofollow
external text
//www.ncbi.nlm.nih.gov/pubmed/8316296

values:
/wiki/Religious_Society_of_Friends
mw-redirect
Religious Society of Friends

values:
nofollow
external text
//doi.org/10.1287/mnsc.1110.1413

values:
nofollow
external text
//ssrn.com/abstract=1592456

values:
nofollow
external text
http://phys.org/news111145481.html

values: -moz-column-width: 30em; -webkit-column-width: 30em; column-width: 30em; list-style-type: decimal;

values: position: absolute; top: 0px; left: 100px; right: 0px; bottom: 0px; height: 0px; width: 0px;

values: left: 50%; top: 50%; margin-left: -35px; margin-top: -27.5px;

values:
mwPlayerContainer k-player videoHolder
width: 200px; position: relative;

values:
float: left; margin-left: 5px;
floatnone

values:
/wiki/Wikipedia:Media_help
mw-redirect
Wikipedia:Media help

values: font-size: xx-small; line-height: 1.6em; margin-left: 60px;

values:
/wiki/Concise_Encyclopedia_of_Economics
mw-redirect
Concise Encyclopedia of Economics

values:
/wiki/Library_of_Economics_and_Liberty
mw-redirect
Library of Economics and Liberty

values:
nofollow
external text
//www.worldcat.org/oclc/237794267

values: Category:CS1 maint: Extra text: editors list

values:
nofollow
external text
http://gametheorygames.nl/index.html

values:
/wiki/Epicurean_paradox
mw-redirect
Epicurean paradox

values: Wittgenstein on Rules and Private Language

values:
navbox-image
4
width:1px;padding:0px 0px 0px 2px

values:
/wiki/Paradox_of_entailment
mw-redirect
Paradox of entailment

values:
/wiki/Ross%27_paradox
mw-redirect
Ross' paradox

values:
/wiki/Tullock_paradox
mw-redirect
Tullock paradox

values: nowraplinks collapsible collapsed navbox-inner mw-collapsible mw-collapsed mw-made-collapsible

values:
/wiki/Cooperative_game
mw-redirect
Cooperative game

values:
/wiki/Dominance_(game_theory)
mw-redirect
Dominance (game theory)

values:
/wiki/Forward_induction
mw-redirect
Forward induction

values:
/wiki/Large_Poisson_game
mw-redirect
Large Poisson game

values:
/wiki/Nash_bargaining_game
mw-redirect
Nash bargaining game

values:
/wiki/Prisoners_and_hats_puzzle
mw-redirect
Prisoners and hats puzzle

values: nowraplinks collapsible autocollapse navbox-inner mw-collapsible mw-made-collapsible mw-collapsed

attrs: alt src width height style srcset data-file-width data-file-height

values:
nofollow
external text
https://d-nb.info/gnd/4139587-6

values:
nofollow
external text
https://www.idref.fr/034513272

values: Category:Webarchive template wayback links

values: Category:Articles needing additional references from November 2012

values: Category:All articles needing additional references

values: Category:Articles needing more detailed references

values: Category:Wikipedia articles needing clarification from August 2016

values: Category:All articles with unsourced statements

values: Category:Articles with unsourced statements from December 2012

values: Category:Articles with unsourced statements from November 2012

values: Category:Articles with unsourced statements from October 2016

values: Category:Articles with hAudio microformats

values: Category:Wikipedia articles with BNE identifiers

values: Category:Wikipedia articles with BNF identifiers

values: Category:Wikipedia articles with GND identifiers

values: Category:Wikipedia articles with LCCN identifiers

values: Category:Wikipedia articles with SUDOC identifiers

values: Discussion about edits from this IP address [ctrl-alt-n]

values: A list of edits made from this IP address [ctrl-alt-y]

values: You are encouraged to create an account and log in; however, it is not mandatory

values: You're encouraged to log in; however, it's not mandatory. [ctrl-alt-o]

values:
/wiki/Prisoner%27s_dilemma
View the content page [ctrl-alt-c]
c

values: Discussion about the content page [ctrl-alt-t]

values: p-namespaces navigation vectorTabs p-namespaces-label

values:
p-variants
navigation
vectorMenu emptyPortlet
p-variants-label

values: Past revisions of this page [ctrl-alt-h]

values: p-views navigation vectorTabs p-views-label

values:
p-cactions
navigation
vectorMenu emptyPortlet
p-cactions-label

values:
mw-wiki-logo
/wiki/Main_Page
Visit the main page

values:
/wiki/Main_Page
Visit the main page [ctrl-alt-z]
z

values: Featured content – the best of Wikipedia

values: Find background information on current events

values:
/wiki/Special:Random
Load a random article [ctrl-alt-x]
x

values: portal navigation p-navigation p-navigation-label

values: Guidance on how to use and edit Wikipedia

values: About the project, what you can do, where to find things

values: A list of recent changes in the wiki [ctrl-alt-r]

values: portal navigation p-interaction p-interaction-label

values: List of all English Wikipedia pages containing links to this page [ctrl-alt-j]

values: Recent changes in pages linked from this page [ctrl-alt-k]

values:
/wiki/Wikipedia:File_Upload_Wizard
Upload files [ctrl-alt-u]
u

values: A list of all special pages [ctrl-alt-q]

values: Permanent link to this revision of the page

values: Link to connected data repository item [ctrl-alt-g]

values: Printable version of this page [ctrl-alt-p]

values: portal navigation p-wikibase-otherprojects p-wikibase-otherprojects-label

values: معضلة السجينين – Arabic

values: Дилема на затворника – Bulgarian

values:
interlanguage-link interwiki-bg
display: none;

values:
interlanguage-link interwiki-ca
display: none;

values:
interlanguage-link interwiki-cs
display: none;

values:
interlanguage-link interwiki-da
display: none;

values:
interlanguage-link interwiki-et
display: none;

values: Δίλημμα του φυλακισμένου – Greek

values:
interlanguage-link interwiki-el
display: none;

values:
interlanguage-link interwiki-eo
display: none;

values:
interlanguage-link interwiki-eu
display: none;

values: دوراهی زندانی – Persian

values:
interlanguage-link interwiki-fa
display: none;

values: 죄수의 딜레마 – Korean

values:
interlanguage-link interwiki-ko
display: none;

values: बंदी की दुविधा – Hindi

values:
interlanguage-link interwiki-hr
display: none;

values:
interlanguage-link interwiki-io
display: none;

values:
interlanguage-link interwiki-is
display: none;

values:
interlanguage-link interwiki-it
display: none;

values: דילמת האסיר – Hebrew

values:
interlanguage-link interwiki-he
display: none;

values: პატიმრის დილემა – Georgian

values:
interlanguage-link interwiki-ka
display: none;

values:
interlanguage-link interwiki-la
display: none;

values:
interlanguage-link interwiki-lv
display: none;

values:
interlanguage-link interwiki-lt
display: none;

values:
interlanguage-link interwiki-hu
display: none;

values:
interlanguage-link interwiki-nl
display: none;

values: 囚人のジレンマ – Japanese

values:
interlanguage-link interwiki-ja
display: none;

values:
interlanguage-link interwiki-no
display: none;

values: ਕੈਦੀ ਦੀ ਦੁਬਿਧਾ – Punjabi

values:
interlanguage-link interwiki-pa
display: none;

values:
interlanguage-link interwiki-pl
display: none;

values:
interlanguage-link interwiki-ro
display: none;

values: Дилемма заключённого – Russian

values:
interlanguage-link interwiki-sl
display: none;

values: Затвореникова дилема – Serbian

values: Mahirap na kalagayan ng bilanggo – Tagalog

values:
interlanguage-link interwiki-tl
display: none;

values: கைதியின் குழப்பம் – Tamil

values: ความลำบากใจของนักโทษ – Thai

values: Дилема в'язня – Ukrainian

values: /static/images/wikimedia-button-1.5x.png 1.5x, /static/images/wikimedia-button-2x.png 2x

values: /static/images/poweredby_mediawiki_132x47.png 1.5x, /static/images/poweredby_mediawiki_176x62.png 2x

values:
suggestions
display: none; font-size: 13px;

values: mediawiki ltr sitedir-ltr mw-hide-empty-elt ns-0 ns-subject page-Prisoner_s_dilemma rootpage-Prisoner_s_dilemma skin-vector action-view