A 2-stage strategy updating rule promotes cooperation in the prisoner's dilemma game

In this study,we propose a spatial prisoner＇s dilemma game model with a 2-stage strategy updating rule,and focus on the cooperation behavior of the system.In the first stage,i.e.,the pre-learning stage,a focal player decides whether to update his strategy according to the pre-learning factor β and the payoff difference between himself and the average of his neighbors.If the player makes up his mind to update,he enters into the second stage,i.e.,the learning stage,and adopts a strategy of a randomly selected neighbor according to the standard Fermi updating rule.The simulation results show that the cooperation level has a non-trivial dependence on the pre-learning factor.Generally,the cooperation frequency decreases as the pre-learning factor increases;but a high cooperation level can be obtained in the intermediate region of- 3〈 β 〈-1.We then give some explanations via studying the co-action of pre-learning and learning.Our results may sharpen the understanding of the influence of the strategy updating rule on evolutionary games.

Adaptive co-evolution of strategies and network leading to optimal cooperation level in spatial prisoner's dilemma game

We study evolutionary prisoner＇s dilemma game on adaptive networks where a population of players co-evolves with their interaction networks. During the co-evolution process, interacted players with opposite strategies either rewire the link between them with probability p or update their strategies with probability 1 - p depending on their payoffs. Numerical simulation shows that the final network is either split into some disconnected communities whose players share the same strategy within each community or forms a single connected network in which all nodes are in the same strategy. Interestingly, the density of cooperators in the final state can be maximised in an intermediate range of p via the competition between time scale of the network dynamics and that of the node dynamics. Finally, the mean-field analysis helps to understand the results of numerical simulation. Our results may provide some insight into understanding the emergence of cooperation in the real situation where the individuals＇ behaviour and their relationship adaptively co-evolve.

Effects of Dimers on Cooperation in the Spatial Prisoner's Dilemma Game

We investigate the evolutionary prisoner＇s dilemma game in structured populations by introducing dimers, which are defined as that two players in each dimer always hold a same strategy. We find that influences of dimets on cooperation depend on the type of dimers and the population structure. For those dimers in which players interact with each other, the cooperation level increases with the number of dimers though the cooperation improvement level depends on the type of network structures. On the other hand, the dimers, in which there are not mutual interactions, will not do any good to the cooperation level in a single community, but interestingly, will improve the cooperation level in a population with two communities. We explore the relationship between dimers and self-interactions and find that the effects of dimers are similar to that of self-interactions. Also, we find that the dimers, which are established over two communities in a multi-community network, act as one type of interaction through which information between communities is communicated by the requirement that two players in a dimer hold a same strategy.

Effects of Topological Randomness on Cooperation in a Deterministic Prisoner's Dilemma Game

In this work, we consider an evolutionary prisoner＇s dilemma game on a homogeneous random network with the richest-following strategy adoption rule. By constructing homogeneous random networks from a regular ring graph, we investigate the effects of topologicaJ randomness on cooperation. In contrast to the ordinary view that the presence of smaJ1 amount of shortcuts in ring graphs favors cooperation, we find the cooperation inhibition by weak topological randomness. The explanations on the observations are presented.

Adaptive interaction driven by the learning effect in the spatial prisoner's dilemma

We propose a computing model in which individuals can automatically adjust their interaction intensity with their mentor according to the learning effect.This model is designed to investigate the cooperative dynamics of the spatial prisoner's dilemma.More specifically,when the cumulative payoff of a learner is more than his reference earning,he will strengthen his interaction with his mentor;otherwise,he will reduce it.The experimental results indicate that this mechanism can improve the emergence of cooperation in a networked population and that the driving coefficient of interaction intensity plays an important role in promoting cooperation.Interestingly,under a certain social dilemma condition,there exists a minimal driving coefficient that leads to optimal cooperation.This occurs due to a positive feedback effect between the individual's satisfaction frequency and the number of effective neighbors.Moreover,we find that the experimental results are in accord with theoretical predictions obtained from an extension of the classical pair-approximation method.Our conclusions obtained by considering relationships with mentors can provide a new perspective for future investigations into the dynamics of evolutionary games within structured populations.

