• Nem Talált Eredményt

Social dilemmas in off-lattice populations B.F. de Oliveira

N/A
N/A
Protected

Academic year: 2022

Ossza meg "Social dilemmas in off-lattice populations B.F. de Oliveira"

Copied!
8
0
0

Teljes szövegt

(1)

Social dilemmas in off-lattice populations

B.F. de Oliveiraa, A. Szolnokib

aDepartamento de F´ısica, Universidade Estadual de Maring´a, 87020-900 Maring´a, PR, Brazil

bInstitute of Technical Physics and Materials Science, Centre for Energy Research, P.O. Box 49, H-1525 Budapest, Hungary

Abstract

Exploring the possible consequences of spatial reciprocity on the evolution of cooperation is an intensively studied research avenue. Related works assumed a certain interaction graph of competing players and studied how particular topologies may influence the dynamical behavior. In this paper we apply a numerically more demanding off-lattice population approach which could be potentially relevant especially in microbiological environments. As expected, results are conceptually similar to those which were obtained for lattice-type interaction graphs, but some spectacular differences can also be revealed. On one hand, in off-lattice populations spatial reciprocity may work more efficiently than for a lattice-based system. On the other hand, competing strategies may separate from each other in the continuous space concept, which gives a chance for cooperators to survive even at relatively high temptation values. Furthermore, the lack of strict neighborhood results in soft borders between competing patches which jeopardizes the long term stability of homogeneous domains. We survey the major social dilemma games based on pair interactions of players and reveal all analogies and differences compared to on-lattice simulations.

1. INTRODUCTION

In a multi-agent system the assumption when ev- ery member interacts with all others randomly can be handled analytically, hence it could always be a starting point to study the evolution of coopera- tion among self-interest players [1, 2, 3, 4, 5]. The absence of stable connections, however, is a highly simplified working hypothesis because in almost ev- ery real-life examples individuals have fixed, or at least temporarily stable neighbors [6, 7]. This ob- servation can be modeled by assuming an interac- tion graph where players have limited and stable partners, which fact determines their potential fit- ness and the dynamical process in the applied topol- ogy [8, 9, 10]. As expected, this modification may change the system behavior significantly which was confirmed by thousands of research papers in the last two decades [11, 12, 13, 14, 15, 16, 17, 18, 19].

Notably, the graph approach does not always re- flect faithfully the interactions of individuals. For instance, in a microbial environment an off-lattice approach seems to be more appropriate modeling technique, where individuals still interact with a limited number of partners, but their actual dis- tance, which may change continuously, determines

the interaction strength [20, 21, 22]. In the last years several experimental works have been pub- lished where an off-lattice model seems to be a more realistic assumption [23, 24, 25].

We must stress, however, that off-lattice simula- tions are more demanding technically and requires significantly larger numerical efforts comparing to on-lattice or in more general graph-based simula- tions. Therefore it is not surprising that previous works were restricted to the latter case exclusively [26, 27, 28, 29, 30, 31, 32, 33]. In our present work we focus on off-lattice simulations and explore their specific characters. Importantly, we use the origi- nal social dilemma games to identify the similarities and potential differences between on- and off-lattice environments and only change the dynamical rules which can be applied for off-lattice simulations di- rectly. We will show that the behavior of systems in off-lattice environment is conceptually similar to those observed for models of lattice-type interac- tion graphs. There are, however, some differences which warn us to treat the conclusions of lattice- based models with a special care when we want to adopt them directly to microbiological or related systems.

In the following we specify the model and the mi-

(2)

extended to the related social dilemmas including snow-drift and stag-hunt games. Finally we con- clude with the summary of the results and a dis- cussion of their implications in the last section.

2. MODELING DILEMMAS IN OFF- LATTICE ENVIRONMENT

As we emphasized, we consider the traditional social dilemma games where players interact with their partners and collect payoff elements from ev- ery specific pair interaction [34]. A player’s state can be described as a cooperator or defector. When two cooperator players meet then both of them ob- tain a payoff value 1, while the meeting of defectors yields zero payoff value for each participant. The interaction of a cooperator and a defector players provides a valueT (temptation) for the latter and Svalue (sucker’s payoff) for the former strategy. In this way, the actual values ofT−S pair determine the character of the social dilemma. By keeping the traditional parametrization we use T > 1 control parameter and S = 0 fixed to describe the (weak) prisoner’s dilemma game. Furthermore, a parame- ter 0≤r≤1 when T = 1 +randS= 1−rserves as a control parameter to span the snow-drift game region of theT−Sparameter plane. Last, the stag- hunt game region is covered by the same 0≤r≤1 control parameter whenS=−randT =r[35].

