Discrete Dynamics in Nature and Society

Discrete Dynamics in Nature and Society / 2015 / Article

Research Article | Open Access

Volume 2015 |Article ID 989024 | 14 pages | https://doi.org/10.1155/2015/989024

Evolution of Cooperation with Moore Neighborhood and Self-Playing Rule

Academic Editor: Douglas R. Anderson
Received26 Sep 2014
Revised31 Dec 2014
Accepted02 Jan 2015
Published28 Jan 2015

Abstract

Evolutionary spatial game is a promising way to unravel the mystery of cooperation, and it has been well recognized that spatial structure could enable cooperation to persist. Schweitzer et al.’s lattice model provides an innovative method to solve the problem. In this paper, we conduct simulations using the same von Neumann neighborhood as in Schweitzer et al.’s study (2002) and observe the effect of initial population and lattice size on the evolution of cooperation. Then, we extend the model with a more complicated Moore neighborhood and self-playing rule for each central player. Simulation results not only provide new evidence for the persistence of cooperation in the evolution with spatial structures, but also investigate critical conditions for the spatial coexistence or the invasion of cooperators and defectors with the more complicated neighborhood.

1. Introduction

Cooperation is one crucial driving force for human society to burgeon and flourish. Actually, it is a fundamental factor that impels nature to evolve unceasingly into the amazing world. As a ubiquitous phenomenon, cooperation can be found everywhere, from foraging ant colonies to workers in assembly lines, from evolving chromosomes in evolution of human to communicating nodes in ad hoc networks [13]. However, why can the cooperation be sustained and evolved?

To research into the evolution of cooperation, evolutionary game is a powerful framework [4, 5]. Since evolutionary stable strategy (ESS) was first proposed by Smith and Price [6], it has drawn a lot of attention from biologists, economists, and game theorists. Its striking advantages originate from the expansion of classic game theory in aspects of both bounded rationality and dynamics. As Axelrod remarked [7], “the evolutionary approach is based on a simple principle: whatever is successful is likely to appear more often in the future”; thus successful strategies spread widely and less successful ones are doomed to be wiped out by virtue of nature selection.

Prisoner’s dilemma is a most famous paradigm to dig into the emergence and persistence of cooperation [8]. As a two-person nonzero sum game, it reflects profound conflict between collective rationality and individual rationality. Everyone in this game has two pure strategies: cooperate and defect (resp., denoted by C and D), and they have to make decisions simultaneously. The source generating dilemma situation is that either prisoner can achieve maximum payoff through adopting D. In evolutionary contexts where population is well-mixed, defection is the only ESS. However, the iterated prisoner’s dilemma introduced by Axelrod casts a light on this issue [7]. Axelrod conducted computer tournaments and identified that tit for tat (TFT) strategy, which simply cooperates at the first round and then takes whatever the opponent did in his last round, surprisingly performed best. The force behind this strategy that drives cooperation to evolve is kindness, forgiving, and retaliatory [2]. In fact, TFT is an ESS when the shadow of the future is large enough and can invade the population of defection through forming clusters.

In order to take a step towards realistic situations, spatial structure is further introduced into evolutionary prisoner’s dilemma [9]. Axelrod seems to be the first one modeling this [2]. He considered that a territory is subdivided into square cells, with each cell occupied by one player. Everyone only plays games with four nearest neighbors and updates his strategy by imitating the strategy used by the most successful neighbor in the last round. After simulations, he drew a conclusion that strategies in the spatial structure perform at least as good as mean-field structure, and he also revealed the process that one TFT invader spreads to the most population composed by the ALLD (all-defect) strategy.

In this paper, we focus on how to demonstrate various simulation results with respect to dynamics of lattice models. Schweitzer et al. [10] put forward an innovative way to comprehend the spatial effect. In Schweitzer et al.’s work [10], the evolution is based on the von Neumann neighborhood where each player has four nearest neighbors. However, different neighborhood structures may lead to different evolutionary patterns of the invasion or the coexistence of cooperator and defectors. Meanwhile, Schweitzer et al. [10] assumed each player could not play with itself. The assumption means each player cannot learn from itself, which is obviously inconsistent with the natural and especially social evolution of cooperation. Motivated by these observations, in this paper we first conduct simulations as Schweitzer et al. did to make further analysis on the evolution of cooperation with the von Neumann neighborhood and more importantly extend the model to a complicated level where the neighborhood turns into the structure of Moore and each cell can play games with itself. Based on our simulations, we analyze the effect of initial population and system size on the evolution of cooperation and investigate critical conditions for the spatial coexistence or the invasion of players with the Moore neighborhood and self-playing rule.

In Section 2, we give a brief account of current works on evolutionary spatial game. In Section 3, the evolution models with the von Neumann and Moore neighborhoods are, respectively, presented. In Section 4, we conduct simulations with different models and conditions to investigate the corresponding evolution patterns. Conclusions are drawn in Section 5, with recommendations on future studies.

