Research Article | Open Access
Zhe Wang, Hong Yao, Jun Du, Xingzhao Peng, Chao Ding, "Snowdrift Game on Topologically Alterable Complex Networks", Mathematical Problems in Engineering, vol. 2015, Article ID 361270, 5 pages, 2015. https://doi.org/10.1155/2015/361270
Snowdrift Game on Topologically Alterable Complex Networks
In order to study the influence of network’s structure on cooperation level of repeated snowdrift game, in the frame of two kinds of topologically alterable network models, the relation between the cooperation density and the topological parameters was researched. The results show that the network’s cooperation density is correlated reciprocally with power-law exponent and positively with average clustering coefficient; in other words, the more homogenous and less clustered a network, the lower the network’s cooperation level; and the relation between average degree and cooperation density is nonmonotonic; when the average degree deviates from the optimal value, the cooperation density drops.
Recently, complex network has become an effective researching approach on complex systems as well as complex interactions happening over them. Complex network is a sort of abstraction of complex systems; many real world systems such as communication network, transportation network, electricity grid, and logistic network can be modeled as complex networks. One of the pioneering works on complex network was conducted by Barabási and Albert ; their works revealed the sudden emergence of scaling on random networks. Since then, the emergence of characteristics on complex networks has become a hot spot. The research of evolutionary game theory (EGT) first appeared in the literature  where Nowak observed the emergence of cooperation in game theory when combined with spatial structure, but his work was done on a regular network. His findings provided a possible explanation to why species choose to cooperate with other species when they can gain more advantages through defecting them. The observation was a breakthrough in the traditional Nash equilibrium, and it could partially explain the commonly existing cooperation in natural and social networks. In the literature , the snowdrift game with best-takeover strategy was researched in small world networks, and the results showed that the evolution of the game was greatly influenced by the topology of networks. Assenza et al.  studied the promotion of cooperation by a highly clustering network structure; they found that the hierarchical invasion of defectors which was previously observed in BA networks does not exist in highly clustered networks. Szolnoki et al.  introduced facilitators into the game where a facilitator adopts a “tit-for-tat” strategy while interacting with its neighbors. They observed an enhancement in the cooperation level due to a sufficient number of existing facilitators as well as an obstruction of information spreading. The literature  studied the influence of noise on the evolution processes where the interacting networks were three kinds of networks of various topological structures. The memory effect was studied in snowdrift game on regular lattice . All the works above were in the framework of homogeneous networks. However, the recent studies manifest the scale-free characteristic in most real world networks. In that, we propose a snowdrift game on two kinds of scale-free networks, power-law alterable network and clustering coefficient alterable network, so as to investigate the influence of main topological parameters on the emergence of cooperation.
2. Network Model
2.1. Power-Law Alterable SF Model
During a long period of time, all complex networks were regarded as random graphs. However, the American scientists Barabási and Albert overturned this presumption by their research on a project . They found that the degree distribution of most real world networks comply with power-law characteristic. They produced a network model known as BA scale-free network with a fixed power-law coefficient which is 3. BA model has been very successful in describing some real networks; yet a lot of realistic networks do not share the fixed power-law coefficient, such that a novel network production mechanism was proposed to provide scale-free model with a controllable power-law coefficient [8, 9].
Firstly, we distribute alterable normalized weights to isolated nodes; then we link the nodes with corresponding probability. We can control the power-law coefficient by tuning the weights and the total number of edges. The specific algorithm is as follows.
(i) Step 1. Distribute weight to node , , where is a tunable parameter. We normalize the weights:
(ii) Step 2. Link every two nodes with an edge when random numbers and satisfyIf node and node are not connected yet, link these two nodes.
(iii) Step 3. Repeat Step 2 until there are edges.
The average degree is , and the degree distribution satisfies , and satisfies
Clearly, parameter , together with , can tune the network topology.
2.2. Clustering Coefficient Alterable SF Model
Barabási and Albert proposed the BA scale-free model; the degree distribution complies with power-law distribution; however, the network’s average clustering coefficient is relatively low which does not agree with realistic conditions. The clustering coefficient is the average connecting probability of two nodes which belong to the neighborhood of a common node, and it describes the network’s local structural property. We adopt the clustering coefficient alterable model in the literature  where a triangle connection mechanism is introduced into the BA algorithm. This mechanism raises the average clustering coefficient of the network. By tuning the triangle connection probability, we get a tunable average clustering coefficient. The algorithm is as follows: there are original nodes; after every time step, add a new node to the network and link node to nodes in the current network; the new node is linked to the original node with a probability ofwhere is the degree of node and is the total degree of all nodes. After preferential connection to node , node adopts triangle connection with probability (that is, to choose a random neighbor of node ) or node adopts preferential connection with probability , until node is connected to nodes.
3. Game Model
The game theory is about the rational behavior in interdependent relations . Simply speaking, individuals in the game have their strategy sets, and each individual chooses its own strategy so as to maximize its interest. Pure strategies and mixed strategies are all available.
In a pairwise game, each player can choose either to cooperate or to defect; he gets different payoffs according to the strategies that he and his rival adopt. The payoff matrix is shown in Table 1. In the matrix, a cooperator gets reward when faced with another cooperator; otherwise, a cooperator gets the sucker’s payoff when faced with a defector; a defector gets the temptation when he is facing a cooperator, but he gets the punishment if his rival is also defecting. We use a snowdrift game, where , , , and .
In every round of game, each individual interacts with all their neighbors and then obtains payoff according to the payoff matrix. After each round, individual chooses a random neighbor , and it switches its strategy to ’s with the probability [15, 16] ofwhere is the probability that individual copies the strategy of individual ’s. (or ) is the payoff of individual (or ) in this round. is the bigger degree between and . It is clear that individual only imitates individual ’s strategy when .
Cooperation density (also known as cooperation frequency) measures the cooperation extent in game theory dynamics.
4. Simulations and Analysis
When pursuing the analytical solutions, theoretical tools such as the mean field theory have been very successful on regular networks. However, they fail when dealing with complicated network structures while numerical simulations are still effective. In this section, we simulate the repeated snowdrift game on power-law alterable and clustering coefficient alterable networks and analyze the influence of power-law coefficient, average degree, and clustering coefficient on the emergence of cooperation.
4.1. Influence of Power-Law Coefficient
In this section, we simulate and analyze the influence of power-law coefficient on the emergence of cooperation in a power-law coefficient alterable model where the total nodes number is and average degree is . Every data in Figures 1–6 is an average value of 50 network model simulations. Initially, 50% of cooperators and 50% of defectors are randomly distributed on the network. On each network, we conduct 10000 time steps (rounds), of which the former 8000 time steps are to guarantee that the system enters a steady state, and the latter 2000 time steps are to generate the average cooperation density . The game model we adopt and the strategy update could be seen in Section 3.
Figure 1 illustrates the relation between the cooperation density and the power-law coefficient when the temptation is . We can see that decreases as increases, and it falls gradually onto a platform after . The reason, we reckon, is that the degree distribution of the network changes from power-law to Poisson distribution as increases; that is to say, the network evolves from heterogeneity to homogeneity; in other words, the degree distribution tends to be more uniform. As a result of that, the influence of nodes with big degrees on the nodes with small degrees weakens, and the small degree nodes tend to defection for their own interest.
Figure 2 shows the relation between the cooperation density and the temptation parameter when , , and . As shown in the figure, has negative relation with ; in other words, the payoff matrix’s support of defection is correlated reciprocally with the cooperation density. And there exists a threshold for every specific ; when , the cooperators disappear on the network, .
By observing the three curves in Figure 2, we can see that the more heterogeneous the network is (with smaller ), the higher the cooperation density is when . This phenomenon indicates that the nodes with big degrees have strong influence on those with small degrees, and the small degree nodes tend to cooperate with those with big degrees. Nevertheless, when , the three curves reverse their positions, and the cooperation density is low (). The reason is that all individuals tend to each other due to the high temptation coefficient. The nodes with small degree are less dependent on those with big degree, which weakens the control of the network.
4.2. Influence of Average Degree
The average degree portrays the denseness of the network from a microscopic perspective; in other words, the network gets denser as we increase the average degree. In this section, we study the effect of different average degrees on the cooperation density. Every data is averaged over 100 model simulations. In every model, we conducted 10000 time steps of which the former 8000 time steps were to guarantee that the system has entered a steady state, and the latter 2000 time steps were to generate the average cooperation density .
Figure 3 illustrates the cooperation density with respect to average degree for variations of temptation . As seen in the figure, the relation between and is nonmonotonous: there exists one optimal average degree which corresponds to the highest cooperation level when temptation is relatively low (, , and ). When , the cooperation density reaches the top level, and cooperators are almost all over the network. When , the cooperation density deceases rapidly, as the steep slope on the left side in Figure 3. When , the cooperation density also decreases, but with a lower speed, and tends to a constant number 0.5, as the slope in the right of Figure 3. This indicates that we cannot expect more cooperators on a denser network for granted. As a result, we should set the average degree rationally when constructing a real network so as to ensure relatively high cooperation density with a limited cost.
The relation between the cooperation density and the temptation coefficient with a variable is shown in Figure 4. We can see that the curve corresponding to is above all other curves only when is small (). This phenomenon depicts that the optimal average degree has an effective range.
4.3. Influence of Average Clustering Coefficient
The average clustering coefficient describes the clustering characteristic of a complex network. Most realistic networks are clustered; for instance, one’s friends know each other in social network.
BA scale-free networks have relatively low average clustering coefficient which disagree with realistic conditions. In that, we studied the influence of average clustering coefficient on the emergence of cooperation on a clustering coefficient alterable scale-free network. Let ; we generated a model whose nodes’ total number is . The average clustering coefficient magnifies as the triangle connection probability increases; furthermore, the average clustering coefficient approaches 0.5 when . The relation between cooperation density and is shown in Figure 5, in which every data was averaged over 50 times of simulations. In every simulation, we conducted 15000 rounds of prisoners dilemma game and generated with the average of the latest 5000 time steps.
As shown in Figure 5, the cooperation density has a positive relation with because the average clustering coefficient increases as increases and the degree distribution is power-law. Compared with BA models, the dependence relationship of the small degree nodes on the big degree ones is stronger, which encourages the cooperation in the game.
Figure 6 shows the curves with a variable . The 4 curves almost coincide with the value range of , and the difference happens in , where the curves with higher falls on the upper side of the figure. In other words, the cooperation density increases as the average clustering coefficient increases.
The emergence of cooperation on complex networks is of great importance, and it provides a new explanation of the population behavior evolution in both nature and society. Based on a power-law alterable model and a clustering coefficient alterable model, we studied the prisoners dilemma game on scale-free networks with synchronous update of Schlag strategy.
The simulation results show that the cooperation level is correlated reciprocally with the power-law coefficient of the network and the relation between the cooperation density and the network average degree because there exists an optimal average degree corresponding to the highest cooperation level. The cooperation level has a positive relation with the average clustering coefficient when the latter is limited to a certain range.
Conflict of Interests
The authors declare that there is no conflict of interests regarding the publication of this paper.
- A.-L. Barabási and R. Albert, “Emergence of scaling in random networks,” Science, vol. 286, no. 5439, pp. 509–512, 1999.
- M. A. Nowak and R. M. May, “Evolutionary games and spatial chaos,” Nature, vol. 359, no. 6398, pp. 826–829, 1992.
- G. Abramson and M. Kuperman, “Social games in a social network,” Physical Review E: Statistical, Nonlinear, and Soft Matter Physics, vol. 63, Article ID 030901, 2001.
- S. Assenza, J. Gómez-Gardeñes, and V. Latora, “Enhancement of cooperation in highly clustered scale-free networks,” Physical Review E, vol. 78, no. 1, Article ID 017101, 2008.
- A. Szolnoki, M. Perc, and M. Mobilia, “Facilitators on networks reveal optimal interplay between information exchange and reciprocity,” Physical Review E, vol. 89, no. 4, Article ID 042802, 2014.
- G. Szabó, J. Vukov, and A. Szolnoki, “Phase diagrams for an evolutionary prisoner's dilemma game on two-dimensional lattices,” Physical Review E—Statistical, Nonlinear, and Soft Matter Physics, vol. 72, no. 4, Article ID 047107, 2005.
- S.-M. Qin, Y. Chen, X.-Y. Zhao, and J. Shi, “Effect of memory on the prisoner's dilemma game in a square lattice,” Physical Review E, vol. 78, no. 4, Article ID 041129, 2008.
- K.-I. Goh, B. Kahng, and D. Kim, “Universal behavior of load distribution in scale-free networks,” Physical Review Letters, vol. 87, no. 27, Article ID 278701, 2001.
- X. Wang, X. Li, and G. Chen, Theory of Complex Networks and Its Application, Tsinghua University Press, Beijing, 2006 (Chinese).
- P. Holme and B. J. Kim, “Growing scale-free networks with tunable clustering,” Physical Review E, vol. 65, no. 2, Article ID 026107, 2002.
- O. M. von Neumann, Theory of Games and Economic Behavior, Princeton University Press, 1944.
- J. M. Smith, Evolution and the Theory of Games, Cambridge University Press, Cambridge, UK, 1982.
- L. Yongkui, L. Zhi, C. Xiaojie, and W. Long, “Prisoner's dilemma game on two types of positively correlated networks,” Chinese Physics Letters, vol. 26, no. 4, Article ID 048902, 2009.
- L. Yong-Kui, L. Zhi, C. Xiao-Jie, and W. Long, “Evolutionary prisoner's dilemma game on highly clustered community networks,” Chinese Physics B, vol. 18, no. 7, pp. 2623–2628, 2009.
- G. Szabó and G. Fáth, “Evolutionary games on graphs,” Physics Reports, vol. 446, no. 4–6, pp. 97–216, 2007.
- F. C. Santos and J. M. Pacheco, “Scale-free networks provide a unifying framework for the emergence of cooperation,” Physical Review Letters, vol. 95, no. 9, Article ID 098104, 2005.
Copyright © 2015 Zhe Wang 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.