In an off-lattice environment N players are dis- tributed randomly on a square-shaped box of linear size L= 1. As usual for spatial populations, peri- odic boundary conditions are applied. For everyk player the horizontalxk and verticalykcoordinates are continuous variables. A playerk and a player minteract if they are within the interaction range, namely their distance is less than li. Note that to calculate the proper distance we consider the men- tioned periodic boundary conditions.

To introduce an evolutionary dynamics we as- sume that a player’s strategy may change according to the broadly applied pairwise comparison imita- tion dynamics [36]. More precisely, a player kwill change its strategy to the opposite strategy repre- sented by a neighboring playermwith a probability wthat depends on the difference of the Πkand Πm

payoff values collected by the mentioned players:

w= 1

1 + exp[(Πk−Πm)/K] .

the change deterministic for positive difference and forbidden in the reversed case, while largeK limit provides a random strategy change independently of the actual payoff values of players.

It is important to stress that in an off-lattice sim- ulation we cannot follow precisely the usual way of strategy adoption applied in graph-based sim- ulations. In particular, we cannot simply replace the strategy of the target player with the new one and leave its position unchanged because this would make the evolutionary outcome highly sensitive on the initial spatial distribution of players. Instead, we remove the player who wants to change its strat- egy and add a newborn player with the new strat- egy somewhere randomly within an lb distance of the model player. This modification is similar to the so-called death-birth dynamics, but still keeps the essence of pairwise comparison and makes pos- sible the match with graph-based simulations [37].

In the default caselb is chosen to be equal to li, but we also discuss smaller and larger ranges when adding a newborn player to replace the old one.

As we will show the former option has no, while the latter change does have relevant consequence on the results. In general, it is important to em- phasize that the evolutionary outcome could be sig- nificantly different even if we use the same param- eter values of the model. For instance the system may be trapped into a homogeneous full defector state, but we may also observe a coexistence phase by using another seed value of our random number generator. Therefore to obtain a reliable observa- tion about the system behavior it is vital to average the results of individual runs. At every parameter values we distributed the competing strategies and the positions ofN players randomly and monitored how the fractions of strategies change in time. After we repeated every simulation 1000 times to obtain the requested accuracy of averaged value.

3. RESULTS

First we summarize our observations obtained for prisoner’s dilemma game and after we briefly out- line the results of other dilemma games. But be- fore jumping deep into the prisoner’s dilemma case we first present the results obtained for different lengths of the interaction range. This helps us to get impressions and evaluate properly the charac- teristic length scale of the li parameter. Figure 1

(3)

0 0.2 0.4 0.6 0.8 1

0.98 1 1.02 1.04 1.06

N= 5000 K= 0.1 ρC

T

li=lb= 0.05 li=lb= 0.50 li=lb= 0.80

Figure 1: Cooperation level in dependence of temptationT for prisoner’s dilemma. The applied characteristic length values are indicated for each curves. Ifli =lb0.8 then we practically get back the behavior of a well-mixed system.

Curves are just to guide to the eye.

shows the cooperation level in dependence tempta- tion value for different characteristic length scales.

Here we used the default model where the inter- action (li) and reproduction (lb) ranges are equal, while the consequences of unequal scales will be dis- cussed later. Our first observation is the critical temptation level where cooperators dies out is very similar to those values we observed for simulations on lattice-type interaction graphs [38]. There is, however, a conceptual difference from the systems simulated on lattices. As our present plot shows, cooperators become fully dominant as we approach T = 1 temptation value, which is missing in a lattice-type environment. For example on square lattice cooperators control only the two thirds of the whole population even atT = 1 because the strict degree number rule of nodes allows defectors to co- exist with cooperators [39]. But in our off-lattice environment there is no such artificial constraint and the advantage of spatial reciprocity enjoyed by cooperator strategy manifests entirely. Our plot also warns us that by choosing too large character- istic length scale the system behavior becomes prac- tically identical to the one observed for well-mixed population. In particular, ifli =lb ≥0.8 then off- lattice simulations reproduce the mixed, unstruc- tured results. But if we keep the mentioned values low then off-lattice simulations reveal the behavior of structured populations.

