Effects of the planarity and heterogeneity of networks on evolutionary two-player games

We study the effects of the planarity and heterogeneity of networks on evolutionary two-player symmetric games by considering four different kinds of networks, including two types of heterogeneous networks: the weighted planar stochastic lattice（a planar scale-free network） and the random uncorrelated scale-free network with the same degree distribution as the weighted planar stochastic lattice; and two types of homogeneous networks: the hexagonal lattice and the random regular network with the same degree k;= 6 as the hexagonal lattice. Using extensive computer simulations, we found that both the planarity and heterogeneity of the network have a significant influence on the evolution of cooperation, either promotion or inhibition, depending not only on the specific kind of game（the Harmony, Snowdrift, Stag Hunt or Prisoner’s Dilemma games）, but also on the update rule（the Fermi, replicator or unconditional imitation rules）.

Evolutionary game dynamics of combining two different aspiration-driven update rules in structured populations

In evolutionary games,most studies on finite populations have focused on a single updating mechanism.However,given the differences in individual cognition,individuals may change their strategies according to different updating mechanisms.For this reason,we consider two different aspiration-driven updating mechanisms in structured populations:satisfied-stay unsatisfied shift(SSUS)and satisfied-cooperate unsatisfied defect(SCUD).To simulate the game player’s learning process,this paper improves the particle swarm optimization algorithm,which will be used to simulate the game player’s strategy selection,i.e.,population particle swarm optimization(PPSO)algorithms.We find that in the prisoner’s dilemma,the conditions that SSUS facilitates the evolution of cooperation do not enable cooperation to emerge.In contrast,SCUD conditions that promote the evolution of cooperation enable cooperation to emerge.In addition,the invasion of SCUD individuals helps promote cooperation among SSUS individuals.Simulated by the PPSO algorithm,the theoretical approximation results are found to be consistent with the trend of change in the simulation results.

Evolutionary games and spatial periodicity

Spatial interactions are considered an important factor influencing a variety of evolutionary processes that take place in structured populations.It still remains an open problem to fully understand evolutionary game dynamics on networks except for certain limiting scenarios such as weak selection.Here we study the evolutionary dynamics of spatial games under strong selection where strategy evolution of individuals becomes deterministic in a fashion of winners taking all.We show that the long term behavior of the evolutionary process eventually converges to a particular basin of attraction,which is either a periodic cycle or a single fixed state depending on specific initial conditions and model parameters.In particular,we find that symmetric starting configurations can induce an exceedingly long transient phase encompassing a large number of aesthetic spatial patterns including the prominent kaleidoscopic cooperation.Our finding holds for any population structure and a broad class of finite games beyond the Prisoner’s Dilemma.Our work offers insights into understanding evolutionary dynamics of spatially extended systems ubiquitous in biology and ecology.

Dynamic Evolutionary Game-based Modeling,Analysis and Performance Enhancement of Blockchain Channels

The recent development of channel technology has promised to reduce the transaction verification time in blockchain operations.When transactions are transmitted through the channels created by nodes,the nodes need to cooperate with each other.If one party refuses to do so,the channel is unstable.A stable channel is thus required.Because nodes may show uncooperative behavior,they may have a negative impact on the stability of such channels.In order to address this issue,this work proposes a dynamic evolutionary game model based on node behavior.This model considers various defense strategies'cost and attack success ratio under them.Nodes can dynamically adjust their strategies according to the behavior of attackers to achieve their effective defense.The equilibrium stability of the proposed model can be achieved.The proposed model can be applied to general channel networks.It is compared with two state-of-the-art blockchain channels:Lightning network and Spirit channels.The experimental results show that the proposed model can be used to improve a channel's stability and keep it in a good cooperative stable state.Thus its use enables a blockchain to enjoy higher transaction success ratio and lower transaction transmission delay than the use of its two peers.

Evolutionary games in a generalized Moran process with arbitrary selection strength and mutation

