Evolutionary Prisoner＇s Dilemma on a Weighted Scale-Free Network

We investigate the evolutionary prisoner＇s dilemma on a weighted scale-free network where the diversity of teaching ability is introduced to the network in the form of weight. Though the diversity of teaching ability is not a sufficient condition for the enhancement of cooperation, we find that the degree-dependent teaching ability plays an active role in the evolution of cooperation. A new phenomenon is found when the degree-dependent teaching ability is used： the distribution of the cooperator frequency displays a two-peak structure for a certain parameter range. We also investigate the effects of the degree-degree correlation of the network on the evolution of cooperation in the presence of the diversity of the teaching ability.     

Prisoner’s Dilemma Game with Cooperation-Defection Dominance Strategies on Correlational Multilayer Networks

As multilayer networks are widely applied in modern society, numerous studies have shown the impact of a multilayer network structure and the network nature on the proportion of cooperators in the network. In this paper, we use Barabási–Albert scale-free networks (BA) and Watts and Strogatz networks (WS) to build a multilayer network structure, and we propose a new strategy-updating rule called “cooperation-defection dominance”, which can be likened to dominant and recessive traits in biogenetics. With the newly constructed multilayer network structure and the strategy-updating rules, based on the simulation results, we find that in the BA-BA network, the cooperation dominance strategy can make the networks with different rs show a cooperative trend, while the defection dominance strategy only has an obvious effect on the network cooperation with a larger r. When the BA network is connected to the WS network, we find that the effect of strategy on the proportion of cooperators in the network decreases, and the main influencing factor is the structure of the network. In the three-layer network, the cooperation dominance strategy has a greater impact on the BA network, and the proportion of the cooperators is enhanced more than under the natural evolution strategy, but the promotion effect is still smaller than that of the two-layer BA network because of the WS network. Under the defection dominance strategy, the WS layer appears different from the first two strategies, and we conclude through simulation that when the payoff parameter is at the middle level, its cooperator proportion will be suppressed, and we deduce that the proportion of cooperators and defectors, as well as the payoff, play an important role.     

Evolutionary games on scale-free networks with a preferential selection mechanism

Considering the heterogeneity of individuals’ influence in the real world, we introduce a preferential selection mechanism to evolutionary games (the Prisoner’s Dilemma Game and the Snowdrift Game) on scale-free networks and focus on the cooperative behavior of the system. In every step, each agent chooses an individual from all its neighbors with a probability proportional to k^α indicating the influence of the neighbor, where k is the degree. Simulation results show that the cooperation level has a non-trivial dependence on α. To understand the effect of preferential selection mechanism on the evolution of the system, we investigate the time series of the cooperator frequency in detail. It is found that the cooperator frequency is greatly influenced by the initial strategy of hub nodes when α>0. This observation is confirmed by investigating the system behavior when some hub nodes’ strategies are fixed.     

Stability of strategies in payoff-driven evolutionary games on networks

We consider a network of coupled agents playing the Prisoner's Dilemma game, in which players are allowed to pick a strategy in the interval [0, 1], with 0 corresponding to defection, 1 to cooperation, and intermediate values representing mixed strategies in which each player may act as a cooperator or a defector over a large number of interactions with a certain probability. Our model is payoff-driven, i.e., we assume that the level of accumulated payoff at each node is a relevant parameter in the selection of strategies. Also, we consider that each player chooses his∕her strategy in a context of limited information. We present a deterministic nonlinear model for the evolution of strategies. We show that the final strategies depend on the network structure and on the choice of the parameters of the game. We find that polarized strategies (pure cooperator∕defector states) typically emerge when (i) the network connections are sparse, (ii) the network degree distribution is heterogeneous, (iii) the network is assortative, and surprisingly, (iv) the benefit of cooperation is high.     

Evolutionary prisoner’s dilemma on Newman-Watts social networks with an asymmetric payoff distribution mechanism

In this paper, we introduce an asymmetric payoff distribution mechanism into the evolutionary prisoner's dilemma game (PDG) on Newman--Watts social networks, and study its effects on the evolution of cooperation. The asymmetric payoff distribution mechanism can be adjusted by the parameter α: if α>0, the rich will exploit the poor to get richer; if α<0, the rich are forced to offer part of their income to the poor. Numerical results show that the cooperator frequency monotonously increases with α and is remarkably promoted when α>0. The effects of updating order and self-interaction are also investigated. The co-action of random updating and self-interaction can induce the highest cooperation level. Moreover, we employ the Gini coefficient to investigate the effect of asymmetric payoff distribution on the the system's wealth distribution. This work may be helpful for understanding cooperative behaviour and wealth inequality in society.     

