< Back to Article

Reinforcement Learning Explains Conditional Cooperation and Its Moody Cousin

Fig 4

Search of CC and MCC patterns in the repeated PDG on the square lattice.

(A) Schematic of the linear fit, . (B) Slope α₁ of the linear fit when not conditioned on the focal player’s previous action, a_t−1. (C) α₁ when conditioned on a_t−1 = C. (D) α₁ when conditioned on a_t−1 = D. (E) Difference between the intercept, α₂, obtained from the linear fit conditioned on a_t−1 = C and that conditioned on a_t−1 = D. For each combination of the β and A values, a linear fit was obtained by the least-squares method on the basis of the 10² players, t_max = 25 rounds, and 10³ simulations, yielding 2.5 × 10⁶ samples in total.

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