By using a generalized fitness-dependent Moran process, an evolutionary model for symmetric 2 × 2 games in a well-mixed population with a finite size is investigated. In the model, the individuals＇ payoff accumulating from games is mapped into fitness using an exponent function. Both selection strength β and mutation rate ε are considered. The process is an ergodic birth-death process. Based on the limit distribution of the process, we give the analysis results for which strategy will be favoured when s is small enough. The results depend on not only the payoff matrix of the game, but also on the population size. Especially, we prove that natural selection favours the strategy which is risk-dominant when the population size is large enough. For arbitrary β and ε values, the ＇Hawk-Dove＇ game and the ＇Coordinate＇ game are used to illustrate our model. We give the evolutionary stable strategy （ESS） of the games and compare the results with those of the replicator dynamics in the infinite population. The results are determined by simulation experiments.

A Matrix Approach to the Modeling and Analysis of Networked Evolutionary Games With Time Delays

Using the semi-tensor product method, this paper investigates the modeling and analysis of networked evolutionary games(NEGs) with finite memories, and presents a number of new results. Firstly, a kind of algebraic expression is formulated for the networked evolutionary games with finite memories, based on which the behavior of the corresponding evolutionary game is analyzed. Secondly, under a proper assumption, the existence of Nash equilibrium of the given networked evolutionary games is proved and a free-type strategy sequence is designed for the convergence to the Nash equilibrium. Finally, an illustrative example is worked out to support the obtained new results.

Adaptive dynamic reconfiguration mechanism of unmanned swarm topology based on an evolutionary game

Autonomous cooperation of unmanned swarms is the research focus on“new combat forces”and“disruptive technologies”in military fields.The mechanism design is the fundamental way to realize autonomous cooperation.Facing the realistic requirements of a swarm network dynamic adjustment under the background of high dynamics and strong confrontation and aiming at the optimization of the coordination level,an adaptive dynamic reconfiguration mechanism of unmanned swarm topology based on an evolutionary game is designed.This paper analyzes military requirements and proposes the basic framework of autonomous cooperation of unmanned swarms,including the emergence of swarm intelligence,information network construction and collaborative mechanism design.Then,based on the framework,the adaptive dynamic reconfiguration mechanism is discussed in detail from two aspects:topology dynamics and strategy dynamics.Next,the unmanned swarms’community network is designed,and the network characteristics are analyzed.Moreover,the mechanism characteristics are analyzed by numerical simulation,focusing on the impact of key parameters,such as cost,benefit coefficient and adjustment rate on the level of swarm cooperation.Finally,the conclusion is made,which is expected to provide a theoretical reference and decision support for cooperative mode design and combat effectiveness generation of unmanned swarm operations.

Evolutionary game-based optimization of green certificate-carbon emission right-electricity joint market for thermal-wind-photovoltaic power system

With the increasing proportion of renewable energy in the power market,the demands on government financial subsidies are gradually increasing.Thus,a joint green certificate-carbon emission right-electricity multi-market trading process is proposed to study the market-based strategy for renewable energy.Considering the commodity characteristics of green certificates and carbon emission rights,the dynamic cost models of green certificates and carbon rights are constructed based on the Rubinstein game and ladder pricing models.Furthermore,considering the irrational bidding behavior of energy suppliers in the actual electricity market,an evolutionary game based multi-market bidding optimization model is presented.Subsequently,it is solved using a composite differential evolutionary algorithm.Finally,the case study results reveal that the proposed model can increase profits and the consumption rate of renewable energy and reduce carbon emission.

Integrating the environmental factor into the strategy updating rule to promote cooperation in evolutionary games

Many previous studies have shown that the environment plays an important role for social individuals. In this paper, we integrate the environmental factor, which is defined as the average payoff of all a player＇s neighbours, with the standard Fermi updating rule by introducing a tunable parameter, w. It is found that the level of cooperation increases remarkably, and that the cooperators can better resist the invasion of defection with an increase in w. This interesting phenomenon is then explained from a microscopic view. In addition, the universality of this mechanism is also proved with the help of the small-world network and the random regular graph. This work may be helpful in understanding cooperation behaviour in species from unicellular organisms up to human beings.