2. Literature Review

Spatial structure can enable the persistence of cooperation in the evolutionary prisoner’s dilemma game, which is a very positive and promising result and first derived by Nowak and May [11, 12]. Like Axelrod’s model, players are located in a two-dimensional lattice, and everyone merely communicates with neighbors surrounding them. To observe the spatial effect, they pulled out the repeated effect by assuming that every player only has two choices in one generation: C and D, and they also adopted deterministic update rule: imitate-the-best. By the succinct model, Nowak and May found that C and D persist together indefinitely to reach variety of spatial and temporal dynamics dependent on the value of a polymorphic parameter which includes stable, quasistable, dynamic fractal, and chaotically varying states. A decade later, this theoretical prediction was confirmed by biological experiments [13]. Huberman and Glance doubted the above model’s usefulness for real-world systems [14] and proposed an asynchronous updating system where players can be updated at any time. Besides the lattice-based models, more and more attention has been paid on network-based evolutionary games. Detailed advances regarding this could refer to recent works by Szabó and Fáth [15], Poncela et al. [16], Perc [17], and Vilone et al. [18].

Stochasticity is very important for finite population, so the scores obtained by the cells within the neighborhood do not fully determine which player will take over in the next generation but only specify the probability that a player will take over. Killingback and Doebeli extended their research object by studying what evolutionary dynamics Hawk-Dove game can bring. As a result, it has higher level of cooperation and the spatiotemporal chaos is quite different from prisoner’s dilemma [9, 19]. Ellison concentrated on the coordination games in spatial structure and showed that they quickly converge to the risk-dominant equilibrium [20]. Szabó et al. studied the spatial evolutionary games with myopic players whose payoff interest is tuned from selfishness to other-regarding preference via fraternity [21, 22].

Recently, more social behaviors are considered in the evolutionary dilemma. Wang et al. [5] argued that the strategy choice of players should be affected by all their neighbors rather than the most successful neighbor and proposed an adaptive strategy-adoption rule to imitate the real-world social influence. Du and Fu [23] thought noise may be present in individual strategy learning and compared the impact of noise on spatial organization of cooperation. Gruji et al. [24] carried out comparative experiments and found that moody conditional cooperation is more supported than noninnovative game dynamics such as imitate-the-best or pairwise comparison rules. Cong et al. [25] introduced the reputation into the evolution model of the prisoner’s dilemma and analyzed the effects of population density, mobility sensitivity, and reputation memory on the emergence and persistence of cooperation. Li et al. [26] considered the trust between each player and its neighbors to study the coevolution of quantum strategies on scale-free networks.

Moreover, a lot of works considering specific evolutionary mechanisms and interaction topologies have been contributed. In some recent reviews, corresponding advances as well as future directions have been well identified. The coevolutionary rules could be regarded as a natural upgrade of evolutionary games, but how kinds of rules influence the evolution of cooperation needs to be investigated. Motivated by this, Perc and Szolnoki [27] presented a detailed review on the effects of coevolutionary rules on dynamical interactions between players, population growth, teaching activity, mobility, and aging of players. Nowak suggested that there are five rules for the evolution of cooperation: kin selection, direct reciprocity, indirect reciprocity, network reciprocity, and group selection [28]. Specifically, Perc et al. [29] reviewed advances regarding the evolutionary dynamics of group interactions on structured populations and made a comparison with the results obtained on well-mixed populations. Interaction topology is another key affecting the evolution of cooperation. As summarized in [27], common interaction topologies include rock-paper-scissors game, the ultimatum game, and public goods game. Szolnoki et al. [30] presented a latest review on cyclic dominance in evolutionary games.

Although a lot of simulation models and findings have been achieved, there are few well-accepted theoretical works focusing on how to demonstrate various simulation results with respect to dynamics of lattice models. To the best of our knowledge, Szabó and Fáth [15] introduced the technique of generalized mean-field to analyze lattice system, and another fascinating method is pair approximation which considers the pair correlations between nearest neighbors [31]. Hutson and Vickers [32] used partial differential equations to build reaction-diffusion models and formulate two-dimensional grid dynamics. Schweitzer et al. [10] put forward an innovative way to comprehend the spatial effect. As mentioned in Section 1, in this work we conduct simulations using the same von Neumann neighborhood with [10] to observe the effect of initial population and system size on the evolution of cooperation. Then, we extend the model with a more complicated Moore neighborhood and self-playing rule for each central player, in order to investigate critical conditions for the spatial coexistence or the invasion of players in the extended evolution model.

3. The Model

Our model is built on the structure of a two-dimensional lattice. Each cell is occupied by one player, and everyone is only connected with the nearest neighbors. There are two kinds of neighborhood we will investigate. One is von Neumann neighborhood where only four nearest neighbors are considered, as Figure 1 shows. The other is Moore neighborhood where eight nearest neighbors are taken into account, as Figure 2 shows.

