Appendix

Main Menu Previous Topic Next Topic

**The Numeric Payoffs of Prisoner's Dilemma**

Throughout this tutorial, we assumed a particular set of numeric payoffs for two players facing a Prisoner's
Dilemma.^{1} These payoffs are listed in the table below.
Note that they satisfy the conditions outlined in the second slide of Topic 1. For instance, the maximal total payoff occurs when both players cooperate, and is equal to
**3 + 3 = 6**. Also note that no matter whether Player A cooperates or not, it is always advantageous for
B to defect.

Player A | |||

Cooperates | Defects | ||

Player B | Cooperates | A:3 B:3 | A:5 B:0 |

Defects | A:0 B:5 | A:1 B:1 |

1. This set of payoffs is originally used throughout "The Evolution of Cooperation".

Previous Slide Next Slide