Effects of expectation and noise on evolutionary games

Considering the difference between the actual and expected payoffs, we bring a stochastic learning updating rule into an evolutionary Prisoners Dilemma game and the Snowdrift game on scale-free networks, and then investigate how the expectation level A and environmental noise κ influence cooperative behavior. Interestingly, numerical results show that the mechanism of promoting cooperation exhibits a resonance-like fashion including the coaction of A, κ and the payoff parameters. High cooperator frequency is induced by some optimal parameter regions. The variation of time series has also been investigated. This work could be of particular interest in the evolutionary game dynamics of biological and social systems.     

Other-regarding preference and the evolutionary prisoner’s dilemma on complex networks

Prevailing models of the evolutionary prisoner’s game on networks always assume that agents are pursuing their own profit maximization. But the results from experimental games show that many agents have other-regarding preference. In this paper, we study the emergence of cooperation from the prisoner’s dilemma game on complex networks while some agents exhibit other-regarding preference such as inequality aversion, envious and guilty emotions. Contrary to common ideas, the simulation results show that the existence of inequality aversion agents does not promote cooperation emergence on a BA (Barabási and Albert) scale-free network in most situations. If the defection attraction is big and agents exhibit strong preference for inequality aversion, the frequency of cooperators will be lower than in situations where no inequality aversion agents exist. In some cases, the existence of the inequality agents will even induce the frequency of cooperators to zero, a feature which is not observed in previous research on the prisoner’s dilemma game when the underlying interaction topology is a BA scale-free network. This means that if an agent cares about equality too much, it will be difficult for cooperation to emerge and the frequency of cooperators will be low on BA networks. The research on the effect of envy or guilty emotions on the emergence of cooperation in the prisoner’s dilemma game on BA networks obtains similar results, though some differences exist. However, simulation results on a WS (Watts and Strogatz) small-world network display another scenario. If agents care about the inequality of agents very much, the WS network favors cooperation emergence in the prisoners’ dilemma game when other-regarding agents exist. If the agent weight on other-regarding is lowered, the cooperation frequencies emerging on a WS network are not much different from those in situations without other-regarding agents, although the frequency of cooperators is lower than those of the situation without other-regarding preference agents sometimes. All the simulation results imply that inequality aversion and its variations can have important effects on cooperation emergence in the prisoner’s dilemma game, and different network topologies have different effects on cooperation emergence in the prisoner’s dilemma game played on complex networks.     

Cooperation influenced by the correlation degree of two-layered complex networks in evolutionary prisoner’s dilemma games

An evolutionary prisoner's dilemma game is investigated on two-layered complex networks respectively representing interaction and learning networks in one and two dimensions. A parameter q is introduced to denote the correlation degree between the two-layered networks. Using Monte Carlo simulations we studied the effects of the correlation degree on cooperative behaviour and found that the cooperator density nontrivially changes with q for different payoff parameter values depending on the detailed strategy updating and network dimension. An explanation for the obtained results is provided.     

Fitness of others' evaluation effect promotes cooperation in spatial public goods game

Payoff-driven strategy updating rule has always been adopted as a classic mechanism, but up to now, there have been a great many of researches on considering other forms of strategy updating rules, among which pursuing high fitness is one of the most direct and conventional motivations in the decision-making using game theory. But there are few or no researches on fitness from the perspective of others' evaluation. In view of this, we propose a new model in which the evaluation effect with fitness-driven strategy updating rule is taken into consideration, and introduce an evaluation coefficient to present the degree of others' evaluation on individual's behavior. The cooperative individuals can get positive evaluation, otherwise defective individuals get negative evaluation, and the degree of evaluation is related to the number of neighbors who have the same strategy of individual. Through numerical simulation, we find that the evaluation effect of others can enhance the network reciprocity, thus promoting the cooperation. For a strong dilemma, the higher evaluation coefficient can greatly weaken the cooperation dilemma; for a weak one, the higher evaluation coefficient can make cooperator clusters spread faster, however, there is no significant difference in the level of cooperation in the final stable state among different evaluation coefficients. The cooperation becomes more flourish as the number of fitness-driven individuals increases, when all individuals adopt fitness-driven strategy updating rule, the cooperators can quickly occupy the whole population. Besides, we demonstrate the robustness of the results on the WS small-world network, ER random network, and BA scale-free network.     

Evolutionary public goods games on scale-free networks with unequal payoff allocation mechanism

