|
| 1 | +Play Contexts and Generic Prisoner's Dilemma |
| 2 | +============================================ |
| 3 | + |
| 4 | +There are four possible round outcomes: |
| 5 | + |
| 6 | +- Mutual cooperation: :math:`(C, C)` |
| 7 | +- Defection: :math:`(C, D)` or :math:`(D, C)` |
| 8 | +- Mutual defection: :math:`(D, D)` |
| 9 | + |
| 10 | +Each of these corresponds to one particular set of payoffs in the following |
| 11 | +generic Prisoner's dilemma: |
| 12 | + |
| 13 | + |
| 14 | ++----------+---------------+---------------+ |
| 15 | +| | Cooperate | Defect | |
| 16 | ++==========+===============+===============+ |
| 17 | +|Cooperate | (R,R) | (S,T) | |
| 18 | ++----------+---------------+---------------+ |
| 19 | +|Defect | (T,S) | (P,P) | |
| 20 | ++----------+---------------+---------------+ |
| 21 | + |
| 22 | +For the above to constitute a Prisoner's dilemma, the following must hold: |
| 23 | +:math:`T>R>P>S`. |
| 24 | + |
| 25 | +These payoffs are commonly referred to as: |
| 26 | + |
| 27 | +- :math:`R`: the **Reward** payoff (default value in the library: 3) |
| 28 | +- :math:`P`: the **Punishment** payoff (default value in the library: 1) |
| 29 | +- :math:`S`: the **Sucker** payoff (default value in the library: 0) |
| 30 | +- :math:`T`: the **Temptation** payoff (default value in the library: 5) |
| 31 | + |
| 32 | +A particular Prisoner's Dilemma is often described by the 4-tuple: :math:`(R, P, |
| 33 | +S, T)`:: |
| 34 | + |
| 35 | + >>> import axelrod |
| 36 | + >>> axelrod.game.DefaultGame.RPST() |
| 37 | + (3, 1, 0, 5) |
0 commit comments