Prisoner's dilemma
Part of a convergent series on Mathematics |
1+1=11 |
The prisoner's dilemma is a classic problem in game theory. It has the paradoxical outcome that members of a group will consciously steer towards a sub-optimal outcome in certain scenarios.
B | |||
---|---|---|---|
don't confess | confess | ||
A | don't confess | A: 6 months
B: 6 months |
A: 10 years
B: free |
confess | A: free
B: 10 years |
A: 2 years
B: 2 years |
The game is usually phrased in terms of two suspects, both of whom have been arrested, and offered a bargain. If both stay silent, they will both serve 6 months in prison for a minor crime. If one of them confesses, this provides evidence of a major crime. The confessor is rewarded by being let free, and the other suspect will then serve ten years in prison. If both confess, they will both serve two years.
It is obvious that the best outcome for the group would be if both prisoners cooperated and stayed silent: six months for both prisoners. However, in the "default" setting of the prisoner's dilemma, we assume that the prisoners are not given the chance to work out such a strategy and that they are interested in their own wellbeing first.
Prisoner A will now analyze his options:
- If Prisoner B chooses "don't confess", Prisoner A's best choice will be "confess": A gets out of prison immediately.
- If Prisoner B chooses "confess", Prisoner A's best choice will be "confess", too: 2 years is better than 10 years.
(The case for Prisoner B is symmetric.)
Using this reasoning, both prisoners will choose "confess", even though it is not the best result.
The strategy "confess" is a strictly dominant strategy: the choice of Prisoner B does not change the way Prisoner A will act, and vice versa. The "confess/confess" scenario is also the only Nash equilibrium^{} in this problem.
Contents
Iterated prisoner's dilemma[edit]
The iterated prisoner's dilemma is when the basic game is played multiple times (sometimes, infinitely many times). Here, co-operation can be a Nash equilibrium. This requires that each player pays attention to what the other player did on previous "rounds", and punish or reward the other player as appropriate.
In 1980 Robert Axelrod put out a call for experts in game theory and computational science to send in algorithms for playing an iterative Prisoner's Dilemma. He proposed to have all submitted algorithms compete in a tournament to see which one was the best. A total of fourteen algorithms were submitted, ranging from immensely complicated and computational intensive, to extremely simple. The results were published in the Journal of Conflict Resolution, and as it turned out, the simplest and smallest algorithm won the tournament. It was developed by Anatol Rapoport, of the University of Toronto, and it was called "tit for tat". The "tit for tat" strategy is to cooperate the first time and then on all subsequent times the strategy is to do whatever the opponent did on the turn prior to the one you are on. While subsequent algorithms have been developed that can best the "tit for tat" strategy, it remains the most computationally efficient. Because of this, it has been proposed as the strategy that humans employ in social interactions.
An additional strategy that is often followed and debated is the "Grim Trigger": cooperate until the first defection, and from then on out, defect every turn. Grim Trigger tends to work only when there is information exchange.
Relation to international affairs: nuclear detente[edit]
B | |||
---|---|---|---|
defect | cooperate | ||
A | defect | A: +1
B: +1 |
A: +5
B: +0 |
cooperate | A: +0
B: +5 |
A: +3
B: +3 |
The prisoner's dilemma can be used to explain the awkward situation of exact nuclear parity. So long as a first-strike is possible, and the first-strike would eliminate the chance of retaliation, the players are in a "prisoner's dilemma," and, as noted above, are incentivized to defect.
Much of Cold War policy, then, was struggling to prevent a prisoner's dilemma situation. For example, the retention of American nuclear warheads in untraceable submarines, and the retention of Russian arms in untraceable rail cars, prevented the incentive of the first strike, and kept the parties locked in a situation where cooperation remained the best strategy.^{[note 1]}
Nuclear "escalation" could destabilize such parity. For example, the development of MIRV^{} (Multiple Independently targetable Re-entry Vehicle) warheads briefly placed the United States ahead of the Soviet Union, but when the latter also employed MIRVs, some US hawks worried that the Soviet's ability to cram more warheads onto a missile than the US (Soviet missiles could carry greater payloads) would put the the Reds ahead of the US. Similarly, American development of an effective nuclear shield (i.e. an SDI which actually worked) would have "won" the game and potentially allowed for a US nuclear first strike without the opportunity of retaliation and was greatly feared by Russia, leading the Kremlin to contemplate SDI as a reason for a first-strike were its completion imminent. Fortunately, the Soviets quickly realized that Ronnie's orbital ray guns were pies in the sky, rather than a workable defense against ICBMs, and were happy to let Washington waste its money on this white elephant.
The "game" as studied by political scientists is displayed to the right, with the traditional values.
How people could play such a "game" when the relative survival of the human race, and most complex life on earth, was at stake, is a whole 'nother interesting question. The answer is, that it's not really a "game", even though it's called "game theory". The study of these matters is of dire importance to any opposing powers before they commit to sacrificing the life of their people.
See also[edit]
External links[edit]
Notes[edit]
- ↑ The first public analysis of this frightening balance of power was provided by strategist Herman Kahn in his 1961 book On Thermonuclear War.