THE OPTIMAL CONTROL FOR PROMOTING THE COOPERATION IN EVOLUTION GAME GENERATED BY PRISONER'S DILEMMA

Natural selection opposes the evolution of cooperation unless specific mechanisms are at work in Prisoner＇s Dilemma. By taking advantage of the modern control theory, the controller design is discussed and the optimal control is designed for promoting cooperation based on the recent advances in mechanisms for the evolution of cooperation. Two con- trol strategies are proposed： compensation control strategy for the cooperator when playing against a defector and reward control strategy for cooperator when playing against a coop- erator. The feasibility and effectiveness of these control strategies for promoting cooperation in different stages are analyzed. The reward for cooperation can＇t prevent defection from being evolutionary stable strategy （ESS）. On the other hand, compensation for the coopera- tor can＇t prevent defection from emerging and sustaining. By considering the effect and the cost, an optimal control scheme with constraint on the admissible control set is put forward. By analyzing the special nonlinear system of replicator dynamics, the exact analytic solution of the optimal control scheme is obtained based on the maximum principle. Finally, the effectiveness of the proposed method is illustrated by examples.

Evolution of Cooperation in Continuous Prisoner's Dilemma Games on Barabasi-Albert Networks with Degree-Dependent Guilt Mechanism

This paper studies the continuous prisoner's dilemma games (CPDG) on Barabasi-Albert (BA) networks.In the model,each agent on a vertex of the networks makes an investment and interacts with all of his neighboring agents.Making an investment is costly,but which benefits its neighboring agents,where benefit and cost depend on the level of investment made.The payoff of each agent is given by the sum of payoffs it receives in its interactions with all its neighbors.Not only payoff,individual's guilty emotion in the games has also been considered.The negative guilty emotion produced in comparing with its neighbors can reduce the utility of individuals directly.We assume that the reduction amount depends on the individual's degree and a baseline level parameter.The group's cooperative level is characterized by the average investment of the population.Each player makes his investment in the next step based on a convex combination of the investment of his best neighbors in the last step,his best history strategies in the latest steps which number is controlled by a memory length parameter,and a uniformly distributed random number.Simulation results show that this degree-dependent guilt mechanism can promote the evolution of cooperation dramatically comparing with degree-independent guilt or no guilt cases.Imitation,memory,uncertainty coefficients and network structure also play determinant roles in the cooperation level of the population.All our results may shed some new light on studying the evolution of cooperation based on network reciprocity mechanisms.

Effects of Inertia on Evolutionary Prisoner's Dilemma Game

Considering the inertia of individuals in real inertia of players is introduced into evolutionary prisoner＇s life, we propose a modified Fermi updating rule, where the dilemma game （PDG） on square lattices. We mainly focus on how the inertia affects the cooperative behavior of the system. Interestingly, we find that the cooperation level has a nonmonotonic dependence on the inertia： with small inertia, cooperators will soon be invaded by defectors; with large inertia, players are unwilling to change their strategies and the cooperation level remains the same as the initial state; while a moderate inertia can induce the highest cooperation level. Moreover, effects of environmental noise and individual inertia are studied. Our work may be helpful in understanding the emergence and persistence of cooperation in nature and society.

An Improved Fitness Evaluation Mechanism with Memory in Spatial Prisoner's Dilemma Game on Regular Lattices

To deeply understand the emergence of cooperation in natural,social and economical systems,we present an improved fitness evaluation mechanism with memory in spatial prisoner's dilemma game on regular lattices.In our model,the individual fitness is not only determined by the payoff in the current game round,but also by the payoffs in previous round bins.A tunable parameter,termed as the memory strength(μ),which lies between 0 and 1,is introduced into the model to regulate the ratio of payoffs of current and previous game rounds in the individual fitness calculation.When μ = 0,our model is reduced to the standard prisoner's dilemma game;while μ = 1 represents the case in which the payoff is totally determined by the initial strategies and thus it is far from the realistic ones.Extensive numerical simulations indicate that the memory effect can substantially promote the evolution of cooperation.For μ < 1,the stronger the memory effect,the higher the cooperation level,but μ = 1 leads to a pathological state of cooperation,but can partially enhance the cooperation in the very large temptation parameter.The current results are of great significance for us to account for the role of memory effect during the evolution of cooperation among selfish players.