Our second plot shown in Fig. 2 summarizes how the total number of inhabitants modify the system behavior. When the population is rare then the co- operation level is significantly higher compared to the cases when we increase the average number of players. For example the critical threshold value of temptation is aboutT = 1.03 forN = 7500, while

0 0.2 0.4 0.6 0.8 1

0.98 1 1.02 1.04 1.06 1.08 1.1 1.12 li=lb= 0.05

K= 0.1 ρC

T

N= 2500 N= 5000 N= 7500

Figure 2: Cooperation level as a function of temptation value for different density of players. The total number of inhab- itants are marked in the legend. Rare population provides better chance for cooperation strategy.

the same temptation value provides a cooperator dominance for the N = 2500 case. We should em- phasize that the improvement of cooperation level is conceptually different from the one observed on lattice simulations where there was an optimal in- termediate concentration of players which ensured the highest cooperation level [40, 41, 42]. While the lastly mentioned phenomenon was strongly related to the percolation threshold of the specific lattice structure, it has a different explanation in off-lattice environment.

But before discussing its origin, let us compare the time evolutions of cooperation level for an off- lattice and a square-lattice environment. Impor- tantly, all other parameters, including the tempta- tion value, the noise level, the number of players are identical to both cases. Figure 3 demonstrates clearly that there is a strong fluctuation in off- lattice environment compared to lattice-based sim- ulations and the system travels between the full co-

0 0.2 0.4 0.6 0.8 1

0 500 1000 1500 2000

ρC

t

off-lattice on-lattice

Figure 3: Time evolution of cooperation level obtained for off-lattice and on square lattice simulations where all other parameters, including temptation value, noise, and to- tal number of inhabitants are equal. In particular, T = 1.015, K= 0.1, N= 5000. It is salient that the fluctuations for off-lattice population are significantly larger than in case of on-lattice population.

(4)

Figure 4: Spatial distribution of players in a coexistence phase. In both panels defectors are marked by red while cooperators are denoted by blue color. In a rare population, shown in panel (a), strategies can be separated easily result- ing in a frozen final state. This phenomenon makes possible for cooperators to survive even at a relatively high tempta- tion value, as shown in Fig. 2. When the average density of population is high, illustrated in panel (b), then compet- ing strategies maintain a dynamical equilibrium. The latter state is common in on-lattice populations. Parameters are N= 2500, b= 1.03 for panel (a), andN= 7500, b= 1.01 for panel (b). In both casesli=lb= 0.05 were applied.

operator and full defector states permanently. The described phenomenon can be monitored in the at- tached video where the color of population changes almost periodically [43]. This animation also helps us to understand the origin of this heavy oscilla- tion. Importantly, the borders separating homoge- neous domains are not as sharp as for graph-based simulations. This soft intermediate zone allows de- fectors to crack the phalanx of cooperators which would be robust and steady in a lattice population.

As a result, homogeneous blue patches of cooper- ators diminish eventually giving room for red de- fector players. A homogeneous red patch, however, becomes vulnerable, too, because in the absence of cooperators defectors cannot exploit their neighbors and they are unable to collect competitive payoff.

The above mentioned separating zone becomes empty for smallN values which has a crucial conse- quence especially for higher temptation value. Here a homogeneous island may become isolated from the rest of the population, hence resulting in a co- existence of competing strategies. In this frozen state cooperators can survive even if the relatively high temptation value would dictate a full defector state on a lattice.

The two types of coexistence are illustrated in Fig. 4. In panel (a) we have plotted the above men- tioned frozen state which can be observed for small N and high T values. Technically the competing strategy “coexist”, albeit they have no proper inter-

0 0.2 0.4 0.6 0.8

0.98 1 1.02 1.04 1.06 1.08 1.1 1.12 li=lb= 0.05

K= 0.1 Pcoex.

T

N= 5000 N= 7500

