< Back to Article

Reinforcement Learning Explains Conditional Cooperation and Its Moody Cousin

Fig 3

CC and MCC in the repeated PDG on the square lattice.

The actual probability of cooperation, , is plotted against the fraction of cooperative neighbors in the previous round, f_C. The error bars represent the mean ± standard deviation calculated on the basis of all players, t_max = 25 rounds, and 10³ simulations. The circles represent the results not conditioned on a_t−1. The triangles and the squares represent the results conditioned on a_t−1 = C and a_t−1 = D, respectively. We set (A) β = 0.1 and A = 0.5, (B) β = 0.4 and A = 0.5, (C) β = 0.4 and A = 2.0, and (D) β = 0.4 and A = −1.0.

doi: https://doi.org/10.1371/journal.pcbi.1005034.g003