On Topics in Quantum Games

This work concentrates on simultaneous move non-cooperating quantum games. Part of it is evidently not new, but it is included for the sake self consistence, as it is devoted to introduction of the mathematical and physical grounds of the pertinent topics, and the way in which a simple classical game is modified to become a quantum game (a procedure referred to as a quantization of a classical game). The connection between game theory and information science is briefly stressed, and the role of quantum entanglement (that plays a central role in the theory of quantum games), is exposed. Armed with these tools, we investigate some basic concepts like the existence (or absence) of a pure strategy and mixed strategy Nash equilibrium and its relation with the degree of entanglement. The main results of this work are as follows: 1) Construction of a numerical algorithm based on the method of best response functions, designed to search for pure strategy Nash equilibrium in quantum games. The formalism is based on the discretization of a continuous variable into a mesh of points, and can be applied to quantum games that are built upon two-players two-strategies classical games, based on the method of best response functions. 2) Application of this algorithm to study the question of how the existence of pure strategy Nash equilibrium is related to the degree of entanglement (specified by a continuous parameter γ ). It is shown that when the classical game GC has a pure strategy Nash equilibrium that is not Pareto efficient, then the quantum game GQ with maximal entanglement (γ = π/2) has no pure strategy Nash equilibrium. By studying a non-symmetric prisoner dilemma game, it is found that there is a critical value 0γc such that for γγc there is a pure strategy Nash equilibrium and for γ≥γc there is no pure strategy Nash equilibrium. The behavior of the two payoffs as function of γ starts at that of the classical ones at (D, D) and approaches the cooperative classical ones at (C, C) (C = confess, D = don’t confess). 3) We then study Bayesian quantum games and show that under certain conditions, there is a pure strategy Nash equilibrium in such games even when entanglement is maximal. 4) We define the basic ingredients of a quantum game based on a two-player three strategies classical game. This requires the introduction of trits (instead of bits) and quantum trits (instead of quantum bits). It is proved that in this quantum game, there is no classical commensurability in the sense that the classical strategies are not obtained as a special case of the quantum strategies.

Evolutionary Games in Two-Layer Networks with the Introduction of Dominant Strategy

We study evolutionary games in two-layer networks by introducing the correlation between two layers through the C-dominance or the D-dominance. We assume that individuals play prisoner＇s dilemma game （PDG） in one layer and snowdrift game （SDG） in the other. We explore the dependences of the fraction of the strategy cooperation in different layers on the game parameter and initial conditions. The results on two-layer square lattices show that, when cooperation is the dominant strategy, initial conditions strongly influence cooperation in the PDG layer while have no impact in the SDG layer. Moreover, in contrast to the result for PDG in single-layer square lattices, the parameter regime where cooperation could be maintained expands significantly in the PDG layer. We also investigate the effects of mutation and network topology. We find that different mutation rates do not change the cooperation behaviors. Moreover, similar behaviors on cooperation could be found in two-layer random networks.

Evolutionary game dynamics of combining the Moran and imitation processes

One of the assumptions of previous research in evolutionary game dynamics is that individuals use only one rule to update their strategy. In reality, an individual's strategy update rules may change with the environment, and it is possible for an individual to use two or more rules to update their strategy. We consider the case where an individual updates strategies based on the Moran and imitation processes, and establish mixed stochastic evolutionary game dynamics by combining both processes. Our aim is to study how individuals change strategies based on two update rules and how this affects evolutionary game dynamics. We obtain an analytic expression and properties of the fixation probability and fixation times(the unconditional fixation time or conditional average fixation time) associated with our proposed process. We find unexpected results. The fixation probability within the proposed model is independent of the probabilities that the individual adopts the imitation rule update strategy. This implies that the fixation probability within the proposed model is equal to that from the Moran and imitation processes. The one-third rule holds in the proposed mixed model. However, under weak selection, the fixation times are different from those of the Moran and imitation processes because it is connected with the probability that individuals adopt an imitation update rule. Numerical examples are presented to illustrate the relationships between fixation times and the probability that an individual adopts the imitation update rule, as well as between fixation times and selection intensity. From the simulated analysis, we find that the fixation time for a mixed process is greater than that of the Moran process, but is less than that of the imitation process. Moreover, the fixation times for a cooperator in the proposed process increase as the probability of adopting an imitation update increases; however, the relationship becomes more complex than a linear relationship.

