Skip to main content
Advertisement
Browse Subject Areas
?

Click through the PLOS taxonomy to find articles in your field.

For more information about PLOS Subject Areas, click here.

  • Loading metrics

Evolution of Cooperation on Spatial Network with Limited Resource

  • Yang Wang,

    Affiliation Department of Modern Physics, University of Science and Technology of China, Hefei, Anhui, 230026, P. R. China

  • Binghong Wang

    bhwang@ustc.edu.cn

    Affiliations Department of Modern Physics, University of Science and Technology of China, Hefei, Anhui, 230026, P. R. China, College of Physics and Electronic Information Engineering, Wenzhou University, Wenzhou, Zhejiang, 325035, P. R. China, School of Science, Southwest University of Science and Technology, Mianyang, Sichuan, 621010, P. R. China

Abstract

Considering the external resource offered by environment is limited, here, we will explore the cooperation on spatial networks with limited resource. The individual distributes the limited resource according to the payoffs acquired in games, and one with resource amounts is lower than critical survival resource level will be replaced by the offspring of its neighbors. We find that, for larger temptation to defect, the number of the dead decreases with the resource amount. However the cooperation behavior is interesting, the lower total resource and intermediate temptation to defect can greatly promote the cooperation on square lattice. Our result reveals that the limited resource contributes most to the cooperation.

Introduction

In the past decades, the social dilemma games have been widely investigated [13]. The most typical model is the prisoner’s dilemma game(PDG) [49]. In the original PDG, individuals can choose cooperation or defection. Both of them can receive payoff R upon mutual cooperation and P upon mutual defection. If one chooses to defect while its opponent cooperates, the cooperator receives S and the defector gets T. In the PDG, the ranking of the four payoff values is T > R > P > S and 2R > T + S. There exist two essential features for these game models. Firstly, cooperation strategy maximizes the highest collective payoffs. Secondly, the transformation of a player from the cooperator to defector can increase its own payoff [1015]. Hence, a rational player may choose defection strategy even the cooperation can brings the highest collective payoff, which leads to the distinction of cooperation. But cooperation can spread in the structured population by forming the clusters to resist the invasion of defection. Meanwhile, various mechanisms and factors which can affect the cooperation on networks have been investigated, including inhomogeneous activity [16, 17], kin selection [10, 18], migration [1921], social diversity [2224], reputation [25], memory [26], payoff sharing [27], punishment [2831] and reward [32, 33]. Another evolution model is Moran process on networks [34, 35], it contains two updating rules: Birth-Death Update and Death-Birth Update, respectively. For the former, the reproduction probability of an individual is proportional to its fitness, and then a randomly selected neighbor is replaced. While for the latter, the death operation happens firstly, and the site of the dead individual is replaced by the neighbors’ offspring according to their fitness. The traditional setup of individual’s death and other activities are mainly based on the consideration of that individuals need a lowest payoff to survive, but it neglects the effect of environment [36, 37].

In nature, the environment condition impels the resource distributing to each individual is limited. Hence, the most profitable strategy is in a minority. It has been demonstrated that cooperation and competition patterns can arise in these games [3840]. In addition, the complete cooperator and defector are rare, and more realistic fact is the strategy of the individual is continuous. Base on these considerations, we introduce a limited resource Death-Birth Update model into spatial games. At each update, individuals distribute the limited system resource according to their game payoffs. Then the one whose resource amount is lower than critical survival value will be replaced by offspring of its neighbor, and the selection probability is proportional to resource. Due to the continuous strategy, the payoff of the individual is the expected value acquired from its direct neighbors by playing the prisoner’s dilemma games. We find that the intermediate resource can result in minimal number of dead individuals and highest cooperation level. Additionally, for larger resource, the intermediate temptation to defect is greastest contribution to the cooperation. While from the aspect of biodiversity, enough sufficient resource and appropriate temptation are more helpful to the existence of individuals with various strategies.

The paper is organized as follows: Section 2 is the detailed description of the model. In Section 3, we present the simulation results. The Section 4 is the discussion.

Model