Figure 5: The chance of coexistence between competing strategies in dependence of the temptation value for different numbers of inhabitants.

actions. Panel (b) illustrates a snapshot for a more crowded population at a smaller temptation value where the coexistence of strategies is a dynamical process similar to those we described regarding the animation.

The above described differences between the pat- tern formation in rare and crowded population can be made more quantitative if we plot the proba- bility of coexisting state for populations containing different numbers of inhabitants. This is shown in Fig. 5, where we can see that crowded population makes the coexistence harder. Either cooperators, or defectors prevail depending on the temptation value. Less busy population, however, can easily re- sult in isolated patches, hence providing an escape route for cooperators at harsh temptation values.

Next we briefly summarize the possible impact of noise parameter in off-lattice environment. This question could be specially interesting, because ear- lier observations revealed that some character of the interaction topology could be a decisive factor how the critical threshold value depends on the noise parameter [44]. More precisely, if there are over- lapping triangles in the interaction graphs then the critical threshold value where cooperators die out is a decaying function of noise parameter. In the lack of it the mentioned function is non-monotonous and has an optimum at an intermediate noise strength.

This optimal level can be the result of a selection process [45].

In on off-lattice simulation, in the absence of a characteristic interaction topology, we observed a different situation which represents a new type of behavior. As Fig. 6 demonstrates, in off-lattice environment a higher noise level ensures a better chance for cooperators to survive. This effect is again related to the above described isolation pro- cess. At higher noise level the prompt invasion

(5)

0 0.2 0.4 0.6 0.8 1

1 1.02 1.04 1.06 1.08

li=lb= 0.05 N= 5000 ρC

T

K= 0.1 K= 1.0 K= 2.0

Figure 6: Noise dependence of cooperation level for pris- oner’s dilemma game at fixedN andlvalues. By increasing the uncertainty of imitation the cooperation becomes more likely even at higher temptation values.

of defectors at larger temptation is not straight- forward, which makes a chance for cooperators to survive the first attack. Later they have a higher chance to be isolated, hence to maintain a modest cooperation level.

In the following we utilize the liberty of our model and allow the defined length scales to be differ- ent. Our key observations are summarized in Fig. 7.

First, we should note that the comparison is a bit misleading because it suggests thatlb< li destroys significantly the cooperation level. But the proper reason of this behavior is the pretty high value of li = 0.25, which brings the system towards the well-mixed condition. Normally, when li is below 0.1 then the application if smallerlb value does not change the cooperation level significantly.

However, this is not valid when lb exceeds the currentlivalue. A typical curve is shown in Fig. 7, which suggests that the increase of lb has two-fold consequences. When the temptation is moderate and the cooperator strategy would be dominant

0 0.2 0.4 0.6 0.8 1

0.98 1 1.02 1.04 1.06 1.08 1.1 1.12 N= 5000

K= 0.1 ρC

T

li= 0.25, lb= 0.05 li= 0.05, lb= 0.05 li= 0.05, lb= 0.25

Figure 7: Cooperation level in dependence of temptation value for smaller and larger range of birth process as indi- cated in the legend. The chance of remote birth of newcomer weakens the cooperation for moderateT, but increase it for higherT values. This phenomenon is robust for other lb values, too.

0 0.2 0.4 0.6 0.8 1

0.98 1 1.02 1.04 1.06 1.08 1.1 1.12 N= 5000

K= 0.1 Pcoex.

T

li= 0.25, lb= 0.05 li= 0.05, lb= 0.05 li= 0.05, lb= 0.25

Figure 8: The probability of coexisting state in dependence of temptation value for normal and enlarged birth range. For moderate T values enhanced birth distance reduces, while for higher temptation values it boosts the chance of a two- strategy final state.

then an enhancedlbhelps defectors to jump into the bulk of a cooperator island, which becomes more vulnerable in this way. Consequently, the cooper- ation level decays comparing to the li = lb case.

In contrast, for higher temptation the impact has the opposite sign. Here the system would evolve toward a full defector state in the default case. But a higherlbmight help cooperators to “escape” from defectors. When such a remote patch becomes ho- mogeneous then it can survive. In other words, in- creasing lb has a similar impact on the system evo- lution to the behavior we observed for smallerN in the defaultli=lb case.