Evolutionary game analysis between the government and the waste producer in the venous industry

The relationship between the government and the waste producer is always a representative and realistic issue,especially concerning the venous industry.This article is based on the true relationship between the government and the waste producer,uses the methods from the evolutionary game theory,and analyzes the relationship between the government and the waste producer in detail.

A single-task and multi-decision evolutionary game model based on multi-agent reinforcement learning

In the evolutionary game of the same task for groups,the changes in game rules,personal interests,the crowd size,and external supervision cause uncertain effects on individual decision-making and game results.In the Markov decision framework,a single-task multi-decision evolutionary game model based on multi-agent reinforcement learning is proposed to explore the evolutionary rules in the process of a game.The model can improve the result of a evolutionary game and facilitate the completion of the task.First,based on the multi-agent theory,to solve the existing problems in the original model,a negative feedback tax penalty mechanism is proposed to guide the strategy selection of individuals in the group.In addition,in order to evaluate the evolutionary game results of the group in the model,a calculation method of the group intelligence level is defined.Secondly,the Q-learning algorithm is used to improve the guiding effect of the negative feedback tax penalty mechanism.In the model,the selection strategy of the Q-learning algorithm is improved and a bounded rationality evolutionary game strategy is proposed based on the rule of evolutionary games and the consideration of the bounded rationality of individuals.Finally,simulation results show that the proposed model can effectively guide individuals to choose cooperation strategies which are beneficial to task completion and stability under different negative feedback factor values and different group sizes,so as to improve the group intelligence level.

Evolutionary Game Dynamics in a Fitness-Dependent Wright-Fisher Process with Noise

Evolutionary game dynamics in finite size populations can be described by a fitness-dependent WrightFisherprocess.We consider symmetric 2x2 games in a well-mixed population.In our model,two parameters todescribe the level of player’s rationality and noise intensity in environment are introduced.In contrast with the fixationprobability method that used in a noiseless case,the introducing of the noise intensity parameter makes the processan ergodic Markov process and based on the limit distribution of the process,we can analysis the evolutionary stablestrategy (ESS) of the games.We illustrate the effects of the two parameters on the ESS of games using the Prisoner’sdilemma games (PDG) and the snowdrift games (SG).We also compare the ESS of our model with that of the replicatordynamics in infinite size populations.The results are determined by simulation experiments.

Medium and long-term thermal coal contract embedded reparations from the perspective of an evolutionary game

Coal-fired electricity enterprises are caught in the dilemma of relative fixed prices and rising costs under the scenario of decarbonization.Meanwhile,soaring market-oriented coal pricing results in coal enterprises’increasing defaults on thermal coal medium-and long-term contracts(MLC).To investigate the implementation of MLC at the micro-level,this study formalized the contractual behaviors of coal and coal-fired electricity enterprises based on the asymmetric evolutionary game.We formalized the evolving behaviors of both parties using replicator dynamics equations and proved that there were two evolutionary stabilization strategies(ESSs):compliance and coal enterprises’unilateral default.A multi-agent-based simulation was applied to verify the evolving process of ESSs and determine the critical values of MLC design by sensitive analysis.From the simulation results,coal-fired electricity enterprises do not stop generation under the current carbon quota allocation mechanism,even if carbon emission trading increases electricity generation costs.Coal enterprises choose to“default”when the market price of coal is higher than the contracted price by 18%.However,if the original reparation is increased by 5%,the compliance rate of the coal enterprises improves.Dynamic reparations embedded in the MLC improved enforcement during the contracting period.Moreover,the proposed policy implications have practical significance for enhancing the coordinated operation of coal-electricity energy supply chains.