Benefit community promotes evolution of cooperation in prisoners’ dilemma game

Exploring the emergence and maintenance of cooperation in social dilemma is valuable and it arises considerable concerns of many researchers. In this paper, we propose a mechanism to promote cooperation, called benefit community,in which cooperators linking together form a common benefit community and all their payoffs obtained from game are divided coequally. The robustness of conclusions is tested for the PDG(prisoners' dilemma game) on square lattice and WS small world network. We find that cooperation can be promoted by this typical mechanism, especially, it can diffuse and prevail more easily and rapidly on the WS small world network than it on the square lattice, even if a big temptation to defect b. Our research provides a feasible direction to resolve the social dilemma.

PREFERENCE AND EVOLUTION IN THE ITERATED PRISONER'S DILEMMA

Game theory is extensively used to study strategy-making and actions of play- ers. The authors proposed an analysis method for study the evolutionary outcome and behaviors of players with preference in iterated prisoner＇s dilemma. In this article, a preference parameter k was introduced in the payoff matrix, wherein the value of k denotes the player＇s degree of egoism and altruism （preference）. Then, a game-theoretic dynamical model was formulated using Birth-and-Death process. The authors studied how preference influences the evolutionary equilibrium and behaviors of players. The authors get the general results： egoism leads to defection, and altruism can make players build trust and maintain cooperation, and so, the hope of the Pareto optimal solution. In the end, the simulation experiments proved the efficiency of the method.

Conditions Where the Ruled Class Unites for the Revolution:Applicability of a Game Theory on Social Dilemmas

Revolutions,typical cases of crucial social transformations,cannot be realized successfully without a large number of activists.Therefore,creating conditions favorable for acquiring enough participants should be an important topic of Marxist social science.In particular,this problem includes the “free-ride,” because the benefits of revolutionaries’ activities are gained not only by the activists but also by all other members.The paper analyzes problems such as this one,applying non-cooperative game theory to social dilemma problems.This leads to some interesting results.In this research,the problem of the workers’ choice between unity or freeride is first defined using numerical examples of the gain structure.It is defined again in a more generalized form using other parameters.In so doing,we express both the cost of participating in the movement and the gains from the concession of the ruling class.Because this analysis focuses on the importance of the number of participants,the concession of the ruling class is framed as a function of the number of participants.The results of this analysis revealed that the economic base and superstructure accurately correspond in some game structures but not in others.In other words,the social dilemma presents either as a case of prisoners’ dilemma or as a chicken game.Furthermore,this paper analyzes the influence of group size,and it was revealed that groups with a large number of members,such as a ruled class,find it particularly difficult to unite.This phenomenon is called the “large group dilemma.” In these ways,this research shows that the aforementioned type of game theory can be used to analyze the difficulties and possibilities of social movements.

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.

Effect of Strategy-Homogeneity on the Prisoner’s Dilemma Game in a Square Lattice

We investigate the effect of strategy-homogeneity on the prisoner’s dilemma game in a square lattice. Strategy-homogeneity means that the population contains at least one connected group in which individuals maintain the same strategy at each iteration and may update according to updating rule at next iteration. The simulation results show that the introduction of strategy-homogeneity increases the cooperation in the evolutionary stable state. For any value of temptation to defect, the density of cooperators in equilibrium state increases firstly and then decreases as the level of strategy-homogeneity increases constantly, and there exists an appropriate level of strategy-homogeneity, maximizing the density of cooperators. The results may be favorable for comprehending cooperative behaviors in societies composed of connected groups with coherent strategy.

Zero-determinant strategies in iterated multi-strategy games

Self-serving,rational agents sometimes cooperate to their mutual benefit.The two-player iterated prisoner′s dilemma game is a model for including the emergence of cooperation.It is generally believed that there is no simple ultimatum strategy which a player can control the return of the other participants.The zero-determinant strategy in the iterated prisoner′s dilemma dramatically expands our understanding of the classic game by uncovering strategies that provide a unilateral advantage to sentient players pitted against unwitting opponents.However,strategies in the prisoner′s dilemma game are only two strategies.Are there these results for general multi-strategy games?To address this question,the paper develops a theory for zero-determinant strategies for multi-strategy games,with any number of strategies.The analytical results exhibit a similar yet different scenario to the case of two-strategy games.The results are also applied to the Snowdrift game,the Hawk-Dove game and the Chicken game.

Inference of interactions between players based on asynchronously updated evolutionary game data

The interactions between players of the prisoner's dilemma game are inferred using observed game data.All participants play the game with their counterparts and gain corresponding rewards during each round of the game.The strategies of each player are updated asynchronously during the game.Two inference methods of the interactions between players are derived with naive mean-field(n MF)approximation and maximum log-likelihood estimation(MLE),respectively.Two methods are tested numerically also for fully connected asymmetric Sherrington-Kirkpatrick models,varying the data length,asymmetric degree,payoff,and system noise(coupling strength).We find that the mean square error of reconstruction for the MLE method is inversely proportional to the data length and typically half(benefit from the extra information of update times)of that by n MF.Both methods are robust to the asymmetric degree but work better for large payoffs.Compared with MLE,n MF is more sensitive to the strength of couplings and prefers weak couplings.

Zero-determinant strategy:An underway revolution in game theory

Repeated games describe situations where players interact with each other in a dynamic pattern and make decisions ac- cording to outcomes of previous stage games. Very recently, Press and Dyson have revealed a new class of zero-determinant （ZD） strategies for the repeated games, which can enforce a fixed linear relationship between expected payoffs of two play- ers, indicating that a smart player can control her unwitting co-player＇s payoff in a unilateral way [Proc. Acad. Natl. Sci. USA 109, 10409 （2012）]. The theory of ZD strategies provides a novel viewpoint to depict interactions among players, and fundamentally changes the research paradigm of game theory. In this brief survey, we first introduce the mathematical framework of ZD strategies, and review the properties and constrains of two specifications of ZD strategies, called pinning strategies and extortion strategies. Then we review some representative research progresses, including robustness analysis, cooperative ZD strategy analysis, and evolutionary stability analysis. Finally, we discuss some significant extensions to ZD strategies, including the multi-player ZD strategies, and ZD strategies under noise. Challenges in related research fields are also listed.

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 c~ and is remarkably promoted when c~ 〉 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.

Strategic games on a hierarchical network model

Among complex network models,the hierarchical network model is the one most close to such real networks as world trade web,metabolic network,WWW,actor network,and so on.It has not only the property of power-law degree distribution,but also the scaling clustering coefficient property which Barabási-Albert(BA)model does not have.BA model is a model of network growth based on growth and preferential attachment,showing the scale-free degree distribution property.In this paper,we study the evolution of cooperation on a hierarchical network model,adopting the prisoner's dilemma(PD)game and snowdrift game(SG)as metaphors of the interplay between connected nodes.BA model provides a unifying framework for the emergence of cooperation.But interestingly,we found that on hierarchical model,there is no sign of cooperation for PD game,while the fre-quency of cooperation decreases as the common benefit decreases for SG.By comparing the scaling clustering coefficient prop-erties of the hierarchical network model with that of BA model,we found that the former amplifies the effect of hubs.Considering different performances of PD game and SG on complex network,we also found that common benefit leads to cooperation in the evolution.Thus our study may shed light on the emergence of cooperation in both natural and social environments.

How Group Heuristics Promotes Cooperative Behavior in Social Dilemma SituationmExploration of Group Heuristics Effects on the Basis of Computer Simulation

As it is impossible to assume complete rationality in a social dilemma situation, the assumption of bounded rationality is appropriate. Under the bounded rationality, it would be reasonable to assume that one behaves according to the heuristics principle. The group identity effect in a social dilemma situation might be very important in order to attain cooperation. The aim of this study was to clarify how to promote a cooperative behavior by avoiding a social dilemma situation. The group heuristics was taken into account, and it was explored how the group heuristics promotes a cooperative behavior in a social dilemma situation. As a result of a two-person game theory experiment, the group heuristics was found to play an important role in a social dilemma situation, and enhance a cooperative behavior. For the following three cases, the higher cooperation rate was attained at the latter half of the experiment： （a） mutual in-group condition, （b） one-way in-group condition, and （f） one-way unknown condition （in-group）. In conclusion, the consciousness of in-group membership might help to promote actively mutual cooperation.