Abstract
Up to now, there have been a great number of mechanisms to explain the individual behavior and population traits, which seem of particular significance in evolutionary biology and social behavior analysis. Among them, small groups and heterogeneity are two useful frameworks to the above issue. However, vast majority of existing works separately consider both scenarios, which is inconsistent with realistic cases in our life. Here we propose the evolutionary games of heterogeneous small groups (namely, different small groups possess different preferences to dilemma) to study the collective behavior in population evacuation. Importantly, players usually face completely different dilemmas inside and outside the small groups. By means of numerous computation simulations, it is unveiled that the ratio of players in one certain small group directly decides the final behavior of the whole population. Moreover, it can also be concluded that heterogeneous degree of preference for different small groups plays a key role in the behavior traits of the system, which may validate some realistic social observations. The proposed framework is thus universally applicable and may shed new light into the solution of social dilemmas.
Introduction
In evolutionary biology and social science, a challenging problem is to understand the emergence of collective behavior traits and their sustenance under the pressure of a series of competing strategies [1–5]. To resolve the above issue, evolutionary game theory, which provides a useful framework, has been extensively investigated from theoretical and experimental viewpoints over the past decades [6–11]. In particular, the pairwise interaction game, as a simple metaphor of illustrating the social conflict between different behaviors, has attracted great interest [12, 13]. Typical examples include prisoner’s dilemma game [14–16], snowdrift game [14, 17], harmony game [18, 19] and ultimate game [20]. The former three mainly focus on the origin of cooperation, while the remaining latter gives attention to fairness. Under different scenarios, different payoff ranking will lead to various dilemmas. For example, in prisoner’s dilemma game, players are likely to choose the selfish defection behavior if they wish to maximize individual benefit, irrespective of the fact that mutual cooperation could yield a higher collective benefit [9, 12]. On the other hand, in the snowdrift game, it is worth to cooperate, whatever the opponent does, and thus the number of cooperator-defector pairs arises [6, 12].
To explain these observations, several mechanisms that support the evolution of collective behavior have been identified [11, 21–24], such as the tit-for-tat [25] or win-stay-lose-shift [26], spatially structured populations [10, 23, 27–30], punishment and reward [31], reputation [32], voluntary participation [33], heterogeneity [34, 35] and diversity [36–38], the mobility of agents [39, 40], scale of interaction network [41] and co-evolutionary rules [42]. While recently, Nowak attributed all these to five mechanisms: kin selection, direct reciprocity, indirect reciprocity, network reciprocity, and group selection [21], these mechanisms can be somewhat related to the reduction of an opposing player’s anonymity relative to the so-called well-mixed situation. After this seminal survey, more related scenarios have been intensively explored. In a recent research [7], where the partner selection of agents was closely related with individual reputation, it was found that collective cooperation behavior would be guaranteed to an extremely high level. In addition, the context of traditional network reciprocity [43] was further extended to the multilayer networks [13, 44, 45] (see [46] for a review).
Though the above mentioned achievements offer new insight into the issue of organization of collective behavior, the fundamental assumption that all individuals are homogenous and have the same properties seems inconsistent with realistic scenarios. While in the large-scale population evacuation, the population is typically composed of many small groups [47, 48]. Moreover, small groups are also ubiquitous in the vision-based investigation of pedestrian crowds [49]. Nevertheless, the behavioral evolution of small groups still remains largely unexplored. Currently, people mainly consider the behavioral evolution with two approaches. The first method based on the well-mixed population [6] aims to explain evolution of cooperative behavior by establishing the replicator equation with mean filed theory and evolutionary game theory [8–12]; while the second one (namely, agent-based method) [50] assumes the existence of a certain kind of spatial structure between the individuals and plans to study the behavioral evolution of the population [9, 23, 33, 36, 51]. In addition, the case of two heterogeneous groups has been explored [7, 24], but the interactions within and between small groups are partly considered. Furthermore, multiple heterogeneous small groups have been taken into consideration with the assumptions that the individuals belonging to different groups are well-mixed and all the interactions fall into the same dilemma [50]. Inspired by these achievements, an interesting question naturally poses itself, which we plan to address in what follows. If heterogeneity between small groups is incorporated into the behavioral evolution of evacuation scenarios, how do players choose their behavior?
In the present work, we consider the evolutionary games located in the population composed of two small groups. Within and between small groups, there exist different preferences among players. Then, we introduce characters of small groups in evacuation into simulation and aim to explore the regularity of behavioral evolution of small groups with heterogeneous preferences in population evacuation, by means of agent-based method in accordance with the game theoretical models built.
Methods
Throughout this work, population is distributed on a L×L square lattice with periodic boundary conditions [52, 53]. Each player is initially designated as one of two behaviors: behavior 1 and behavior 2. Besides, since we consider the impact of small groups, the population is divided into small group 1 with probability f and small group 2 with the remaining probability 1-f, respectively. In particular, once two small groups are assigned, their ratios (f and 1-f) keep constant during the whole evolution process (namely, one player always belongs to the identical small group during the whole process).
With regard to evolutionary games, (since heterogeneity between small groups is taken into account,) we assume that there exist different dilemmas within and between small groups, which means that games are different within and between small groups. Along this line, there are three kinds of games, and the corresponding payoff matrices are , and , respectively. According to the principle of equivalent simplification of game theory [6, 9, 24], let Bi = S i–P i Bi+2 = S i–P i, C i = r i–t i, C i+2 = R i–T i(i = 1,2) and then the payoff matrices can be translated into the form of Tables 1–3, respectively. In order to reflect heterogeneous preferences of different small groups, it is assumed that the k th small group prefers behavior k (namely, players in small group 1 prefer behavior 1, and players in small group 2 are opt to behavior 2).
Table 1. The Payoff Matrix of the Interactions in Small Group 1(Simplified Form).
| Behavior 1 | Behavior 2 | |
|---|---|---|
| Behavior 1 | (C 1,C 1) | (B 1,0) |
| Behavior 2 | (0,B 1) | (0,0) |
Table 3. The Payoff Matrix of the Interactions in Small Group 2(Simplified Form).
| Behavior 1 | Behavior 2 | |
|---|---|---|
| Behavior 1 | (0,0) | (0,B 2) |
| Behavior 2 | (B 2,0) | (C 2,C 2) |
For each small group, there exists only one type of game, which but falls into different dilemmas based on different payoff ranking. Take Table 1 as example, the game will be prisoner’s dilemma game, harmony game, snowdrift game and stag hunt game if the payoffs satisfy B 1<0,C 1<0, B 1>0,C 1>0, B 1>0,C 1<0, and B 1<0,C 1>0 respectively. Accordingly, the equilibria of the four games are all defection, all cooperation, coexistence of defection and cooperation and all defection or all cooperation (relying on the initial condition), respectively.
When the game types are identical within small groups 1 and 2, such as two harmony games in Tables 1 and 3, some discussions can be provided as follows. If C 1 = B 1 = 0.1 and C 2 = B 2 = 10 the payoffs for Nash Equilibria of the two small groups are (0.1,0.1) and (10,10), respectively. Compared to small group 1, the players of small group 2 will suffer a great loss once deviating from the Nash Equilibrium. Therefore, the players of small group 2 are more reluctant to deviate from the strategy of Nash Equilibrium, which indicates that the payoff parameters of the games have significant influence on the cohesion of small groups, and then directly affect the behavioral evolution of the whole population. So are the other dilemmas. Hence, we define a key parameter: relative degree of preference for small group 1 (RDP for small group 1 in short), which depends on Nash Equilibria of games and will be represented by symbol q in this paper. If the Nash Equilibrium sets of Tables 1 to 3 are supposed to be , , respectively, then it can be defined as
| (1) |
Notably, the magnitude of q reflects the cohesion of small group 1 relative to small group 2. If q>1, it implies that the cohesion of small group 1 is greater than that of small group 2; otherwise the better is for small group 2.
After the definition of payoff details, the game is iterated forward in accordance with the sequential simulation procedure comprising the following elementary steps. First, each player gets its payoff by playing the games with its four immediate neighbors, irrespective of same or different small groups. Then, every player will update its strategy by adopting the strategy of neighbor who possesses the highest total payoff in the present round. We use the synchronous updating so that each player updates its strategy simultaneously.
Results
In this section, we first set the parameters of the game models according to the scenarios of crowd evacuation, and then simulate behavioral evolution of small groups by varying two key parameters: f and q.
The individuals in the same small group have the identical preference, but some players sometimes may deviate from the preferred behavior. This character is in line with harmony game, so the dilemma within the same small group is featured as harmony game. Namely, game types of Tables 1 and 3 are harmony game, and accordingly the parameters of the games satisfy Ci,Bi>0(i = 1,2). In the process of emergency evacuation, there also exists the interaction between different small groups, although whose preference is different. The aim of each player in the interaction is very clear, which resembles the scenario of snowdrift game. Thus it is assumed that the interaction between two small groups mimics the snowdrift game, that is, the payoff parameters of Table 2 satisfy C i>0,B i<0(i = 3,4). Since the game parameters are confined to certain ranges stated above, it can be derived straightforwardly that
| (2) |
according to Equation (1).
Table 2. The Payoff Matrix of the Interactions between Small Groups 1 and 2(Simplified Form).
| Behavior 1 | Behavior 2 | |
|---|---|---|
| Behavior 1 | (C 3,0) | (B 3,B 4) |
| Behavior 2 | (0,0) | (0,C 4) |
Results of computer simulations presented below are obtained on populations comprising L = 100 (We have verified our results for different sizes L = 200,400, and the main results are robust to the size L). The results of system is averaged on 500 steps after the fluctuation is smaller than 0.01 with 500 continuous steps. Moreover, since the heterogeneous preferences may introduce additional disturbances, final results are averaged over up to 10 independent runs for each set of parameter values in order to assure suitable accuracy.
The Impact of Fraction of Small Group 1 on Evolution
At first, the impact of the fraction of small group 1, namely f, on behavioral evolution of population is explored with fixed . Fig. 1 shows how the ratio of behavior 1 in population changes over time for different values of f. As there is no randomness, the collective behavior reaches the stabile state at even about the 50th step. It is clear that with the increment of f, proportion of behavior 1 in population monotonously increases. For a small value, the system fast declines to disappearance of behavior 1. However, when f is sufficiently large, behavior 1 is will completely dominate the system.
Fig 1. Fraction of behavior 1 in population which changes over time when the game parameters are constant.
In the figure, the five curves correspond to five different fractions of small group 1, namely 0.1, 0.3, 0.5, 0.7, 0.9. The used payoff parameters are [B 1, B 2, B 3, B 4, C 1, C 2, C 3, C 4] = [2, 2, –1, –1, 1, 1, 2, 2].
In order to provide a visual validation of the observations, we show the snapshots of the behavioral evolution at t = 1, 3, 100 and 500 MC steps (see Fig. 2), in which f and q are 0.1 and 1, respectively. At the beginning of the evolution, small group 2 accounts for the great majority of the whole population, while fractions of behavior 1 in both small groups are equal to 0.5. As time evolves, when the evolution is stable, in both small groups the individuals choosing behavior 2 dominate and the remaining ones in minority who adopt behavior 1 are aggregating in clusters. Therefore, it can be concluded that as the fraction of small group 2 is greater than that of small group 1, the behavior which small group 2 prefers is more easily spread in the population and becomes the normative behavior of the population ultimately.
Fig 2. Direct observations of behavioral evolution for the whole population when f = 0.1 and q = 1.
Snapshots are taken at t = 1, 3, 100 and 500 MC steps. In the figure blue, yellow, green and red are used to represent behavior 1 in group 1, behavior 2 in group 1, behavior 1 in group 2 and behavior 2 in group 2 respectively. The game parameters in the numerical simulation are set as [B 1, B 2, B 3, B 4, C 1, C 2, C 3, C 4] = [2, 2, –1, –1, 1, 1, 2, 2].
In order to study regularity of the impact of fraction of small group 1 on the fraction of behavior 1 in the population and discuss the robustness of this regularity, we set q equal to 1 and choose 6 groups of game parameters, and the results of the simulations are depicted in Fig. 3. The six curves illustrate that with f increasing, the fraction of behavior 1 in the population after behavioral evolution will also increase. In detail, if f is smaller than 0.25, fraction of behavior 1 in the population will be smaller than 0.2, so in this case the majority of the population show the normative behavior preferred by small group 2 ultimately. Likewise, it is recognized that the population prevailingly exhibit the behavior preferred by small group 1 if f is larger than 0.75. The regularity is similar for different game parameters, so the relationship between fraction of behavior 1 in population and f is robust for different game parameters (q is supposed to be constant).
Fig 3. Relationship between the fraction of behavior 1 in population and the fraction of small group 1.
The curves in the figure are with the same q (equal to 1), but the game parameters are not the same. For parameter group 1, [B 1, B 2, B 3, B 4, C 1, C 2, C 3, C 4] = [2, 2, –1, –1, 1, 1, 2, 2]. For parameter group 2, [B 1, B 2, B 3, B 4, C 1, C 2, C 3, C 4] = [1, 1, –1, –1, 1, 1, 2, 2]. For parameter group 3, [B 1, B 2, B 3, B 4, C 1, C 2, C 3, C 4] = [2, 2, –2, –2, 1, 1, 2, 2]. For parameter group 4, [B 1, B 2, B 3, B 4, C 1, C 2, C 3, C 4] = [1, 1, –2, –2, 1, 1, 2, 2]. For parameter group 5, [B 1, B 2, B 3, B 4, C 1, C 2, C 3, C 4] = [2, 2, –1, –1, 2, 2, 2, 2]. For parameter group 6, [B 1, B 2, B 3, B 4, C 1, C 2, C 3, C 4] = [2, 2, –1, –1, 1, 1, 3, 3].
To sum up, fraction of small group 1 has an important impact on the behavioral evolution of the population and the impacting curve is monotonically increasing. When q is close to 1, it is easier for the larger small group to establish the behavior it prefers as the normative behavior. In addition, this regularity is robust for different parameters.
The Impact of RDP for Small Group 1 on Evolution
Next, we inspect how RDP for small group 1 impacts behavioral evolution when fraction of small group 1 is fixed. Fig. 4 shows time courses of behavior 1 in the population corresponding to different values of q. Similar to Fig. 1, the curves will reach the stable state at about the 50th step. Importantly, as qincreases, the fraction of behavior 1 in population will also increase.
Fig 4. Fraction of behavior 1 in population which changes over time, when the fraction of small group 1 is fixed.
In this figure, the five curves correspond to five different values of q. In detail, in the simulations f = 0.5, and the game parameters are selected as [B 1, B 2, B 3, B 4, C 1, C 3] = [2, 2, –1, –1, 1, 2], C 2 = C 1/q, C 4 = C 3/q and values of q are chosen as 1/9, 1/3, 1, 3, 9, respectively.
In order to feature the observations in more details, we have taken snapshots of the evolution at t = 1, 3, 100 and 500 MC steps (see Fig. 5), in which f and q are set as 0.5 and 9 respectively. At the beginning of the evolution, the four types of agents are equally distributed on the lattice. As time evolves, when the behavioral evolution of the two small groups is stable, the individuals with behavior 1 account for the great majority in both small groups, although there are a few agents adopting behavior 2 and they are gathering in clusters. Therefore, when fractions of two small groups are close and RDP for small group 1 is larger than 1, it can be concluded that small group 1 will win in establishing the behavioral norm due to stronger cohesion although there is no advantage in scale for small group 1. In other words, the behavior small group 1 prefers is more easily spread in the population and will become the normative behavior of the population ultimately.
Fig 5. Direct observations of behavioral evolution for the whole population when the values of f and q are 0.5 and 9 respectively.
Snapshots are taken at t = 1, 3, 100 and 500 MC steps. The meanings of the four colors are the same with Fig. 2. Specifically, the payoff values are set as [B 1, B 2, B 3, B 4, C 1, C 2, C 3, C 4] = [2, 2, -1, -1, 1, 1/9, 2, 2/9] in the numerical simulation.
Aiming to investigate the impact of qon behavioral evolution and discuss the law of evolution for different values of f we have scanned a wide range of parameters and the simulation results are depicted in Fig. 6. As can be seen, when f is fixed, the fraction of behavior 1 in the population after behavioral evolution comes to an end is positively correlative to q, and q has the greatest influence on the result of evolution when it lies between 0.1 and 10. Beyond this scope, in particular when qis smaller than 0.01 or larger than 100, its impact can be neglected and behavioral evolution of population in this case mainly depends on f.
Fig 6. Relationship between the fraction of behavior 1 in population and RDP for small group 1.
In the numerical simulations corresponding to the figure, the payoff parameters adopted are specified as [B 1, B 2, B 3, B 4, C 1, C 3] = [2, 2, –1, –1, 1, 2], C 2 = C 1/q, C 4 = C 3/q.
To sum up, RDP for small group 1 has an important impact on the behavioral evolution of the population. It imposes its influence by the relative cohesion of small group 1. Through the study on the impact of qon behavioral evolution for small groups 1 and 2 when f is selected from a series of fixed values, it can be claimed that when qis in a center range, its influence is very remarkable, whereas when it is out of the range, the behavioral evolution of the population mainly relies on f.
Finally, in order to understand the relationship between the result of behavioral evolution and f as well as q, we have carefully skimmed a wide range of values for them. The results are demonstrated in Fig. 7. It can be seen from Fig. 7 that the stratification phenomenon is very clear, so it can be concluded that the two quantities have important impacts on the behavioral evolution of the population. When f and q are relatively large, the behavior small group 1 prefers will become the normative behavior of the population; likewise, when the two values are small, small group 2 will establish the behavioral norm.
Fig 7. Relationship between the fraction of behavior 1 in the population and two variables, namely, f and q.
The game parameters used in this figure are the same with those in Fig. 6.
Conclusions
To conclude, the evolutionary games in small groups with heterogeneous preferences have been considered. Within and between small groups, there will be different dilemmas. Based on a great number of computation simulations, it can be concluded that the final behavior of the whole population is closely related with the ratio of players in one certain small group directly. Moreover, it is shown that heterogeneous degree of preference for different small groups also directly determines the behavior traits of the system, which may shed new light into the realistic social observations. We hope that our proposed framework can bring more effective solutions to social dilemmas.
Supporting Information
(XLSX)
(XLSX)
(XLSX)
(XLSX)
(XLSX)
(XLSX)
(XLSX)
Acknowledgments
We thank Dr. Yuan Cheng for constructive discussions and technique support in the work.
Data Availability
All relevant data are within the paper and its Supporting Information files.
Funding Statement
This work was financially supported in part by the 973 Program under Grant 2011CB706900, and by the National Natural Science Foundation of China under Grants 71225007. The funders had no role in study design, data collection and analysis, decision to publish, or preparation of the manuscript.
References
- 1. Perc M, Grigolini P. Collective behavior and evolutionary games–An introduction. Chaos, Solitons & Fractals. 2013;56:1—5. [Google Scholar]
- 2. Smelser NJ. Theory of Collective Behavior: Quid Pro Books; 2011. [Google Scholar]
- 3. Chazelle B. An Algorithmic Approach to Collective Behavior. Journal of Statistical Physics. 2014:1–35. [Google Scholar]
- 4. Pennisi E. How did cooperative behavior evolve? Science. 2005;309(5731):93-. [DOI] [PubMed] [Google Scholar]
- 5. Axelrod R, Hamilton WD. The evolution of cooperation. Science. 1981;211(4489):1390–6. [DOI] [PubMed] [Google Scholar]
- 6. Weibull JW. Evolutionary game theory: MIT press; 1997. [Google Scholar]
- 7. Hofbauer J, Sigmund K. Evolutionary games and population dynamics: Cambridge University Press; 1998. [Google Scholar]
- 8. Nowak MA. Evolutionary Dynamics: Exploring the Equations of Life. 2006. Harvard University Press. [Google Scholar]
- 9. Smith JM. Evolution and the Theory of Games: Cambridge university press; 1982. [Google Scholar]
- 10. Roca CP, Cuesta JA, Sánchez A. Evolutionary game theory: Temporal and spatial effects beyond replicator dynamics. Physics of Life Reviews. 2009;6(4):208–49. 10.1016/j.plrev.2009.08.001 [DOI] [PubMed] [Google Scholar]
- 11. Szabó G, Fath G. Evolutionary games on graphs. Physics Reports. 2007;446(4):97–216. [Google Scholar]
- 12. Perc M, Szolnoki A. Coevolutionary games—a mini review. BioSystems. 2010;99(2):109–25. 10.1016/j.biosystems.2009.10.003 [DOI] [PubMed] [Google Scholar]
- 13. Wang Z, Szolnoki A, Perc M. Interdependent network reciprocity in evolutionary games. Scientific reports. 2013;3. [DOI] [PMC free article] [PubMed] [Google Scholar]
- 14. Doebeli M, Hauert C. Models of cooperation based on the Prisoner's Dilemma and the Snowdrift game. Ecology Letters. 2005;8(7):748–66. [Google Scholar]
- 15. Poundstone W. Prisoner's Dilemma: John von Neuman, Game Theory, and the Puzzle of the Bomb. Doubleday, New York; 1992. [Google Scholar]
- 16. Poncela J, Gómez-Gardeñes J, Moreno Y, Floría LM. Cooperation in the Prisoner's Dilemma game in random scale-free graphs. International Journal of Bifurcation and Chaos. 2010;20(03):849–57. [Google Scholar]
- 17. Sysi-Aho M, Saramäki J, Kertész J, Kaski K. Spatial snowdrift game with myopic agents. The European Physical Journal B-Condensed Matter and Complex Systems. 2005;44(1):129–35. [Google Scholar]
- 18. Paternotte C, Grose J. Social Norms and Game Theory: Harmony or Discord? The British Journal for the Philosophy of Science. 2012:axs024. [Google Scholar]
- 19. Zheng X, Cheng Y. Modeling cooperative and competitive behaviors in emergency evacuation: A game-theoretical approach. Computers & Mathematics with Applications. 2011;62(12):4627–34. [Google Scholar]
- 20. Rand DG, Tarnita CE, Ohtsuki H, Nowak MA. Evolution of fairness in the one-shot anonymous Ultimatum Game. Proceedings of the National Academy of Sciences. 2013;110(7):2581–6. 10.1073/pnas.1214167110 [DOI] [PMC free article] [PubMed] [Google Scholar]
- 21. Nowak MA. Five rules for the evolution of cooperation. science. 2006;314(5805):1560–3. [DOI] [PMC free article] [PubMed] [Google Scholar]
- 22. Ohtsuki H, Iwasa Y, Nowak MA. Indirect reciprocity provides only a narrow margin of efficiency for costly punishment. Nature. 2009;457(7225):79–82. 10.1038/nature07601 [DOI] [PMC free article] [PubMed] [Google Scholar]
- 23. Santos FC, Pacheco JM. Scale-free networks provide a unifying framework for the emergence of cooperation. Physical Review Letters. 2005;95(9):098104 [DOI] [PubMed] [Google Scholar]
- 24. Helbing D, Johansson A. Cooperation, norms, and revolutions: a unified game-theoretical approach. PloS one. 2010;5(10):e12530 10.1371/journal.pone.0012530 [DOI] [PMC free article] [PubMed] [Google Scholar]
- 25. Nowak MA, Sigmund K. Tit for tat in heterogeneous populations. Nature. 1992;355(6357):250–3. 1731220 [Google Scholar]
- 26. Nowak M, Sigmund K. A strategy of win-stay, lose-shift that outperforms tit-for-tat in the Prisoner's Dilemma game. Nature. 1993;364(6432):56–8. [DOI] [PubMed] [Google Scholar]
- 27. Nowak MA, May RM. Evolutionary games and spatial chaos. Nature. 1992;359(6398):826–9. [Google Scholar]
- 28. Roca CP, Cuesta JA, Sánchez A. Effect of spatial structure on the evolution of cooperation. Physical Review E. 2009;80(4):046106. [DOI] [PubMed] [Google Scholar]
- 29. Wang Z, Kokubo S, Tanimoto J, Fukuda E, Shigaki K. Insight into the so-called spatial reciprocity. Physical Review E. 2013;88(4):042145 [DOI] [PubMed] [Google Scholar]
- 30. Perc M, Gómez-Gardeñes J, Szolnoki A, Floría LM, Moreno Y. Evolutionary dynamics of group interactions on structured populations: a review. Journal of The Royal Society Interface. 2013;10(80):20120997 10.1098/rsif.2012.0997 [DOI] [PMC free article] [PubMed] [Google Scholar]
- 31. Wang Z, Xia C-Y, Meloni S, Zhou C-S, Moreno Y. Impact of social punishment on cooperative behavior in complex networks. Scientific reports. 2013;3. [DOI] [PMC free article] [PubMed] [Google Scholar]
- 32. Fu F, Hauert C, Nowak MA, Wang L. Reputation-based partner choice promotes cooperation in social networks. Physical Review E. 2008;78(2):026117. [DOI] [PMC free article] [PubMed] [Google Scholar]
- 33. Szabó G, Hauert C. Phase transitions and volunteering in spatial public goods games. Physical Review Letters. 2002;89(11):118101 [DOI] [PubMed] [Google Scholar]
- 34. Yuan W-J, Xia C-Y. Role of Investment Heterogeneity in the Cooperation on Spatial Public Goods Game. PloS one. 2014;9(3):e91012 10.1371/journal.pone.0091012 [DOI] [PMC free article] [PubMed] [Google Scholar]
- 35. Ma Z-Q, Xia C-Y, Sun S-W, Wang L, Wang H-B, Wang J. Heterogeneous link weight promotes the cooperation in spatial prisoner's dilemma. International Journal of Modern Physics C. 2011;22(11):1257–68. [Google Scholar]
- 36. Perc M, Wang Z. Heterogeneous aspirations promote cooperation in the prisoner's dilemma game. PLoS One. 2010;5(12):e15117 10.1371/journal.pone.0015117 [DOI] [PMC free article] [PubMed] [Google Scholar]
- 37. Chadefaux T, Helbing D. How wealth accumulation can promote cooperation. PloS one. 2010;5(10):e13471 10.1371/journal.pone.0013471 [DOI] [PMC free article] [PubMed] [Google Scholar]
- 38. Zhang G-Q, Sun Q-B, Wang L. Noise-induced enhancement of network reciprocity in social dilemmas. Chaos, Solitons & Fractals. 2013;51:31–5. [Google Scholar]
- 39. Helbing D, Yu W. Migration as a mechanism to promote cooperation. Advances in Complex Systems. 2008;11(04):641–52. [Google Scholar]
- 40. Meloni S, Buscarino A, Fortuna L, Frasca M, Gómez-Gardeñes J, Latora V, et al. Effects of mobility in a population of prisoner’s dilemma players. Physical Review E. 2009;79(6):067101 [DOI] [PubMed] [Google Scholar]
- 41. Wang J, Xia C, Wang Y, Ding S, Sun J. Spatial prisoner’s dilemma games with increasing size of the interaction neighborhood on regular lattices. Chinese Science Bulletin. 2012;57(7):724–8. [Google Scholar]
- 42. Szolnoki A, Perc M. Reward and cooperation in the spatial public goods game. EPL (Europhysics Letters). 2010;92(3):38003. [Google Scholar]
- 43. Xia C, Miao Q, Zhang J. Impact of neighborhood separation on the spatial reciprocity in the prisoner’s dilemma game. Chaos, Solitons & Fractals. 2013;51:22–30. [Google Scholar]
- 44. De Domenico M, Solé-Ribalta A, Cozzo E, Kivelä M, Moreno Y, Porter MA, et al. Mathematical formulation of multilayer networks. Physical Review X. 2013;3(4):041022. [Google Scholar]
- 45. Jin Q, Wang L, Xia C-Y, Wang Z. Spontaneous symmetry breaking in interdependent networked game. Scientific reports. 2014;4. [DOI] [PMC free article] [PubMed] [Google Scholar]
- 46. Boccaletti S, Bianconi G, Criado R, Del Genio C, Gómez-Gardeñes J, Romance M, et al. The structure and dynamics of multilayer networks. Physics Reports. 2014;544(1):1–122. [DOI] [PMC free article] [PubMed] [Google Scholar]
- 47. Johnson NR. Panic at "The Who concert stampede": An empirical assessment. Social Problems. 1987:362–73. [Google Scholar]
- 48. Aveni AF. The not-so-lonely crowd: Friendship groups in collective behavior. Sociometry. 1977:96–9. [Google Scholar]
- 49. Ge W, Collins RT, Ruback RB. Vision-based analysis of small groups in pedestrian crowds. Pattern Analysis and Machine Intelligence, IEEE Transactions on. 2012;34(5):1003–16. [DOI] [PubMed] [Google Scholar]
- 50. Bonabeau E. Agent-based modeling: Methods and techniques for simulating human systems. Proceedings of the National Academy of Sciences of the United States of America. 2002;99(Suppl 3):7280–7. [DOI] [PMC free article] [PubMed] [Google Scholar]
- 51. Abramson G, Kuperman M. Social games in a social network. Physical Review E. 2001;63(3):030901 [DOI] [PubMed] [Google Scholar]
- 52. Macal CM, North MJ. Tutorial on agent-based modelling and simulation. Journal of Simulation. 2010;4(3):151–62. [Google Scholar]
- 53. Uguz S, Akin H, Siap I. Reversibility algorithms for 3-state hexagonal cellular automata with periodic boundaries. International Journal of Bifurcation and Chaos. 2013;23(06). [Google Scholar]
Associated Data
This section collects any data citations, data availability statements, or supplementary materials included in this article.
Supplementary Materials
(XLSX)
(XLSX)
(XLSX)
(XLSX)
(XLSX)
(XLSX)
(XLSX)
Data Availability Statement
All relevant data are within the paper and its Supporting Information files.