We apply the square lattice with periodic boundary condition to simulate the ecosystems. Initially, each individual is assigned a characteristic parameter p(For convenience, we denote characteristic parameter as CP) as “gene” to quantify the tendency of individual to cooperate and p will be the strategy of individual to participate in games. Environment parameter c denotes the total investment of surrounding to each individual. For simplicity, we consider the environment consumption is same for each individual, and we set the consumption to be 1. Then, the total consumption and investment for the system are L × L and Gsys = cL × L, respectively.

A full Monte Carlo step consists three steps: calculation of payoff, distribution of resource and Dead-Birth Update.

  1. Calculation of payoff. An individual with characteristic parameter pi interacts with a pj neighbor can acquire payoff Pij: (1) where pi is the strategy(characteristic parameter) of individual i and pj is the strategy of i’s neighbour j. For simplicity but without loss of generality, the payoff matrix for the PDG is rescaled as R = 1, S = 0, T = b, P = 0, where b is temptation to defect, meanwhile it also can be considered as the characterization of competitive intensity. Then Pij = pi pj + (1 − pi)pj b. The payoff Pi = ∑j Pij of individual i is the total payoffs acquired from its four neighbors and the total payoff of system is Psys = ∑i Pi.
  2. Distribution of resource. The distribution of resource is based on the individuals’ payoffs, the resource distributed into individual i is proportional to its payoff: (2) After subtracting the consumption, the eventually resource for i is Hi = Gi − 1. Eq 2 indicates that the winners in the games can gain the higher payoffs.
  3. Death-Birth Update. It is considered that the individual who has negative resource Hi does not adapt to environment and will be replaced by the offspring of its neighbor, which is selected with probability proportional to their resources. If all of its neighbors are eliminated, the characteristic parameter of vacant site is randomly selected. Repeat process i), ii) and iii), the system will reach the stable state. For all simulations, we set the network size N = 100 × 100.

Results

Fig 1(a) shows the evolution of average characteristic parameter(CP) for different b. Due to the advantage of lower CP, we can find the rapid declines of average CP in the most early stages of the evolutionary process. While the network reciprocity can protect the individuals with higher CP to resist the invasion of individuals with lower CP. Then, the average CP begins to increase in the subsequent evolution. For the typical prisoner’s dilemma games on spatial networks, cooperation is promoted by network reciprocity. For in cooperative clusters, cooperators have higher payoffs than their defection neighbors in competition domain. As time going on, due to advantage of cooperation, defectors gradually begin to adopt cooperation strategy. Again, in our model, individuals in higher CP clusters can obtain enough resources to survive. While the death of higher CP individuals who have not formed clusters gives rises to drop of payoffs and resources of lower CP individuals. Then, the sites occupied by lower CP individuals are replaced by individuals with higher CP.

thumbnail
Fig 1. The cooperation on square lattice with limited resource.

(a) Time evolution of average characteristic parameter CP. (b) The number of dead individuals as a function of resource rate c for different temptation to defection b. (c) The average characteristic parameter as a function of resource rate c for different temptation to defection b. (d) The standard deviation of CP for the system a function of resource rate c for different b. Each data point is an average of 100 independent realizations.

https://doi.org/10.1371/journal.pone.0136295.g001

Fig 1(b) shows the number of dead individuals as a function of resource rate c for different temptation to defect b. We find that, for strict environment, the larger b renders the more individuals be replaced by the offspring of their neighbors. For large b, the differences of payoffs between the individuals with lower CP and higher CP are also large, which makes the individuals with lower CP can gain more resources. Then, most of individuals with higher CP will be replaced by ones with lower CP. With the increasing of resource rate c, the number of dead individuals begins to decrease rapidly. Given the parameter b, the effect of environment selection is weak for large c, and most of the individuals can obtain a resource that larger than consumption. Interestingly, we discover that, for intermediate c and small b, the number of dead individuals reachs the minimum value. Intuitively, if the environment is advantageous, then the selection effect is weak. While the Fig 1(b) reveals that, for small temptation to defect b, the intermediate environment is the greatest contribution to the survival of individuals.