Instead of the mean-field structure in global models, individuals can only make local contacts by playing prisoner’s dilemma with neighbors. Also, there are no iterated games, no complicated algorithms, and no memories. Every individual only plays games with neighbors once in every generation and is restricted to choose from two strategies: cooperate or defect. At the end of each generation, each player sums up its payoff against neighbors as its present fitness and decides what kind of strategy to use in the next generation. Players cannot determine what to do by collecting information to anticipate what others will do in the next generation but simply imitate the player whose strategy gives rise to the highest fitness. If there is a tie, every player always keeps its original strategy because switching strategy requires paying the price.

The above updating rule has twofold meanings. From the perspective of biology, strategies with higher fitness can survive and thrive; they will spread gradually to take over the majority of cells, while the ones with lower fitness are doomed to die out. From the perspective of sociology, people tend to adopt strategies proved to be more successful. As we can see, this is a deterministic and synchronous updating rule. Players may be regarded as cellular automata which change their states synchronously at discrete time steps, and the next state of each cell depends on the current states of the neighboring cells according to an update rule. All cells use the same rule, and the rule is applied to all cells at the same time [33]. In the model, the array has periodic boundaries, so the marginal cells on one side of the array are regarded as the neighbors of the cells on the opposite margin of the lattice.

In the lattice with cells, we denote a finite set of cells by and a set of corresponding states by , where means the state of cell in the generation . As mentioned above, every cell’s state is only concerned with its neighbors, so, in Moore structure, each cell has a neighborhood with eight cells. We denote neighbors of cell by , in which represents cell itself. When cell begins to play games with his neighborhood, it may receive the payoff , where represents the payoff of cell over its neighbor . As a matter of fact, we count the payoff that cell plays games with itself, which seems to be paradox but is very common in nature. We just need to regard every cell as a group, and then this consideration becomes reasonable. Last but not least, the force at the core in the dynamic system, that is, the updating rule, is , .

Specifically speaking, there are only two states that every cell has , which means the cell defects, or , which means the cell cooperates. The interaction between two cells is playing prisoner’s dilemma game, and either of them does not have any prior knowledge about what the other will do. After all players choose their strategies from C and D, they will receive the payoffs according to the payoff matrix in Table 1. means temptation payoff for defecting in a cooperative environment, means sucker’ payoff for cooperating in a defecting environment, means reward payoff for cooperating in a likewise environment, and means punishment payoff for defecting in a likewise environment [10].


Player Player
CD