In this paper, we bring an unequal payoff allocation mechanism into evolutionary public goods game on scale-free networks and focus on the cooperative behavior of the system. The unequal mechanism can be tuned by one parameter α: if α>0, the hub nodes can use its degree advantage to collect more payoff; if α<0, numerous non-hub nodes will obtain more payoff in a single round game. Simulation results show that the cooperation level has a non-trivial dependence on α. For the small enhancement factor r, the cooperator frequency can be promoted by both negative and positive α. For large r, there exists an optimal α that can obtain the highest cooperation level. Our results may sharpen the understanding of the emergence of cooperation induced by the unequal payoff allocation mechanism.     

Evolution of Cooperation in Evolutionary Games for Heterogeneous Interactions

When a population structure is modelled as a square lattice,the cooperation may be improved for an evolutionary prisoner dilemma game or be inhibited for an evolutionary snowdrift game.In this work,we investigate cooperation in a population on a square lattice where the interaction among players contains both prisoner dilemma game and snowdrift game.The heterogeneity in interaction is introduced to the population in two different ways:the heterogenous character of interaction assigned to every player(HCP) or the heterogenous character of interaction assigned to every link between any two players(HCL).The resonant enhancement of cooperation in the case of HCP is observed while the resonant inhibition of cooperation in the case of HCL is prominent.The explanations on the enhancement or inhibition of cooperation are presented for these two cases.     

Cooperation and its evolution in growing systems with cultural reproduction

We explore the evolution of cooperation in the framework of the evolutionary game theory using the prisoner’s dilemma as metaphor of the problem. We present a minimal model taking into account the growing process of the systems and individuals with imitation capacity. We consider the topological structure and the evolution of strategies decoupled instead of a coevolutionary dynamic. We show conditions to build up a cooperative system with real topological structures for any natural selection intensity. When the system starts to grow, cooperation is unstable but becomes stable as soon as the system reaches a small core of cooperators whose size increases when the intensity of natural selection decreases. Thus, we reduce the evolution of cooperative systems with cultural reproduction to justify a small initial cooperative structure that we call cooperative seed. Otherwise, given that the system grows principally as cooperator whose cooperators inhabit the most linked parts of the system, the benefit-cost ratio required for cooperation evolve is drastically reduced compared to the found in static networks. In this way, we show that in systems whose individuals have imitation capacity the growing process is essential for the evolution of cooperation.     

Enhancement of Cooperation and Reentrant Phase of Prisoner’s Dilemma Game on Signed Networks

We studied the prisoner’s dilemma game as applied to signed networks. In signed networks, there are two types of links: positive and negative. To establish a payoff matrix between players connected with a negative link, we multiplied the payoff matrix between players connected with a positive link by −1. To investigate the effect of negative links on cooperating behavior, we performed simulations for different negative link densities. When the negative link density is low, the density of the cooperator becomes zero because there is an increasing temptation payoff, b. Here, parameter b is the payoff received by the defector from playing the game with a cooperator. Conversely, when the negative link density is high, the cooperator density becomes almost 1 as b increases. This is because players with a negative link will suffer more payoff damage if they do not cooperate with each other. The negative link forces players to cooperate, so cooperating behavior is enhanced.     

Memory-based evolutionary game on small-world network with tunable heterogeneity

Most papers about evolutionary games on graph assume agents have no memory. Yet, in the real world, interaction history can also affect an agent’s decision. So we introduce a memory-based agent model and investigate the Prisoner’s Dilemma game on a Heterogeneous Newman-Watts small-world network based on a Genetic Algorithm, focusing on heterogeneity’s role in the emergence of cooperative behaviors. In contrast with previous results, we find that a different heterogeneity parameter domain range imposes an entirely different impact on the cooperation fraction. In the parameter range corresponding to networks with extremely high heterogeneity, the decrease in heterogeneity greatly promotes the proportion of cooperation strategy, while in the remaining parameter range, which relates to relatively homogeneous networks, the variation of heterogeneity barely affects the cooperation fraction. Also our study provides a detailed insight into the microscopic factors that contribute to the performance of cooperation frequency.     

双复杂网络间的演化博弈

复杂网络的演化博弈是社会结构与稳定的重要模型. 基于单网络演化博弈模型, 提出了一种双复杂动态网络的演化博弈模型, 考虑双复杂网络在两个不同收益矩阵的囚徒困境博弈下增长, 当两个网络没有相互联系时, 发现增长网络中的空间互利性所导致的平均合作水平的突变, 推广了前人的结论. 在两个网络有相互联系时, 平均合作水平可以两者出现高度同步. 在网络的收益系数达到一定时, 才实现较高的合作水平. 增加网络内连接数量时, 自然选择不利于网络的合作, 而公平选择却有利于网络的合作, 说明了更新策略的影响. 当增加网络间连接数量时, 两个网络合作水平都下降. 当保持网络间和网络内的连接比例不变时, 网络的平均度越大, 平均合作水平越小. 本文发现了背叛领袖的存在, 并揭示了双网络模型下背叛领袖对平均合作水平的影响及其与合作领袖的互动机理, 这结果给出社会结构, 稳定和演化的重要信息和启示.     