The above described argument can be supported nicely if we measure the probability of coexistence state in dependence of temptation. The comparison can be seen in Fig. 8 where we can observe similar behavior we presented in Fig. 5. Accordingly, the message is clear: for moderate temptation the en- hanced reproduction range prevents forming homo- geneous (cooperative) state, while for larger temp- tation values it helps to maintain coexistence state, hence to increase the average cooperation level.

Summing up our observations, the off-lattice en- vironment provides mostly similar evolutionary tra- jectories to those previously reported for lattice- based simulations, but the consequence of spatial reciprocity could be stronger and the coexistence of competing strategies is more dynamical in the former case.

These conclusions remain intact when we leave the prisoner’s dilemma game and consider snow- drift and stag-hunt games. An illustration can be seen in Fig. 9 where we plotted the cooperation levels in dependence of the control parameter r which makes possible to cross the related quadrant

(6)

0 0.2 0.4 0.6 0.8

0 0.2 0.4 0.6 0.8 1

li=lb= 0.05 N= 5000

K= 0.1 hρCi

r

stag-hunt

Figure 9: Cooperation level for snowdrift game and for stag- hunt game where the applied control parameter crosses the related quadrants of T S diagonally. Similarly to the lattice-based environments the transition from fullCto full Dstate is gradual in the first case and sharp in the second case.

of T −S parameter plane diagonally. The green square symbols show a gradual decay of cooperation level for snow-drift game which agrees with previ- ous observations in lattice populations [46, 47, 48].

In sharp contrast to this in the stag hunt game the orange circle symbols sign a sharp transition from the full cooperator to the full defector state as we change the control parameter. But this feature is again in good agreement with the reported behavior of on-lattice populations [14, 49, 50, 51].

4. DISCUSSION

The application of graphs to describe interactions of multi-agent systems becomes an extremely vi- brant and successful theory in the last two decades.

Not really surprisingly, evolutionary game theory has also enjoyed the benefit of this approach and utilized its concepts and simulation techniques to model more realistic dilemma situations [11, 16].

Let us stress very clearly that to understand collec- tive behaviors based on graph-based modeling of- fers not just a simpler technique, but it is proved to be appropriate concept in several real-life sys- tems. But there are cases where off-lattice sim- ulations seem to be more appropriate, hence we can not avoid the numerical difficulties of the latter models. We just quote here some microbiological systems, but other situations, like collective move- ment or floating may also require off-lattice model- ing [52, 53, 54, 55].

Our present work illustrates nicely that off-lattice systems where interaction are described by social dilemmas behave conceptually similar to those we observed on lattice-based populations. Therefore

behavior of spatial populations. There are some minor differences, however, which warn us that not all predictions of lattice-based models are robust enough to apply in general. For example, in a sys- tem where the crowding is not really limited the so- called spatial reciprocity may work more strongly.

We note that the role of aggregation was also re- ported in another work where the comparison of on- and off-lattice populations were also studied in a different system [56]. But staying at our social dilemma systems, the isolation of subgroups could also be a phenomenon which has relevant conse- quence on the system behavior.

One may claim that we only studied dilemmas which are based on pair-interactions of players and a system with multi-point interactions may behave differently in off-lattice environment. Indeed, a graph-based population ruled by public goods game may behave slightly differently from populations driven by prisoner’s dilemma [57]. But on the other hand, even multi-point interactions were identified as a key factor to diminish the differences of graph topologies [58, 59, 60]. We therefore believe that conclusions obtained off-lattice simulations remain valid for games based on multi-point interactions, but future works can confirm it in more detail.

ACKNOWLEDGMENTS

B.F.O. thanks Funda¸c˜ao Arauc´aria, and INCT- FCx (CNPq/FAPESP) for financial and computa- tional support.

[1] J. Hofbauer, K. Sigmund, The Theory of Evolution and Dynamical Systems, Cambridge University Press, Cam- bridge, UK, 1988.

[2] M. A. Nowak, Evolutionary Dynamics, Harvard Uni- versity Press, Cambridge, MA, 2006.

[3] S. Wang, L. Liu, X. Chen, Tax-based pure punishment and reward in the public goods game, Phys. Lett. A 386 (2021) 126965.