Fig 1(c) shows the average characteristic parameter(CP) of system as a function of resource rate c for different b. We find that, for b = 1.1 and strict environmental condition, average CP nearly equals to 1. This indicates that the strong environment selection can create the most healthy cooperation environment. Unlike the well-mixed population, the cooperators can survive by direct and indirect network reciprocity. In this point, our results indicate that, the cooperators can also survive by network reciprocity when facing the strict environmental condition. However, with the increasing of resource rate c, the average characteristic parameter begins to reduce. In other words, the healthy environment cannot induce healthy cooperation behavior. For the case of large b, there exists an optimal environment rate c(around 1.2), in which the average CP is the highest. Fig 1(d) shows the standard deviation of CP for the system as a function of resource rate c for different b, respectively. It can be seen that, for three different b, the environment rate c corresponding to minimum of standard deviation of CP and number of dead individuals is exactly the same. The intermediate environment rate against the diversity of CP.

To intuitively explain the cooperation on square lattice by incorporating the environmental effect, we divide the interaction of a pair of individuals into three categories: i) “parasites-hosts”. The individual with lower CP(parasites), but its neighbor has higher CP(hosts); ii) “mutual cooperation”. The individual with higher CP and its neighbor also with higher CP; iii) “mutual defection”. The individual with lower CP and its neighbor with lower CP; From Eq 1, it can be known that the payoff ranking is “parasites”, “mutual cooperation”, “mutual defection” and “hosts” if we array with the individuals’ profits from high to low, the ranking is also the order of individuals’ assorted resource and probability of survival.

Figs 24 show the evolution of cooperation from a random initial state with limited resource for different temptation to defection. In Fig 2, we find that, for lower resource amount, at the beginning of MCS, the hosts and individuals in mutual defection are replaced rapidly by their neighbors. While the individuals in mutual cooperation can survive by network reciprocity. As the hosts and individuals with lower CP in mutual defection die out, and the empty sites are also replaced by individuals with higher CP, so lower resource and temptation to defection b can greatly promote the cooperation on lattice networks. While with the increasing of resource rate c, most individuals can survive in the system. Besides, the evolution of cooperation nearly holds unchanged, as shown in Fig 4. In this, the average CP also trends to 0.5, which is consistent with the result of Fig 1(b).

thumbnail
Fig 2. Evolution of cooperation from a random initial state with limited resource.

The snapshots are taken at MCS = 0 (a), 1 (b), 8 (c) and 1024 (d). The system size L = 100 and b = 1.1, c = 1.01.

https://doi.org/10.1371/journal.pone.0136295.g002

thumbnail
Fig 3. Evolution of cooperation from a random initial state with limited resource.

The snapshots are taken at MCS = 1 (a), 8 (b), 256 (c) and 1024 (d). The system size L = 100 and b = 1.9, c = 1.01.

https://doi.org/10.1371/journal.pone.0136295.g003

thumbnail
Fig 4. Evolution of cooperation from a random initial state with limited resource.

The snapshots are taken at b = 1.1, MCS = 8 (a), b = 1.1, MCS = 1024 (b), b = 1.9, MCS = 8 (c) and b = 1.9, MCS = 1024 (d). The system size L = 100 and c = 1.9.

https://doi.org/10.1371/journal.pone.0136295.g004

Finally, we explore the average number of dead individuals, average CP and standard deviation as functions of temptation to defect b and resource rate c, as shown in Fig 5. Fig 5(a) shows that, the number of dead individuals is mainly affected by the resource rate. It decreases rapidly with c, but slightly increases with b. Hence, the system with enough resource or more healthy cooperation environment may induce the total population to increase gradually. Fig 5(b) shows that, the system with lower temptation to defect b and c has most healthy cooperation environment. Fewer resources render the individuals with higher CP to form the clusters and further eliminate the invasion of lower CP individuals. While for the system with more enough resource, each individual can survive irrespective higher CP or lower CP. While Fig 5(c) shows that, the lower b and c are not contribution to the diversity of CP. To more clearly understand the effect of temptation to defect b and resource rate c on the average CP, we set 1 < b < 1.4 and 1 < c < 1.4. Interestingly, as c around 1.1, there exists an optimal average CP at middle temptation to defect b.

thumbnail
Fig 5. The cooperation on square lattice with limited resource.