Networked Evolutionary Model of Snow-Drift Game Based on Semi-Tensor Product

This paper investigates the networked evolutionary model based on snow-drift game with the strategy of rewards and penalty. Firstly, by using the semi-tensor product of matrices approach, the mathematical model of the networked evolutionary game is built. Secondly, combined with the matrix expression of logic, the mathematical model is expressed as a dynamic logical system and next converted into its evolutionary dynamic algebraic form. Thirdly, the dynamic evolution process is analyzed and the final level of cooperation is discussed. Finally, the effects of the changes in the rewarding and penalty factors on the level of cooperation in the model are studied separately, and the conclusions are verified by examples.

On Dynamics and Nash Equilibriums of Networked Games

Networked noncooperative games are investigated,where each player(or agent) plays with all other players in its neighborhood. Assume the evolution is based on the fact that each player uses its neighbors current information to decide its next strategy. By using sub-neighborhood, the dynamics of the evolution is obtained. Then a method for calculating Nash equilibriums from mixed strategies of multi-players is proposed.The relationship between local Nash equilibriums based on individual neighborhoods and global Nash equilibriums of overall network is revealed. Then a technique is proposed to construct Nash equilibriums of an evolutionary game from its one step static Nash equilibriums. The basic tool of this approach is the semi-tensor product of matrices, which converts strategies into logical matrices and payoffs into pseudo-Boolean functions, then networked evolutionary games become discrete time dynamic systems.

Evolutionary game analysis of problem processing mechanism in new collaboration

This paper analyzes a problem processing mechanism in a new collaboration system between the main manufacturer and the supplier in the"main manufacturer-supplier"mode,which has been widely applied in the collaborative development management of the complex product.This paper adopts the collaboration theory,the evolutionary game theory and numerical simulation to analyze the decision-making mechanism where one upstream supplier and one downstream manufacturer must process an unpredicted problem without any advance contract in common.Results show that both players'decision-makings are in some correlation with the initial state,income impact coefficients,and dealing cost.It is worth noting that only the initial state influences the final decision,while income impact coefficients and dealing cost just influence the decision process.This paper shows reasonable and practical suggestions for the manufacturer and supplier in a new collaboration system for the first time and is dedicated to the managerial implications on reducing risks of processing problems.

Evolutionary privacy-preserving learning strategies for edge-based IoT data sharing schemes

The fast proliferation of edge devices for the Internet of Things(IoT)has led to massive volumes of data explosion.The generated data is collected and shared using edge-based IoT structures at a considerably high frequency.Thus,the data-sharing privacy exposure issue is increasingly intimidating when IoT devices make malicious requests for filching sensitive information from a cloud storage system through edge nodes.To address the identified issue,we present evolutionary privacy preservation learning strategies for an edge computing-based IoT data sharing scheme.In particular,we introduce evolutionary game theory and construct a payoff matrix to symbolize intercommunication between IoT devices and edge nodes,where IoT devices and edge nodes are two parties of the game.IoT devices may make malicious requests to achieve their goals of stealing privacy.Accordingly,edge nodes should deny malicious IoT device requests to prevent IoT data from being disclosed.They dynamically adjust their own strategies according to the opponent's strategy and finally maximize the payoffs.Built upon a developed application framework to illustrate the concrete data sharing architecture,a novel algorithm is proposed that can derive the optimal evolutionary learning strategy.Furthermore,we numerically simulate evolutionarily stable strategies,and the final results experimentally verify the correctness of the IoT data sharing privacy preservation scheme.Therefore,the proposed model can effectively defeat malicious invasion and protect sensitive information from leaking when IoT data is shared.