[4] Y. Shao, X. Wang, F. Fu, Evolutionary dynamics of group cooperation with asymmetrical environmental feedback, EPL 126 (2019) 40005.

[5] Z. Xu, R. Li, L. Zhang, The role of memory in human strategy updating in optional public goods game, Chaos 29 (2019) 043128.

[6] M. E. J. Newman, The structure and function of com- plex networks, SIAM Review 45 (2003) 167–256.

[7] V. M. Equ´ıluz, M. G. Zimmermann, C. J. Cela-Conde, M. S. Miguel, Cooperation and the emergence of role differentiation in the dynamics of social networks, Am.

J. Sociology 110 (2005) 977–1008.

[8] M. A. Nowak, R. M. May, Evolutionary Games and Spatial Chaos, Nature 359 (1992) 826–829.

(7)

[9] E. Ahmed, A. S. Elgazzar, On coordination and contin- uous hawk-dove games on small-world networks, Eur.

Phys. J. B 18 (2000) 159–162.

[10] F. C. Santos, J. M. Pacheco, Scale-free networks provide a unifying framework for the emergence of cooperation, Phys. Rev. Lett. 95 (2005) 098104.

[11] G. Szab´o, G. F´ath, Evolutionary games on graphs, Phys. Rep. 446 (2007) 97–216.

[12] M. A. Amaral, M. A. Javarone, Heterogeneity in evolu- tionary games: an analysis of the risk perception, Proc.

R. Soc. A 476 (2020) 20200116.

[13] X. Liu, C. Huang, Q. Dai, J. Yan, The effects of the con- formity threshold on cooperation in spatial prisoner’s dilemma games, EPL 128 (2019) 18001.

[14] C. P. Roca, J. A. Cuesta, A. S´anchez, Evolutionary game theory: Temporal and spatial effects beyond repli- cator dynamics, Phys. Life Rev. 6 (2009) 208–249.

[15] G. Yang, C. Zhu, W. Zhang, Adaptive and probabilistic strategy evolution in dynamical networks, Physica A 518 (2019) 99–110.

[16] M. Perc, J. J. Jordan, D. G. Rand, Z. Wang, S. Boc- caletti, A. Szolnoki, Statistical physics of human coop- eration, Phys. Rep. 687 (2017) 1–51.

[17] R.-R. Liu, C.-X. Jia, Z. Rong, Effects of enhancement level on evolutionary public goods game with payoff as- pirations, Appl. Math. Comput. 350 (2019) 242–248.

[18] Y. Jiao, T. Chen, Q. Chen, The impact of expressing willingness to cooperate on cooperation in public goods game, Chaos, Solit. Fract. 140 (2020) 110258.

[19] M. A. Amaral, M. A. Javarone, Strategy equilibrium in dilemma games with off-diagonal payoff perturbations, Phys. Rev. E 101 (2020) 062309.

[20] M. L. A. Jansen, J. A. Diderich, M. Mashego, A. Has- sane, J. H. de Winde, P. Daran-Lapujade, J. T. Pronk, Prolonged selection in aerobic, glucose-limited chemo- stat cultures ofSaccharomyces cerevisiaecauses a par- tial loss of glycolytic capacity, Microbiology 151 (2005) 1657–1669.

[21] J.-U. Kreft, S. Bonhoeffer, The evolution of groups of cooperating bacteria and the growth rate versus yield trade-off, Microbiology 151 (2005) 637–641.

[22] R. Garde, J. Ewald, ´A. T. Kov´acs, S. Schuster, Mod- elling population dynamics in a unicellular social organ- ism community using a minimal model and evolutionary game theory, Open Biol. 10 (2020) 200206.

[23] K. Drescher, C. D. Nadell, H. A. Stone, N. S. Wingreen, B. L. Bassler, Solutions to the Public Goods Dilemma in Bacterial Biofilms, Current Biology 24 (2014) 50–55.

[24] K. E. Boyle, H. Monaco, D. van Ditmarsch, M. De- foret, J. B. Xavier, Integration of Metabolic and Quo- rum Sensing Signals Governing the Decision to Coop- erate in a Bacterial Social Trait, PLoS Comput. Biol.

11 (2015) e1004279.