C(, (,
D(, (,

They both get payoff as reward if they both cooperate, while they receive payoff as punishment if they both defect. A player using D obtains the payoff against a C-player, and the counterpart has to suffer the minimum income as for sucker, which signifies that selfish player can exploit the cooperator. The source leading to the dilemma lies in . To promote cooperation and maintain this difference, assuming is also necessary, which implies that the only Pareto efficient result is that they both cooperate.

4. The Spatial Dynamics and Analysis

In Schweitzer et al.’s work [10], they consider a cell and its nearest neighbors as a group, and what happens among them is regarded as an -person game even though the actual behavior among each other in this group is independent. The group game can be decomposed as a combination of two-person games happening times, and the payoff of the central cell in each generation is the sum of its payoffs by playing with every neighbor. From this perspective, the fitness of each cell is impacted intensely by the number of cooperators in the neighborhood. For instance, cell has neighbors who are cooperators under the structure of Moore neighborhood. Then it can get the payoff:

If its own state , then it can get the payoff:

If its own state , the game of cell ends in the generation.

Due to , payoff is an increasing function of the number of cooperators. Thus, no matter what state a cell is in, the more cooperators there are in its neighborhood, the higher fitness it will receive. Since the updating rule is determined by the cell with the highest score in the group, it is essential to take into account the whole configuration. Let the configuration indicate that the state of the central cell in its neighborhood is and the number of cooperators in this group is rather than standalone cell configuration. Apparently, the value of can be 1 or 0, and in the structure of Moore neighborhood. Each corresponds to that indicates the payoff of cell against the th cooperator in its group. We can get some simple summaries from the definition:(1)If , then and (as we mentioned above);(2), , because

Based on this theoretical foundation, Schweitzer et al. [10] did some simulations in the model of von Neumann structure. We extend the model to the Moore neighborhood and add the self-playing for every cell. The aim of this paper is to verify the accuracy of this theory and dig deeper into the application environment of the theory.

The flash point that makes the theory so special is that it transforms invasion from a macroscopic view into a microstructural one. There is a concept of invasion for every group when the value of in changes. If turns into 1 from 0, it can be regarded that configuration invades configuration . In our model, there are 18 different kinds of configurations, that is, and . Since there is no room for invasion in the configuration , we do not consider it. Configuration is extremely unstable which rapidly turns into after one generation, so we also rule it out.

Through the above discussion, we have

So if the following condition is met, , the highest score a cooperator can obtain is still lower than the lowest score a defector can receive. Then, cooperators are doomed to be invaded, and defectors are able to invade cooperators completely no matter what initial distribution they have. However, there is no way by which cooperators completely invade defectors because . Meanwhile, , implies that structure must be invaded by structure . Since there is no limitation on and , if is satisfied, the power of aggression of will be crippled, and if is not satisfied, can serve as the second strict restrictive condition, and so forth. We may get several different patterns in lattice system with the relaxation of limitation on ’s invasion.

The payoff in classic prisoner’s dilemma is , , , . To investigate varying degrees of limitation on the invasion of , we set the related parameters as follows: , , being a binary variable of and , and as a constant. As a result, we could partition the -plane according to the different rank ordering of , , , and .

4.1. The Spatial Dynamics of von Neumann Neighborhood without Self-Playing

In this section, like Schweitzer et al.’s work [10], each cell only communicates with its four nearest neighbors in von Neumann neighborhood and does not play game with itself. Here, provides four kinds of lines with different gradients, stands for three different intercepts, and each gradient is matched with several intercepts according to the rule . In the -plane, there are six lines intersecting with each other and cutting apart the plane with eleven areas. The lines are, respectively, represented by

The inside plane formed by two crossover points is regarded as a classification basis for six lines. Obviously, lines intersecting at the same point can be classified into the same category. Therefore we have three sets: , , and , in which represents straight line . Each set also corresponds to a level of degree that indicates how intense it influences various configurations, and is the most intense class of all and so forth. Then we discuss distinct regions in accordance with simulation of spatial prisoner’s dilemma.

Simulation I. The most stringent limitation for configuration which makes defectors too weak to recklessly invade cooperators is , , namely,

From another point of view, this group of conditions enables cooperators with various sorts of configuration to invade the defectors of configuration in the process of evolution. Cooperation occupies the majority of domain in this situation as we expect, stabilizing above the average percentage of 78%. Defectors are clustered in linked curves, carving up the sea of cooperation as massive regions and sometimes accompanied by periodic oscillating cross, as presented in Figure 3.

In Figures 3, 4, and 5 red cells represent players who defect in this generation and in the previous generation, blue is cooperation following cooperation, green is cooperation following defection, and yellow is defection following cooperation.

Simulation II. We loosen the restriction for configuration to change the sign of inequality of one condition, which produces two different feasible regions:

In the situation formed by (7), the number of defectors increases sharply and captures the most territory under both circumstances. Cooperation is found to exist in the form of big clusters, making up about 16% of players, and it is hard to find any periodically oscillating pattern, as Figure 4(a) shows.

The third situation is presented in Figure 4(b) where a peculiar phenomenon reveals itself: there is no terminal point for the evolution, and the pattern is changing all the time with high level of oscillation. This phenomenon can be referred to as spatial chaos: at first, defection dominates most parts, but cooperators cluster to compete with rivals; every time any clusters of cooperation are close enough to each other, the defectors between them will take advantage of them to grow; as the number of their alliances reaches to a point, all of them are facing an unfavorable payoff resulting in that cooperation has the better hand again; repetition of devouring of both sides brings about the phenomenon we have seen. The defectors outnumber cooperators in Figure 4(b) in the ratio of three to two.

Simulation III. We make further efforts to relax the restriction of defectors. The sign of inequality in two conditions has been changed, resulting in two different feasible regions:

Figure 5(a) shows the final state under conditions (9). Cooperation is suffering to survive as small clusters of crosses reaching the average percentage of almost 7.5%, and the pattern is perfectly stable without oscillation. When we examine the matter from different angles, group of conditions (9) is apparently further relaxation for conditions (7), and the clusters have been transformed from big to small and from many to rare, as Figures 4(a) and 5(a) show.

Group of conditions (10), which is the relaxation of the third, yields a sort of special pattern for von Neumann neighborhood. Cooperators grow as crosses, following the trace of the four directions, and there are always some separately oscillating crosses, as Figure 5(b) shows. In a nutshell, the ratio of T to P determines the stability level of the ultimate state. The larger the ratio is, the more oscillating the crosses will appear.

Simulation IV. Removing all the limitations for defectors in the first class, we have

The simulated pattern shows the domination of defection and the average percentage of cooperation does not exceed 0.6%. There is absolutely no cooperator under the assumption of initial random distribution especially when , .

Discussions. From the above simulation results, we have observed the phenomena of steady or oscillating coexistence between cooperators and defectors. These results verify that cooperators and defectors could coexist in the evolution if the local spatial structure is considered. Meanwhile, different combinations of conditions on players have resulted in different evolutions. What the results indicate is somewhat similar with the underlying evolution of real-world nature and society. The neighborhood of each cell is like the relationship of each living being, and the parameters region is like the role of local environment setting.

We already know that cooperators are inevitable to die out while no matter what the initial distribution is. As a matter of fact, we have observed huge differences of results from those in Schweitzer et al.’s work [10], especially in the regions and . They showed that these regions stand for the case of unstable coexistence, which means the dynamics will always lead to an invasion of the defectors except for some special case. However, our simulations show that there are always stable clusters in the regions and sometimes even very big clusters.

After making a detailed comparison with [10], we find that the main differences of our simulations from Schweitzer et al.’s are the initial population of players and the lattice size. In [10], the initial distribution was randomly generated such that the number of defectors was equal to that of cooperators, and the lattice size was ; In this work, we randomly assign each player on a lattice as 0 (to defect) or 1 (to cooperate), so the number of initial defectors is basically equivalent to that of cooperators. Thus, the inconsistent results from [10] may be owing to the different initial structures of players and the lattice size.

In order to verify the impact of the randomness of initial structures on evolutionary coexistence, we conducted additional simulations, respectively, with regions and . Like [10], we use the global frequency of cooperating players to show the evolution of these simulations, as Figure 6 shows.

From the results in Figure 6, we could find (i) for the two regions and , all the conducted evolutions although with different random initial distributions finally came into the stable coexistence of cooperators and defectors; (ii) the frequency of cooperators in the initial distribution has direct impact on the ratio of players in the final coexistence.

In order to investigate the effect of population size on the evolution, we extend the simulations to square lattices in different sizes. As Figure 7 shows, we obtain the final frequencies of cooperators with lattice sizes ranging from to . Due to space limitations, we just give the results performed by the parameters region and . From the results in Figure 7, we could have the following observations:(1)For the parameters region , the final states on all the lattices evolve into steady coexistence of cooperators and defectors, with the slightly fluctuated frequencies of cooperators in the final patterns.(2)For the parameters region , the pattern turns into the complete invasion by defectors when the square lattice is , but all other patterns evolve into steady coexistence of cooperators and defectors.

To make more comprehensive investigation of the validity of our results, in the following subsection we extend the model to a more complicated level: the neighborhood turns into the formation of Moore and each cell can play games with itself. The self-playing rule is inspired by the inheritance of species in nature, which would have the side effect to improve the performance of cooperators.

4.2. The Spatial Dynamics of Moore Neighborhood with Self-Playing

As mentioned above, with Moore neighborhood, there are eight sorts of configuration which represent eight sorts of gradients of straight lines and eight sorts of configuration which imply eight sorts of intersects. Synthesizing various conditions presents thirty-six lines. According to whether they are intersecting at the same crossover point, these lines can be categorized into eight subsets:

embodies the relationship between two entities with homogeneous level (the same amount of cooperators). Once there is a limitation up to someone in this category, it will have the greatest strength to affect outcomes. Following the case of von Neumann, we create a degree to measure the influence that could exert on any configuration. We can easily deduce , . In contrast with absence of self-playing, the significant parts lie in and the fact that is no longer the invincible structure. is reasonable to be superior to here.

Since overwhelming lines need to be analyzed individually, in Figure 8 we partition the -plane according to the different patterns of spatial dynamics.

Simulation V. Cooperation holds the trump card in region A formed by with the average percentage above 90%, as shown in Figure 9. Defectors survive as single dot or oscillating cluster with the size of , and sometimes there are a few inconsistent short lines.

Simulation VI. While we make modifications to one of the inequalities , only two groups of inequalities turn out to be feasible:

Under above two circumstances, defectors join up as integrated lines to partition the whole territory of cooperation into pieces, which manifests the enhancement of their strength of incursion. However, great distinctions still remain in the two regions. When conditions (13) are met, only steady clusters of defectors emerge, leaving oscillating clusters no place to live. Nevertheless, conditions (14) incubate various states with high level of oscillation, and every line or cluster formed by defectors is surrounded by oscillating cells with two periods. Figures 10(a) and 10(b) show the corresponding patterns.

Simulation VII. To make detailed exploration on how the dynamics changes gradually along with the relaxation of restriction of defection from , we modify two inequalities to achieve two feasible regions:

These two regions are the expansion from conditions (13) and (14), respectively, and the dynamics are also in the wake of invasion degree of defection becoming worse in terms of cooperation, whose patterns are shown in Figures 11(a) and 11(b). It is reflected by the fact that there are more stable lines of defectors. Conditions (13) combined with conditions (15) form region B in Figure 8, and conditions (14) and conditions (16) form the region C.

Simulation VIII. In the light of the law of development, three conditions need to be changed. Region , assumes hybrid dynamics of spatial chaos and majority of cooperation. (region D) holds the predominance of cooperation: clusters as the shape of tentacles are formed inside the picture and hardly touch the edges, as Figure 12(a) shows.

When it comes to (region E), there comes the chaos, as presented in Figure 12(b), and we notice that the chaos pattern resulting from Moore neighborhood is quite different from that from von Neumann neighborhood. The former starts with a local fascinating pattern continuing migrating and slowly diffuses from small plots of cooperation in the territory of defectors until the whole is in the chaotic state that is never able to be restored again. Meanwhile, every plot of cooperation is engulfed repeatedly by defectors from inside. While the latter is relatively stable, as soon as cooperators get a firm foothold, they only stretch and shrink on the boundary and the percentage of cooperation stabilizes rapidly.

Simulation IX. The conditions are as follows:

These conditions (region F) are the watershed between the domination of cooperation and defection, forming the patterns similar with that in Figure 13. The force of cooperation has been deteriorated by opponents, reaching the state where cooperators survive in the shape of small rectangle clusters. This reflects another distinction between two structures of neighborhood. A crisscross pattern formed by cooperators is another choice for von Neumann neighborhood to cluster.

Other Simulations. The conditions are as follows:

Defectors totally control the whole situation and fill up all the cells except when . sometimes causes very few rectangle clusters of cooperators but always brings about the complete domination of defectors if the initial distribution is random. For some special initial distributions such that there is only one defector in the central cell, defection is not able to invade them all.

releases the force of incursion thoroughly on the basis of level of . This region is very much like the last one, which has few clusters when extra condition is satisfied. Together with inequations (18), the region G is regarded as almost complete defected area.

Once (region H) is met, defection will completely dominate cooperation.

Discussions. Every group of straight lines in divides the picture with similar presentation and the number of lines in also decreases gradually. The area corresponding to is which can be divided into three pieces:

The level of cooperation in certainly is highest among all the three. turns out to be more oscillating and the clusters formed in this region are generally in the shape of curve, and intends to be more stable without oscillation and the clusters are found in the shape of lump. The patterns forming the similar clusters like are also different, and the lines in separate the level of cooperation in into secondary classes changing along with the direction of radiation. The same law can be applied to other regions . The extent of emerging of cooperation is diminishing from to .

The above discussion is subject to the dynamics on the basis of , rather than the case of von Neumann which we start with . The reason is that the dynamics of Moore structure are far more complicated than that of von Neumann structure, and the influence of sufficiently brings the majority of cooperation to the system. Since each group of lines in corresponds to a set of constraint conditions, obviously has the strictest constraint on configuration which is . Just as we expected, defectors suffer as independent dots and the number is rare. Every time we convert an inequality to unleash a level of constraint for , would put on some opposite strength to prevent from inflating excessively. These forces of expansion and restriction result in various amazing patterns.

Our modification is made from both sides of , so we come to the conclusion that has less power to undermine the defectors than . The same rule works for , , and so forth. Simulation results show that the regions dominated by cooperators in Moore neighborhood are larger than those in von Neumann, and the clusters of defectors in the former structure are in diversified shapes which are much more than those in the later. All the phenomena demonstrate the fact that the more neighbors surround the central cell, the more cooperators would be produced.

With regard to the state of occupation of cooperation, the procedure of evolution is relatively slow and regular: at the beginning defectors rule the most part and cooperators form the clusters of local and scattered dots; then cooperators develop gradually. The cooperated state with oscillation is generated by major and small clusters; the less cooperated state with stable defectors is usually formed by minor and big clusters. The spatial chaos reveals the range that promotes the situation in both neighborhood structures is generally the same. When the value of is over a threshold, the chaos appears; after it reaches some limit, the chaos will vanish again.

In order to test the above results against the population size, we select six typical parameters regions to conduct simulations with Moore neighborhood and self-playing on square lattices in different sizes. As Figure 14 shows, we obtain the final frequencies of cooperators with lattice sizes ranging from to . Note that the two curves in the oscillating patterns like Figure 14(a) and chaotic patterns like Figure 14(e), respectively, represent the maximal and minimal frequencies of cooperators. From the results in Figure 14, we can find the following.(1)The steady patterns performed by parameters regions , and , almost keep the coexistence of cooperators and defectors on square lattices in different sizes with Moore neighborhood and self-playing, as Figures 14(b) and 14(f) show. However, the evolution with Moore neighborhood may also turn into the complete invasion of defectors if the population size is not big enough, as Figure 14(f) shows. Together with the extinction phenomenon in Figure 7(b), we find that it is easy to produce complete invasion of defectors in the evolution with loose constraints on defectors and small population size.(2)The population size has the impact on the evolution of oscillating patterns such as Figures 14(a), 14(c), and 14(d), but the impact is not big enough to turn the oscillating patterns into complete invasion of cooperators or defectors. The similar impact is observed for the chaotic patterns, as Figure 14(e) shows.(3)Comparing the results with those on the lattice with Moore neighborhood and self-playing, we basically test the effectiveness of the results against population size. The results on lattices in different sizes provide further evidence on that the Moore neighborhood and self-playing rule could promote the cooperation in evolutionary games.

5. Conclusions

Evolutionary game is a powerful framework to study the evolution of cooperation, and different spatial structures may bring about different patterns of the invasion or the coexistence of cooperator and defectors. In this work, we conducted lattice-based simulations with von Neumann neighborhood as Schweitzer et al. did and found some inconsistent results. In order to find the cause, the impact of initial population distribution and the lattice size on the evolution has been investigated. What’s more, we have extended the model to a complicated level where the neighborhood turns into the structure of Moore and each cell can play games with itself.

Simulation results provided new evidence for the persistence of cooperation in the evolution with spatial structures and obtain some observations: (i) both the randomness of initial population distribution and the size of lattice have direct impact on the ratio of players in the final patterns; (ii) it is easy to produce complete invasion of defectors in the evolution with loose constraints on defectors and small population size; and (iii) comparing with the model with von Neumann neighborhood, our extended model with Moore neighborhood and self-playing rule could promote the cooperation in evolutionary games.

There are still further works which we will perform. Considerations will be given to conduct simulations in heterogeneous structures where the initial distribution of players is not random. Specific real-world evolution situations need be considered in order to observe more practical rules for promoting the cooperation behavior.

Conflict of Interests

The authors declare that there is no conflict of interests regarding the publication of this paper.

Acknowledgments

The authors gratefully acknowledge Professor Douglas R. Anderson and the referees for their constructive suggestions and comments on their paper. This work was partly supported by the National Natural Science Foundation of China (nos. 71171029 and 71471025), 2014 Social Science Development and Research Project of Hebei Province (no. 2014030208), 2014 Social Science Fund Project of Hebei Province (no. HB14GL069), and the China Scholarship Council.

References

  1. P. Descioli and R. Kurzban, “A solution to the mysteries of morality,” Psychological Bulletin, vol. 139, no. 2, pp. 477–496, 2013. View at: Publisher Site | Google Scholar
  2. R. Axelrod and W. D. Hamilton, “The evolution of cooperation,” Science, vol. 211, no. 4489, pp. 1390–1396, 1981. View at: Publisher Site | Google Scholar | MathSciNet
  3. H. Ohtsuki, C. Hauert, E. Lieberman, and M. A. Nowak, “A simple rule for the evolution of cooperation on graphs and social networks,” Nature, vol. 441, no. 7092, pp. 502–505, 2006. View at: Publisher Site | Google Scholar
  4. J. Hofbauer and K. Sigmund, Evolutionary Games and Population Dynamics, Cambridge University Press, Cambridge, UK, 1998. View at: Publisher Site | MathSciNet
  5. X. Wang, M. Perc, Y. Liu, X. Chen, and L. Wang, “Beyond pairwise strategy updating in the prisoner's dilemma game,” Scientific Reports, vol. 2, article 740, 2012. View at: Publisher Site | Google Scholar
  6. J. M. Smith and G. R. Price, “The logic of animal conflict,” Nature, vol. 246, no. 5427, pp. 15–18, 1973. View at: Publisher Site | Google Scholar
  7. R. Axelrod, The Evolution of Cooperation, Basic Books, New York, NY, USA, 1984.
  8. R. L. Trivers, “The evolution of reciprocal altruism,” The Quarterly Review of Biology, vol. 46, no. 1, pp. 35–57, 1971. View at: Publisher Site | Google Scholar
  9. T. Killingback and M. Doebeli, “Self-organized criticality in spatial evolutionary game theory,” Journal of Theoretical Biology, vol. 191, no. 3, pp. 335–340, 1998. View at: Publisher Site | Google Scholar
  10. F. Schweitzer, L. Behera, and H. Mühlenbein, “Evolution of cooperation in a spatial prisoner's dilemma,” Advances in Complex Systems, vol. 5, no. 2-3, pp. 269–299, 2002. View at: Publisher Site | Google Scholar | MathSciNet
  11. M. A. Nowak and R. M. May, “The spatial dilemmas of evolution,” International Journal of Bifurcation and Chaos, vol. 3, no. 1, pp. 35–78, 1993. View at: Publisher Site | Google Scholar | MathSciNet
  12. M. H. Vainstein and J. J. Arenzon, “Spatial social dilemmas: dilution, mobility and grouping effects with imitation dynamics,” Physica A: Statistical Mechanics and its Applications, vol. 394, pp. 145–157, 2014. View at: Publisher Site | Google Scholar | MathSciNet
  13. B. Kerr, M. A. Riley, M. W. Feldman, and B. J. M. Bohannan, “Local dispersal promotes biodiversity in a real-life game of rock-paper-scissors,” Nature, vol. 418, no. 6894, pp. 171–174, 2002. View at: Publisher Site | Google Scholar
  14. B. A. Huberman and N. S. Glance, “Evolutionary games and computer simulations,” Proceedings of the National Academy of Sciences of the United States of America, vol. 90, no. 16, pp. 7716–7718, 1993. View at: Publisher Site | Google Scholar
  15. G. Szabó and G. Fáth, “Evolutionary games on graphs,” Physics Reports, vol. 446, no. 4–6, pp. 97–216, 2007. View at: Publisher Site | Google Scholar | MathSciNet
  16. J. Poncela, J. Gómez-Gardeñes, L. M. Floría, and Y. Moreno, “Robustness of cooperation in the evolutionary prisoner's dilemma on complex networks,” New Journal of Physics, vol. 9, article 184, 2007. View at: Publisher Site | Google Scholar
  17. M. Perc, “Evolution of cooperation on scale-free networks subject to error and attack,” New Journal of Physics, vol. 11, Article ID 033027, 2009. View at: Publisher Site | Google Scholar
  18. D. Vilone, J. J. Ramasco, A. Sánchez, and M. S. Miguel, “Social imitation versus strategic choice, or consensus versus cooperation, in the networked Prisoner's Dilemma,” Physical Review E, vol. 90, Article ID 022810, pp. 1–9, 2014. View at: Publisher Site | Google Scholar
  19. T. Killingback and M. Doebeli, “Spatial evolutionary game theory: Hawks and Doves revisited,” Proceedings of the Royal Society B: Biological Sciences, vol. 263, no. 1374, pp. 1135–1144, 1996. View at: Publisher Site | Google Scholar
  20. G. Ellison, “Learning, local interaction, and coordination,” Econometrica, vol. 61, no. 5, pp. 1047–1071, 1993. View at: Publisher Site | Google Scholar | MathSciNet
  21. G. Szabó and A. Szolnoki, “Selfishness, fraternity, and other-regarding preference in spatial evolutionary games,” Journal of Theoretical Biology, vol. 299, pp. 81–87, 2012. View at: Publisher Site | Google Scholar | MathSciNet
  22. G. Szabó, A. Szolnoki, and L. Czakó, “Coexistence of fraternity and egoism for spatial social dilemmas,” Journal of Theoretical Biology, vol. 317, pp. 126–132, 2013. View at: Publisher Site | Google Scholar | MathSciNet
  23. F. Du and F. Fu, “Quantifying the impact of noise on macroscopic organization of cooperation in spatial games,” Chaos, Solitons and Fractals, vol. 56, pp. 35–44, 2013. View at: Publisher Site | Google Scholar
  24. J. Gruji, C. Gracia-Lázaro, M. Milinski et al., “A comparative analysis of spatial prisoner's dilemma experiments: conditional cooperation and payoff irrelevance,” Scientific Reports, vol. 4, article 4615, 2014. View at: Publisher Site | Google Scholar
  25. R. Cong, B. Wu, Y. Qiu, and L. Wang, “Evolution of cooperation driven by reputation-based migration,” PLoS ONE, vol. 7, no. 5, Article ID e35776, 2012. View at: Publisher Site | Google Scholar
  26. Q. Li, M. Chen, M. Perc, A. Iqbal, and D. Abbott, “Effects of adaptive degrees of trust on coevolution of quantum strategies on scale-free networks,” Scientific Reports, vol. 3, article 2949, 2013. View at: Publisher Site | Google Scholar
  27. M. Perc and A. Szolnoki, “Coevolutionary games—a mini review,” BioSystems, vol. 99, no. 2, pp. 109–125, 2010. View at: Publisher Site | Google Scholar
  28. M. A. Nowak, “Five rules for the evolution of cooperation,” Science, vol. 314, no. 5805, pp. 1560–1563, 2006. View at: Publisher Site | Google Scholar
  29. M. Perc, J. Gómez-Gardeñes, A. Szolnoki, L. M. Floría, and Y. Moreno, “Evolutionary dynamics of group interactions on structured populations: a review,” Journal of the Royal Society, Interface, vol. 10, no. 80, p. 20120997, 2013. View at: Publisher Site | Google Scholar
  30. A. Szolnoki, M. Mobilia, L.-L. Jiang, B. Szczesny, A. M. Rucklidge, and M. Perc, “Cyclic dominance in evolutionary games: a review,” Journal of the Royal Society Interface, vol. 11, no. 100, Article ID 20140735, 2014. View at: Publisher Site | Google Scholar
  31. S. P. Ellner, “Pair approximation for lattice models with multiple interaction scales,” Journal of Theoretical Biology, vol. 210, no. 4, pp. 435–447, 2001. View at: Publisher Site | Google Scholar
  32. V. C. L. Hutson and G. T. Vickers, “The spatial struggle of tit-for-tat and defect,” Philosophical Transactions of the Royal Society B: Biological Sciences, vol. 348, no. 1326, pp. 393–404, 1995. View at: Publisher Site | Google Scholar
  33. J. Kari, “Theory of cellular automata: a survey,” Theoretical Computer Science, vol. 334, no. 1–3, pp. 3–33, 2005. View at: Publisher Site | Google Scholar | MathSciNet

Copyright © 2015 Yanbing Yang et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

751 Views | 664 Downloads | 2 Citations
 PDF  Download Citation  Citation
 Download other formatsMore
 Order printed copiesOrder

We are committed to sharing findings related to COVID-19 as quickly and safely as possible. Any author submitting a COVID-19 paper should notify us at help@hindawi.com to ensure their research is fast-tracked and made available on a preprint server as soon as possible. We will be providing unlimited waivers of publication charges for accepted articles related to COVID-19.