Heterogeneity of allocation promotes cooperation in public goods games

We investigate the effects of heterogeneous investment and distribution on the evolution of cooperation in the context of the public goods games. To do this, we develop a simple model in which each individual allocates differing funds to his direct neighbors based upon their difference in connectivity, because of the heterogeneity of real social ties. This difference is characterized by the weight of the link between paired individuals, with an adjustable parameter precisely controlling the heterogeneous level of ties. By numerical simulations, it is found that allocating both too much and too little funds to diverse neighbors can remarkably improve the cooperation level. However, there exists a worst mode of funds allocation leading to the most unfavorable cooperation induced by the moderate values of the parameter. In order to better reveal the potential causes behind these nontrivial phenomena we probe the microscopic characteristics including the average payoff and the cooperator density for individuals of different degrees. It demonstrates rather different dynamical behaviors between the modes of these two types of cooperation promoter. Besides, we also investigate the total link weights of individuals numerically and theoretically for negative values of the parameter, and conclude that the payoff magnitude of middle-degree nodes plays a crucial role in determining the cooperators’ fate.     

Networking effects on evolutionary snowdrift game in networks with fixed degrees

We study the effects of spatial structures other than the degree distribution on the extent of the emergence of cooperation in an evolutionary snowdrift game. By swapping the links in three different types of regular lattices with a fixed degree k, we study how the frequency of cooperator f_C changes as the clustering coefficient (CC), which signifies how the nearest neighbors of a vertex are connected, and the sharing coefficient (SC), which signifies how the next-nearest neighbors of a vertex are shared by the nearest neighbors, are varied. For small k, a non-vanishing CC tends to suppress f_C. A non-vanishing SC also leads to a suppressed f_C for the networks studied. As the degree increases, the sensitivity of f_C to the network properties is found to become increasingly weak. The result is discussed within the context of the ranking patterns of average payoffs as k changes. An approximation for f_C, which is based on the idea of a finite fully connected network and gives results in good agreement with numerical results, is derived in the limit of large k.     

Effects of average degree on cooperation in networked evolutionary game

We study effects of average degree on cooperation in the networked prisoner's dilemma game. Typical structures are considered, including random networks, small-world networks and scale-free networks. Simulation results show that the average degree plays a universal role in cooperation occurring on all these networks, that is the density of cooperators peaks at some specific values of the average degree. Moreover, we investigated the average payoff of players through numerical simulations together with theoretical predictions and found that simulation results agree with the predictions. Our work may be helpful in understanding network effects on the evolutionary games.     

Optimal resource scheduling algorithm for cell boundaries users in heterogenous 5G networks

Deployment of small cells over the existing cellular network is an effective solution to improve the system coverage and throughput of fifth generation (5G) mobile communication networks. The arrival of the 5G mobile networks have demonstrated the importance of advanced scheduling techniques to manage the limited frequency spectrum available while achieving 5G transmission requirements. Cellular networks of the future necessitate the formulation of efficient resource allocation schemes that mitigate the interference between the different cells. In this research work, we formulate an optimization problem for heterogenous networks (HetNets) for resource allocation to maximize the system throughput among the cell center users (CCUs) and cell edge users (CEUs). We solve the optimization problem by effective utilization of the weight factors distribution for resource allocation. A novel Utility-based Resource Scheduling Algorithm (URSA) optimizes the resource sharing among the users with better delay budget of each application. The designed URSA ameliorates fairness along with reduced cross layer interference for real and non-real time applications. Performance of the URSA has been evaluated and compared most relevant state of art algorithms using the matlab based simulators. Furthermore, simulation results validate the superiority of the proposed scheduling scheme against conventional techniques in terms of throughput, fairness, and spectral efficiency.     

Promotion of cooperation in aspiration-based spatial prisoner’s dilemma game

We introduce a deterministic aspiration-based learning mechanism into the prisoner’s dilemma game on regular lattices and then investigate the evolution of cooperation for different values of aspiration level A. It is found that the cooperation level exhibits discontinuous phase transition with A and there is a moderate aspiration level that can best favor the cooperative behavior. Besides, the evolution time series show the so-called “ping-pong effect” for both high and low aspiration levels. The evolution of spatial patterns is also investigated. It is found that the cooperator frequency is not sensitive to the initial condition but the evolutionary patterns can be quite different.