[25] E. W. Tekwa, D. Nguyen, M. Loreau, A. Gonzalez, De- fector clustering is linked to cooperation in a pathogenic bacterium, Proc. R. Soc. B 284 (2017) 20172001.

[26] J. Quan, C. Tang, X. Wang, Reputation-based dis- count effect in imitation on the evolution of cooperation in spatial public goods games, Physica A 563 (2021) 125488.

[27] T. Nagatani, G. Ichinose, Diffusively-Coupled Rock- Paper-Scissors Game with Mutation in Scale-Free Hi- erarchical Networks, Complexity 2020 (2020) 6976328.

[28] L. Zhang, C. Huang, H. Li, Q. Dai, J. Yang, Cooper- ation guided by imitation, aspiration and conformity-

driven dynamics in evolutionary games, Physica A 561 (2021) 125260.

[29] G. He, L. Zhang, C. Huang, H. Li, Q. Dai, J. Yang, The effects of heterogeneous confidence on cooperation in spatial prisoner’s dilemma game, EPL 132 (2020) 48004.

[30] K. Li, Y. Mao, Z. Wei, R. Cong, Pool-rewarding in N- person snowdrift game, Chaos, Solit. and Fract. 143 (2021) 110591.

[31] S. Gao, J. Du, J. Liang, Evolution of cooperation under punishment, Phys. Rev. E 101 (2020) 062419.

[32] J. Quan, Y. Qin, Y. Zhou, X. Wang, J.-B. Yang, How to evaluate one’s behavior toward ’bad’ individuals? Ex- ploring good social norms in promoting cooperation in spatial public goods games, J. Stat. Mech. 2020 (2020) 093405.

[33] R. Yang, T. Chen, Q. Chen, Promoting cooperation by reputation-based payoff transfer mechanism in public goods game, Eur. Phys. J. B 93 (2020) 94.

[34] K. Sigmund, The Calculus of Selfishness, Princeton University Press, Princeton, NJ, 2010.

[35] M. Perc, A. Szolnoki, Coevolutionary games – a mini review, BioSystems 99 (2010) 109–125.

[36] G. Szab´o, C. T˝oke, Evolutionary prisoner’s dilemma game on a square lattice, Phys. Rev. E 58 (1998) 69–

73.

[37] H. Ohtsuki, M. A. Nowak, The replicator equation on graphs, J. Theor. Biol. 243 (2006) 86–97.

[38] G. Szab´o, J. Vukov, A. Szolnoki, Phase diagrams for an evolutionary prisoner’s dilemma game on two- dimensional lattices, Phys. Rev. E 72 (2005) 047107.

[39] M. Doebeli, C. Hauert, Models of cooperation based on Prisoner’s Dilemma and Snowdrift game, Ecol. Lett. 8 (2005) 748–766.

[40] Z. Wang, A. Szolnoki, M. Perc, If players are sparse social dilemmas are too: Importance of percolation for evolution of cooperation, Sci. Rep. 2 (2012) 369.

[41] J.-Y. Guan, Z.-X. Wu, Y.-H. Wang, Evolutionary snow- drift game with disordered environments in mobile so- cieties, Chinese Physics 16 (2007) 3566–3570.

[42] Z. Wang, A. Szolnoki, M. Perc, Percolation threshold determines the optimal population density for public cooperation, Phys. Rev. E 85 (2012) 037101.

[43] https://doi.org/10.6084/m9.figshare.13550189.v1.

[44] J. Vukov, G. Szab´o, A. Szolnoki, Cooperation in the noisy case: Prisoner’s dilemma game on two types of regular random graphs, Phys. Rev. E 73 (2006) 067103.

[45] A. Szolnoki, J. Vukov, G. Szab´o, Selection of noise level in strategy adoption for spatial social dilemmas, Phys.

Rev. E 80 (2009) 056112.

[46] C. Hauert, M. Doebeli, Spatial structure often inhibits the evolution of cooperation in the snowdrift game, Na- ture 428 (2004) 643–646.

[47] P.-P. Li, J. Ke, Z. Lin, P. Hui, Cooperative behav- ior in evolutionary snowdrift games with the uncondi- tional imitation rule on regular lattices, Phys. Rev. E 85 (2012) 021111.