(a) The number of dead individuals on the cb parameter plane. (b) The average characteristic parameter on the cb parameter plane. (c) The standard deviation of CP on the cb parameter plane. (d) The average characteristic parameter on the cb parameter plane in a small parameters region(1.0 < c < 1.4,1.0 < b < 1.4). Each data point is an average of 100 independent realizations.

https://doi.org/10.1371/journal.pone.0136295.g005

Discussion

The former works related to the evolutionary games on spatial networks are mainly focused on how to promote the cooperation among selfish individuals. The recent works have also begun to concern the cascading failure [37], silence [36] and other behaviors in game dynamics. While these behaviors are induced by individuals’ payoffs. The resource offered by the environment is usually limited, and the resource distributed by the system can be affected by games. Hence, we introduce the limited resource induced cooperation on spatial networks. Individuals with negative resource will be replaced by their neighbors’ offspring. We find that, the lower resource amount and temptation to defect can greatly promote the cooperation and have more strategy diversity. But the average number of dead individuals is deduced with the increasing of resource amount. As a result, the limited resource amount is the greatest contribution to the cooperation.

Acknowledgments

We thank Dr. Xu-Wen Wang for useful discussions.

Author Contributions

Conceived and designed the experiments: YW. Performed the experiments: YW. Analyzed the data: YW. Contributed reagents/materials/analysis tools: YW BW. Wrote the paper: YW BW.

