Abstract
During the last few years, much research has been devoted to strategic interactions on complex networks. In this context, the Prisoner's Dilemma has become a paradigmatic model and it has been established that imitative evolutionary dynamics lead to very different outcomes depending on the details of the network. We here report that when one takes into account the real behavior of people observed in the experiments, both at the meanfield level and on utterly different networks, the observed level of cooperation is the same. We thus show that when human subjects interact in a heterogeneous mix including cooperators, defectors and moody conditional cooperators, the structure of the population does not promote or inhibit cooperation with respect to a well mixed population.
Similar content being viewed by others
Introduction
In recent years, the physics of complex systems has widened its scope by considering interacting manyparticle models where the interaction goes beyond the usual concept of force. One such line of research that has proven particularly interesting is evolutionary game theory on graphs^{1,2}, in which interaction between agents is given by a game while their own state is described by a strategy subject to an evolutionary process^{3,4}. A game that has attracted a lot of attention in this respect is the Prisoner's Dilemma (PD)^{5,6}, a model of a situation in which cooperative actions lead to the best outcome in social terms, but where free riders or noncooperative individuals can benefit the most individually. In mathematical terms, this is described by a payoff matrix (entries correspond to the row player's payoffs and C and D are respectively the cooperative and noncooperative actions)
with T > 1 (temptation to freeride) and S < 0 (detriment in cooperating when the other does not).
In a pioneering work, Nowak and May^{7} showed that the behavior observed in a repeated Prisoner's Dilemma was dramatically different on a lattice than in a meanfield approach: Indeed, on a lattice the cooperative strategy was able to prevail by forming clusters of alike agents who outcompeted defection. Subsequently, the problem was considered in literally hundreds of papers^{1,8,9,10,11} and very many differences between structured and wellmixed (meanfield) populations were identified, although by no means they were always in favor of cooperation^{12,13}. In fact, it has been recently realized that this problem is very sensitive to the details of the system^{2,14}, in particular to the type of evolutionary dynamics^{15} considered. For this reason experimental input is needed in order to reach a sound conclusion about what has been referred to as ‘network reciprocity’.
Here, we show that using the outcome from the experimental evidence to inform theoretical models, the behavior of agents playing a PD is the same at the mean field level and in very different networks. To this end, instead of considering some ad hoc imitative dynamics^{7,16,17}, our players will play according to the strategy recently uncovered by Grujić et al.^{18} in the largest experiment reported to date about the repeated spatial PD, carried out on a lattice as in Nowak and May's paper^{7} with parameters T = 1.43 and S = 0.
The results of the experiment were novel in several respects. First, the population of players exhibited a rather low level of cooperation (fraction of cooperative actions in every round of the game in the steady state), hereafter denoted by 〈c〉. Most important, however, was the unraveling of the structure of the strategies. The analysis of the actions taken by the players showed a heterogeneous population consisting of “mostly defectors” (defected with probability larger than 0.8), a few “mostly cooperators” (cooperated with probability larger than 0.8) and a majority of socalled moody conditional cooperators. This last group consisted of players that switched from cooperation to defection with probability and from defection to cooperation with probability , c_{i} being the fraction of cooperative actions in player i's neighborhood in the previous iteration. Conditional cooperation, i.e., the dependence of the chosen strategy on the amount of cooperation received, had been reported earlier in related experiments^{19} and observed also for the spatial repeated PD at a smaller scale^{20}. The new ingredient revealed in Grujić et al.'s experiment^{18} was the dependence of the behavior on the own player's previous action, hence the reason to call them “moody”.
Results
To study how the newly unveiled rules influence the emergence of cooperation in an structured population of individuals, we first report results from numerical simulations of a system made up of N = 10^{4} individuals who play a repeated PD game according to the experimental observations. To this end, we explored the average level of cooperation in four different network configurations: a wellmixed population in which the probability that a player interacts with any other one is the same for all players, a square lattice, an ErdösRenyi (ER) graph and a BarabásiAlbert (BA) scalefree (SF) network. It is worth mentioning that the dependence on the payoff matrix only enters through the parameters describing the players' behavior (d, γ, a, β and the fractions of the three types of players). Once these parameters are fixed the payoffs do not enter anywhere in the evolution, as this is only determined by the variables c_{i}, the local fractions of cooperative actions within each player's neighborhood. Thus there is no possibility to explore the dependence on the payoffs because we lack a connection between them and the behavioral parameters.
In Figure 1 we present our most striking result. The figure represents, in a colorcoded scale, the average level of cooperation as a function of the fraction of mostly cooperators, ρ_{C} and mostly defectors, ρ_{D}, for a BA network of contacts. The same plots but for the rest of topologies explored (lattice and ER graphs) produce indistinguishable results with respect to those shown in the figure. We therefore conclude that the average level of cooperation in the system does not depend on the underlying structure. This means that, under the assumption that the players follow the behavior of Grujić et al's experiment^{18}, there is no network reciprocity, i.e., no matter what the network of contacts looks like, the observed level of cooperation is the same. This latter finding is in stark contrast to most previous results coming out from numerical simulations of models in which many different updating rules —all of them based upon the relative payoffs obtained by the players— have been explored.
Meanfield Approach
The previous numerical findings can be recovered using a simple meanfield approach to the problem. Let the fractions of the three types of players be ρ_{C}, ρ_{D} and ρ_{X}, for mostly cooperators, mostly defectors and moody conditional cooperators, respectively, with the obvious constraint ρ_{X} = 1 − ρ_{D} − ρ_{C}. Denoting by P_{t}(A) the cooperation probability at time t for strategy A( = C, D, X) of the repeated PD we have
where P_{t}(C) = P(C) and P_{t}(D) = P(D) are known constants [in our case P(C) = 0.8, P(D) = 0.2]. The probability of cooperation for conditional players in the next time step can be obtained as
where the first term in the right hand side considers the probability that a conditional cooperator keeps playing as a cooperator, whereas the second terms stands for the situation in which a moody conditional cooperator switched from defection to cooperation. Asymptotically
From Eq. (3),
thus (2) implies (with the replacement ρ_{X} = 1 − ρ_{C} − ρ_{D})
where
are functions of 〈c〉. From Eq. (5) it follows that the curves of constant 〈c〉 are straight lines in the simplex. Figure 1 clearly demonstrates this fact: The straight lines are plots of Eq. (5) for different values of 〈c〉. It can be seen that they are parallel to the color stripes and that the values of 〈c〉 they correspond to accurately fit those of the simulations. Figure 2 depicts the curve 〈c〉 vs. ρ_{C} for two different values of ρ_{D}, as obtained from Eq. (5) and compared to simulations. This figure illustrates the excellent quantitative agreement between the meanfield result and the simulation results. The match between the analytical and numerical results is remarkable, as it is the fact that this agreement does not depend on the underlying topology. This is the ultimate consequence of the lack of network reciprocity: the cooperation level on any network can be accurately modeled as if individuals were playing in a wellmixed population.
The steady state is reached after a rather short transient, as illustrated in Figure 3. This figure compares the approach of the cooperation level to its stationary state as obtained iterating Eq. (3) and from numerical simulations on different networks with different sizes. The initial cooperation level has been set to 〈c〉_{0} = 0.592, close to the value observed in Grujić et al's experiment^{18}. The transient does exhibit a weak dependence on the underlying topology and specially on the network size, but for the largest simulated size (N = 10^{4}) the curves are all very close to the meanfield prediction.
Distribution of Payoffs
The only observable on which the topology does have a strong effect is the payoff distribution among players. Figure 4 shows these distributions for the three studied topologies and at two different times —short and long. Smooth at short times, this distribution peaks around certain values at long times. This reflects the fact that payoffs depend on the number of neighbors of different types around a given player, which yields a finite set of values for the payoffs (the centers of the peaks). These numbers occur with different probabilities (determining the height of the peaks), according to the distribution
where p(k) is the degree distribution of the network and k = (k_{C}, k_{D}, k_{X}), but it is understood that k_{X} = k − k_{C} − k_{D}. The standard convention is assumed that the multinomial coefficient whenever k_{C} < 0, k_{D} < 0 or k_{X} < 0.
The approach to a stationary distribution of payoffs exhibits a much longer transient. This is due to the fluctuations in the payoffs arising from the specific actions (cooperate or defect) taken by the players. These fluctuations damp out as the accumulated payoffs approach their asymptotic values. Thus, the peak widths shrink proportionally to t^{−1/2}. In fact, one can show that the probability density for the distribution of payoffs Π for strategy Z can be approximated as
where , the mean payoff per neighbor received by a Z strategist against a cooperator is
with k = k_{C} + k_{D} + k_{X} and the average cooperation level in the neighborhood of the focal player and its variance are
The approximate total payoff distribution, W(Π) = ρ_{C}W_{C}(Π) + ρ_{D}W_{D}(Π) + ρ_{X}W_{X}(Π), is compared in Figure 4 with the results of the simulations for the longest time.
Discussion
In this work we have shown both analytically and through numerical simulations that if we take into account the way in which humans are experimentally found to behave when facing social dilemmas on lattices, no evidence of network reciprocity is obtained. In particular, we have argued that if the players of a Prisoners' Dilemma adopt an update rule that only depends on what they see from their neighborhood, then cooperation drops to a low level —albeit nonzero— irrespective of the underlying network. Moreover, we have shown that the average level of cooperation obtained from simulations is very well predicted by a meanfield model and it is found to depend only on the fractions of different strategists. Additionally, we have also shown that the underlying network of contacts does manifest itself in the distribution of payoffs obtained by the players and has a slight influence on the transient behavior.
To conclude, it is worth mentioning that our results only make sense when applied to evolutionary game models aimed at mimicking human behavior in social dilemmas. The independence on the topology seems to reflect the fact that humans update their actions according to a rule that ignores relative payoffs. Interestingly, absence of network reciprocity has also been observed in numerical simulations using best response dynamics^{21}, an update rule widely used in economics that does not take into account the neighbors's payoffs. This suggests that the result that networks do not play any role in the repeated PD may be general for any dynamics that does not take neighbors' payoffs into account. We want to stress that the same kind of models thought of in a strict biological context are ruled by completely different mechanisms which do take into account payoff (fitness) differences. Therefore, in such contexts lattice reciprocity does play its role. In any case, our results call for further experiments that uncover what rules are actually governing the behavior of players engaged in this and other social dilemmas.
References
Szabó, G. & Fáth, G. Evolutionary games on graphs. Phys. Rep. 446, 97–216 (2007).
Roca, C. P., Cuesta, J. A. & Sánchez, A. Evolutionary game theory: Temporal and spatial effects beyond replicator dynamics. Phys. Life Rev. 6, 208–249 (2009).
Hofbauer, J. & Sigmund, K. Evolutionary Games and Population Dynamics (Cambridge University Press, Cambridge, 1998).
Gintis, H. Game Theory Evolving (2nd Ed, Princeton University Press, Princeton, 2009).
Rapoport, A. & Guyer, M. A taxonomy of 2×2 games. General Systems 11, 203–214 (1966).
Axelrod, R. The Evolution of Cooperation (Basic Books, New York, 1984).
Nowak, M. A. & May, R. M. Evolutionary games and spatial chaos. Nature 359, 826–829 (1992).
Perc, M. & Szolnoki, A. Coevolutionary games  A mini review. BioSystems 99, 109–125 (2010).
Santos, F. C. & Pacheco, J. M. Scalefree networks provide a unifying framework for the emergence of cooperation. Phys. Rev. Lett. 95, 98104 (2005).
GómezGardeñes, J., Campillo, M., Floría, L. M. & Moreno, Y. Dynamical organization of cooperation in complex networks. Phys. Rev. Lett. 98, 108103 (2007).
Szolnoki, A. & Perc, M. Conditional strategies and the evolution of cooperation in spatial public goods games. Phys. Rev. E 85, 026104 (2012).
Hauert, C. & Doebeli, M. Spatial structure often inhibits the evolution of cooperation in the Snowdrift game. Nature 428, 643–646 (2004).
SysiAho, M., Saramäki, J., Kertész, J. & Kaski, K. Spatial snowdrift game with myopic agents. Eur. Phys. J. B 44, 129–135 (2005).
Roca, C. P., Cuesta, J. A. & Sánchez, A. The effect of spatial structure on the emergence of cooperation. Phys. Rev. E 80, 046106 (2009).
Hofbauer, J. & Sigmund, K. Evolutionary game dynamics. Bull. Amer. Math. Soc. 40, 479–519 (2003).
Helbing, D. Interrelations between stochastic equations for systems with pair interactions. Physica A 181, 29–52 (1992).
Szabó, G. & Töke, C. Evolutionary prisoners dilemma game on a square lattice. Phys. Rev. E 58, 69–73 (1998).
Grujić, J., Fosco, C., Araujo, L., Cuesta, J. A. & Sánchez, A. Social Experiments in the Mesoscale: Humans Playing a Spatial Prisoner's Dilemma. PLoS ONE 5(11), e13749 (2010).
Fischbacher, U., Gächter, S. & Fehr, E. Are people conditionally cooperative? Evidence from a public goods experiment. Econ Lett 71, 397404 (2001).
Traulsen, A., Semmann, D., Sommerfeld, R. D., Krambeck, H. J. & Milinski, M. Human strategy updating in evolutionary games. Proc. Natl. Acad. Sci. USA 107, 29622966 (2010).
Roca, C. P., Cuesta, J. A. & A. Sánchez, A. Promotion of cooperation on networks? The myopic best response case. Eur. Phys. J. B 71, 587–595 (2009).
Acknowledgements
J. A. C. and A. S. acknowledge grants MOSAICO, PRODIEVO and ComplexityNET RESINEE (Ministerio de Ciencia e Innovación, Spain) and MODELICOCM (Comunidad de Madrid, Spain). Y. M. was partially supported by Spanish MICINN (Ministerio de Ciencia e Innovación) projects FIS200801240 and FIS200913364C0201, by the FETOpen project DYNANETS (grant no. 233847) funded by the European Commission and by Comunidad de Aragón (Spain) through the project FMI22/10.
Author information
Authors and Affiliations
Contributions
C.GL, J.A.C., A. S, & Y.M designed and performed research, analyzed the data and contributed new analytical results. All authors wrote, reviewed and approved the manuscript.
Ethics declarations
Competing interests
The authors declare no competing financial interests.
Rights and permissions
This work is licensed under a Creative Commons AttributionNonCommercialNo Derivative Works 3.0 Unported License. To view a copy of this license, visit http://creativecommons.org/licenses/byncnd/3.0/
About this article
Cite this article
GraciaLázaro, C., Cuesta, J., Sánchez, A. et al. Human behavior in Prisoner's Dilemma experiments suppresses network reciprocity. Sci Rep 2, 325 (2012). https://doi.org/10.1038/srep00325
Received:
Accepted:
Published:
DOI: https://doi.org/10.1038/srep00325
This article is cited by

Inferring strategies from observations in long iterated Prisoner’s dilemma experiments
Scientific Reports (2022)

Direct reciprocity and modelpredictive rationality explain network reciprocity over social ties
Scientific Reports (2019)

Evolutionary dynamics of Nperson HawkDove games
Scientific Reports (2017)

Reputation drives cooperative behaviour and network formation in human groups
Scientific Reports (2015)

Aspiration dynamics in structured population acts as if in a wellmixed one
Scientific Reports (2015)
Comments
By submitting a comment you agree to abide by our Terms and Community Guidelines. If you find something abusive or that does not comply with our terms or guidelines please flag it as inappropriate.