[48] F. Shu, X. Liu, K. Fang, H. Chen, Memory-based snow- drift game on a square lattice, Physica A 496 (2018) 15–26.

[49] M. Starnini, A. S´anchez, J. Poncela, Y. Moreno, Co- ordination and growth: the Stag Hunt game on evolu- tionary networks, J. Stat. Mech. 2011 (2011) P05008.

[50] G. Szab´o, A. Szolnoki, Selfishness, fraternity, and other- regarding preference in spatial evolutionary games, J.

(8)

Hunt game with elimination and reproduction on regu- lar lattices, Chaos, Solitons & Fractals 56 (2013) 69–76.

[52] T. Vicsek, A. Czir´ok, E. Ben-Jacob, I. Cohen, O. Shochet, Novel Type of Phase Transition in a Sys- tem of Self-Driven Particles, Phys. Rev. Lett. 75 (1995) 1226–1229.

[53] P. P. Avelino, D. Bazeia, L. Losano, J. Menezes, B. F. de Oliveira, Spatial patterns and biodiversity in off-lattice simulations of a cyclic three-species Lotka- Volterra model, EPL 121 (2018) 48003.

[54] P. P. Avelino, B. F. de Oliveira, J. V. O. Silva, Rock- paper-scissors models with a preferred mobility direc- tion, EPL 132 (2020) 48003.

[55] D. Bazeia, M. V. de Moraes, B. F. de Oliveira, Model for clustering of living species, EPL 129 (2020) 28002.

[56] A. J. Daly, W. Quaghebeur, T. M. A. Depraetere, J. M.

Baetens, B. D. Baets, Lattice-based versus lattice-free individual-based models: impact on coexistence in com- petitive communities, Natural Computing 18 (2019) 855–864.

[57] M. Perc, J. G´omez-Garde˜nes, A. Szolnoki, L. M. Flor´ıa and Y. Moreno, Evolutionary dynamics of group inter- actions on structured populations: a review, J. R. Soc.

Interface 10 (2013) 20120997.

[58] A. Szolnoki, M. Perc, G. Szab´o, Topology-independent impact of noise on cooperation in spatial public goods games, Phys. Rev. E 80 (2009) 056109.

[59] A. Szolnoki, J. Vukov, M. Perc, From pairwise to group interactions in games of cyclic dominance, Phys. Rev.

E 89 (2014) 062125.

[60] A. Szolnoki, M. Perc, Vortices determine the dynamics of biodiversity in cyclical interactions with protection spillovers, New J. Phys. 17 (2015) 113033.

Ábra

Figure 3: Time evolution of cooperation level obtained for off-lattice and on square lattice simulations where all other parameters, including temptation value, noise, and  to-tal number of inhabitants are equal
Figure 5: The chance of coexistence between competing strategies in dependence of the temptation value for different numbers of inhabitants.
Figure 8: The probability of coexisting state in dependence of temptation value for normal and enlarged birth range
Figure 9: Cooperation level for snowdrift game and for stag- stag-hunt game where the applied control parameter crosses the related quadrants of T − S diagonally

Hivatkozások

KAPCSOLÓDÓ DOKUMENTUMOK

The main ingre- dients of the proof are a Poisson summation formula for general algebraic polytopes, and a representation of the Fourier transform of the characteristic function of

Twenty years ago, Bárány [1], Sinai [13] and Vershik [15] proved the existence of a limit shape for the set of all convex lattice polygons lying in the square [−n, n] 2 endowed with

Fejes T´oth [3] in the context of Minkowski’s funda- mental theorem on the minimal determinant of a packing lattice for a symmetric convex body, and was further studied by him in

The problem whether every finite lattice is representable as the con- gruence lattice of a finite algebra has been reduced to a group theoretic question: whether every finite

The bottom of the lattice is the bare verb, the top of the lattice is the fully filled VCC: it contains all fillers which present in the clause regardless whether they are part of

However, Datalog and other existing frameworks for incremental program analysis are limited in expressive power: They only support the powerset lattice as representation of

Counting lattices, semimodularity, planar lattice diagram, slim semi- modular lattice.. 2010 Mathematics

Composition series, Jordan-H¨ older theorem, counting lattices, number of inversions, number of permutations, slim lattice, planar lattice, semimodular lattice.. 2010