References

  1. 1. Axelrod RM (2006) The evolution of cooperation. Basic books.
  2. 2. Smith JM (1982) Evolution and the Theory of Games. Cambridge university press.
  3. 3. Gintis H (2000) Game theory evolving: a problem-centered introduction to modeling stategic interaction. Princeton, NJ: Princeton UP.
  4. 4. Szabó G, Fath G (2007) Evolutionary games on graphs. Physics Reports 446: 97–216.
  5. 5. Perc M, Wang Z (2010) Heterogeneous aspirations promote cooperation in the prisoner’s dilemma game. PLoS One 5: e15117. pmid:21151898
  6. 6. Nowak MA, May RM (1992) Evolutionary games and spatial chaos. Nature 359: 826–829.
  7. 7. Wang Z, Perc M (2010) Aspiring to the fittest and promotion of cooperation in the prisoner’s dilemma game. Physical Review E 82: 021115.
  8. 8. Wang XW, Nie S, Wang BH (2015) Dependency links can hinder the evolution of cooperation in the prisoner’s dilemma game on lattices and networks. PLoS One 10: e0121508. pmid:25798579
  9. 9. Wu ZX, Xu XJ, Chen Y, Wang YH (2005) Spatial prisoner’s dilemma game with volunteering in newman-watts small-world networks. Physical Review E 71: 037103.
  10. 10. Nowak MA (2006) Five rules for the evolution of cooperation. Science 314: 1560–1563. pmid:17158317
  11. 11. Nowak MA, Sigmund K (1998) Evolution of indirect reciprocity by image scoring. Nature 393: 573–577. pmid:9634232
  12. 12. Wang XW, Zhang HF, Nie S, Wang BH (2013) Evolution of public cooperation with weighted and conditional strategies. Physica A: Statistical Mechanics and its Applications 392: 4668–4674.
  13. 13. Ohtsuki H, Hauert C, Lieberman E, Nowak MA (2006) A simple rule for the evolution of cooperation on graphs and social networks. Nature 441: 502–505. pmid:16724065
  14. 14. Zhang HF, Jin Z, Wang Z (2014) Cooperation and popularity in spatial games. Physica A: Statistical Mechanics and its Applications 414: 86–94.
  15. 15. Jiang LL, Zhao M, Yang HX, Wakeling J, Wang BH, Zhou T (2009) Reducing the heterogeneity of payoffs: An effective way to promote cooperation in the prisoner’s dilemma game. Physical Review E 80: 031144.
  16. 16. Szolnoki A, Szabó G (2007) Cooperation enhanced by inhomogeneous activity of teaching for evolutionary prisoner’s dilemma games. EPL (Europhysics Letters) 77: 30004.
  17. 17. Guan JY, Wu ZX, Wang YH (2007) Effects of inhomogeneous activity of players and noise on cooperation in spatial public goods games. Physical Review E 76: 056101.
  18. 18. Hamilton WD (1964) The genetical evolution of social behaviour. ii. Journal of theoretical biology 7: 17–52. pmid:5875340
  19. 19. Meloni S, Buscarino A, Fortuna L, Frasca M, Gómez-Gardeñes J, Latora V, et al. (2009) Effects of mobility in a population of prisoner’s dilemma players. Physical Review E 79: 067101.
  20. 20. Yang HX, Wu ZX, Wang BH (2010) Role of aspiration-induced migration in cooperation. Physical Review E 81: 065101.
  21. 21. Jiang LL, Wang WX, Lai YC, Wang BH (2010) Role of adaptive migration in promoting cooperation in spatial games. Physical Review E 81: 036108.
  22. 22. Santos FC, Santos MD, Pacheco JM (2008) Social diversity promotes the emergence of cooperation in public goods games. Nature 454: 213–216. pmid:18615084
  23. 23. Perc M, Szolnoki A (2008) Social diversity and promotion of cooperation in the spatial prisoner’s dilemma game. Physical Review E 77: 011904.
  24. 24. Szolnoki A, Perc M, Szabó G (2008) Diversity of reproduction rate supports cooperation in the prisoner’s dilemma game on complex networks. The European Physical Journal B-Condensed Matter and Complex Systems 61: 505–509.
  25. 25. Wang Z, Wang L, Yin ZY, Xia CY (2012) Inferring reputation promotes the evolution of cooperation in spatial social dilemma games. PLoS One 7: e40218. pmid:22808120
  26. 26. Wang WX, Ren J, Chen G, Wang BH (2006) Memory-based snowdrift game on networks. Physical Review E 74: 056113.
  27. 27. Wu ZX, Yang HX (2014) Social dilemma alleviated by sharing the gains with immediate neighbors. Physical Review E 89: 012109.
  28. 28. Brandt H, Hauert C, Sigmund K (2003) Punishment and reputation in spatial public goods games. Proceedings of the Royal Society of London Series B: Biological Sciences 270: 1099–1104. pmid:12803901
  29. 29. Perc M, Szolnoki A (2012) Self-organization of punishment in structured populations. New Journal of Physics 14: 043013.
  30. 30. Sekiguchi T, Nakamaru M (2009) Effect of the presence of empty sites on the evolution of cooperation by costly punishment in spatial games. Journal of theoretical biology 256: 297–304. pmid:18952110
  31. 31. Jiang LL, Perc M, Szolnoki A (2013) If cooperation is likely punish mildly: insights from economic experiments based on the snowdrift game. PLoS One 8: e64677. pmid:23741367
  32. 32. Wang Z, Szolnoki A, Perc M (2014) Rewarding evolutionary fitness with links between populations promotes cooperation. Journal of theoretical biology 349: 50–56. pmid:24508726
  33. 33. Szolnoki A, Perc M (2010) Reward and cooperation in the spatial public goods game. EPL (Europhysics Letters) 92: 38003.
  34. 34. Zukewich J, Kurella V, Doebeli M, Hauert C (2013) Consolidating birth-death and death-birth processes in structured populations. PLoS One 8: e54639. pmid:23382931
  35. 35. Taylor P (2010) Birth–death symmetry in the evolution of a social trait. Journal of evolutionary biology 23: 2569–2578. pmid:21040069
  36. 36. Wang XW, Wang Z, Nie S, Jiang LL, Wang BH (2015) Impact of keeping silence on spatial reciprocity in spatial games. Applied Mathematics and Computation 250: 848–853.
  37. 37. Wang WX, Lai YC, Armbruster D (2011) Cascading failures and the emergence of cooperation in evolutionary-game based models of social and economical networks. Chaos: An Interdisciplinary Journal of Nonlinear Science 21: 033112.
  38. 38. Challet D, Zhang YC (1997) Emergence of cooperation and organization in an evolutionary game. Physica A: Statistical Mechanics and its Applications 246: 407–418.
  39. 39. Challet D, Zhang YC (1998) On the minority game: Analytical and numerical studies. Physica A: Statistical Mechanics and its Applications 256: 514–532.
  40. 40. Johnson N F, Hui P M, Jonson R, Lo T S. (1999) Self-organized segregation within an evolving population. Physical Review Letters 82: 3360.