SPECTRUM SHARING IN ITERATED PRISONER'S DILEMMA GAME BASED ON EVOLUTIONARY STRATEGIES FOR COGNITIVE RADIOS

We study a spectrum sharing problem where multiple systems coexist and interfere with each other. First, an analysis is proposed for distributed spectrum sharing based on Prisoners' Dilemma (PD) in Cognitive Radios (CRs). In one-shot game, selfish and rational CRs greedily full spread their own spectrum space in order to maximize their own rates, which leads to Nash Equilibrium (N.E.). But with long term interaction, i.e., Iterated Prisoner's Dilemma (IPD), CRs can come to cooperate and acquire the social optimal point by using different evolutionary strategies such as Tit For Tat (TFT), Generous TFT (GTFT), etc. Also we compare the performances of the different evolutionary strategies in noise-free and noisy environments for two-player games. Finally, N-player IPD (N-IPD) is simulated to verify our conclusions that TFT is a good strategy for spectrum sharing in CRs.

EVOLUTIONARY GAME OF DYNAMIC KNOWLEDGE EXCHANGING IN KNOWLEDGE INTERACTION

Characteristics of knowledge exchanging behavior among individual agents in a knowledge dynamic interaction system are studied by using the game theory. An analytic model of evolutionary game of continuous dynamic knowledge interaction behavior is founded based on the structure of the evolutionary game chain. Possible evolution trends of the model are discussed. Finally, evolutionary stable strategies （ESSs） of knowledge transactions among individual agents in the knowledge network are identified by simulation data. Stable charicteristics of ESS in a continuous knowledge exchanging team help employee to communicate and grasp the dynamic regulation of shared knowledge.

Multi-objective integrated optimization based on evolutionary strategy with a dynamic weighting schedule

The evolutionary strategy with a dynamic weighting schedule is proposed to find all the compromised solutions of the multi-objective integrated structure and control optimization problem, where the optimal system performance and control cost are defined by H2 or H∞ norms. During this optimization process, the weights are varying with the increasing generation instead of fixed values. The proposed strategy together with the linear matrix inequality （LMI） or the Riccati controller design method can find a series of uniformly distributed nondominated solutions in a single run. Therefore, this method can greatly reduce the computation intensity of the integrated optimization problem compared with the weight-based single objective genetic algorithm. Active automotive suspension is adopted as an example to illustrate the effectiveness of the proposed method.

Handling Error Propagation in Sequential Data Assimilation Using an Evolutionary Strategy

An evolutionary strategy-based error parameterization method that searches for the most ideal error adjustment factors was developed to obtain better assimilation results. Numerical experiments were designed using some classical nonlinear models （i.e., the Lorenz-63 model and the Lorenz-96 model）. Crossover and mutation error adjustment factors of evolutionary strategy were investigated in four aspects： the initial conditions of the Lorenz model, ensemble sizes, observation covarianee, and the observation intervals. The search for error adjustment factors is usually performed using trial-and-error methods. To solve this difficult problem, a new data assimilation system coupled with genetic algorithms was developed. The method was tested in some simplified model frameworks, and the results are encouraging. The evolutionary strategy- based error handling methods performed robustly under both perfect and imperfect model scenarios in the Lorenz-96 model. However, the application of the methodology to more complex atmospheric or land surface models remains to be tested.

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.

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 Wright- Fisher process. We consider symmetric 2×2 games in a well-mixed population. In our model, two parameters to describe the level of player＇s rationality and noise intensity in environment are introduced. In contrast with the fixation probability method that used in a noiseless case, the introducing of the noise intensity parameter makes the process an ergodic Markov process and based on the limit distribution of the process, we can analysis the evolutionary stable strategy （ESS） of the games. We illustrate the effects of the two parameters on the ESS of games using the Prisoner＇s dilemma games （PDG） and the snowdrift games （SG）. We also compare the ESS of our model with that of the replicator dynamics in infinite size populations. The results are determined by simulation experiments.

On the minimum cost of an evolutionary strategy response to environment stress

Two revised drafts about a simple evolution trade off function studied by Mitchell(Mitchell, 2000) were put up first. Considering the complex of the environment, or the nonlinear interaction of the environment and species, we put up two new cost functions:c(u,z)=c 0+c 1u+k(z+az 2)u,u>0;c(u,z)=c 0+c 1u+kz du,u>0,d>0. In the first case, if the environment is adverse to species ( a >0), the region of low stress which is more suitable for the intolerant species is very small, and at the same environment stress z , the tolerant species will pay the more cost than it will paid in the normal environment. However the tolerant species will pay more cost but low strategies in the environment of a <0 than that it will paid in the environment of a =0 or a >0. In the second case, the results showed that the greater the stress of the environment is, or the more complex the environment is, the lower cost the intolerant species will pay in the region of z <1. In order to exist or to evolve from an environment of high stress, the organisms must possess a higher u , or a better means of mitigating of the stress of environment. Meanwhile in the region d >1, when d decrease, the intolerant species will pays more lower cost of exploiting a habitat in the low stress environment while the tolerant one will pays more lower cost in the high stress environment. This means that scale d describes the selection character of the species system in the evolution process, the smaller the d(d <1) is, the better the selection or the mitigation the system will possesses.

Practical Meta-Reinforcement Learning of Evolutionary Strategy with Quantum Neural Networks for Stock Trading

We show the practicality of two existing meta-learning algorithms Model- Agnostic Meta-Learning and Fast Context Adaptation Via Meta-learning using an evolutionary strategy for parameter optimization, as well as propose two novel quantum adaptations of those algorithms using continuous quantum neural networks, for learning to trade portfolios of stocks on the stock market. The goal of meta-learning is to train a model on a variety of tasks, such that it can solve new learning tasks using only a small number of training samples. In our classical approach, we trained our meta-learning models on a variety of portfolios that contained 5 randomly sampled Consumer Cyclical stocks from a pool of 60. In our quantum approach, we trained our quantum meta-learning models on a simulated quantum computer with portfolios containing 2 randomly sampled Consumer Cyclical stocks. Our findings suggest that both classical models could learn a new portfolio with 0.01% of the number of training samples to learn the original portfolios and can achieve a comparable performance within 0.1% Return on Investment of the Buy and Hold strategy. We also show that our much smaller quantum meta-learned models with only 60 model parameters and 25 training epochs have a similar learning pattern to our much larger classical meta-learned models that have over 250,000 model parameters and 2500 training epochs. Given these findings, we also discuss the benefits of scaling up our experiments from a simulated quantum computer to a real quantum computer. To the best of our knowledge, we are the first to apply the ideas of both classical meta-learning as well as quantum meta-learning to enhance stock trading.

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.

Research on the Electric Energy Metering Data Sharing Method in Smart Grid Based on Blockchain

Enabling data sharing among smart grid power suppliers is a pressing challenge due to technical hurdles in verifying,storing,and synchronizing energy metering data.Access and sharing limitations are stringent for users,power companies,and researchers,demanding significant resources and time for permissions and verification.This paper proposes a blockchain-based architecture for secure and efficient sharing of electric energy metering data.Further,we propose a data sharing model based on evolutionary game theory.Based on the Lyapunov stability theory,the model’s evolutionary stable strategy(ESS)is analyzed.Numerical results verify the correctness and practicability of the scheme proposed in this paper,and provide a new method for realizing convenient,safe and fast data sharing.

Network evolution driven by dynamics applied to graph coloring

An evolutionary network driven by dynamics is studied and applied to the graph coloring problem. From an initial structure, both the topology and the coupling weights evolve according to the dynamics. On the other hand, the dynamics of the network are determined by the topology and the coupling weights, so an interesting structure-dynamics co-evolutionary scheme appears. By providing two evolutionary strategies, a network described by the complement of a graph will evolve into several clusters of nodes according to their dynamics. The nodes in each cluster can be assigned the same color and nodes in different clusters assigned different colors. In this way, a co-evolution phenomenon is applied to the graph coloring problem. The proposed scheme is tested on several benchmark graphs for graph coloring.

Evaluating the Performance of a EuroDivisia Index Using Artificial Intelligence Techniques

This paper compares two methods to predict inflation rates in Europe. One method uses a standard back propagation neural network and the other uses an evolutionary approach, where the network weights and the network architecture are evolved. Results indicate that back propagation produces superior results. However, the evolving network still produces reasonable results with the advantage that the experimental set-up is minimal. Also of interest is the fact that the Divisia measure of money is superior as a predictive tool over simple sum.

Parallel Optimization of Program Instructions Using Genetic Algorithms

This paper describes an efficient solution to parallelize softwareprogram instructions, regardless of the programming language in which theyare written. We solve the problem of the optimal distribution of a set ofinstructions on available processors. We propose a genetic algorithm to parallelize computations, using evolution to search the solution space. The stagesof our proposed genetic algorithm are: The choice of the initial populationand its representation in chromosomes, the crossover, and the mutation operations customized to the problem being dealt with. In this paper, geneticalgorithms are applied to the entire search space of the parallelization ofthe program instructions problem. This problem is NP-complete, so thereare no polynomial algorithms that can scan the solution space and solve theproblem. The genetic algorithm-based method is general and it is simple andefficient to implement because it can be scaled to a larger or smaller number ofinstructions that must be parallelized. The parallelization technique proposedin this paper was developed in the C# programming language, and our resultsconfirm the effectiveness of our parallelization method. Experimental resultsobtained and presented for different working scenarios confirm the theoreticalresults, and they provide insight on how to improve the exploration of a searchspace that is too large to be searched exhaustively.

Cooperative extended rough attribute reduction algorithm based on improved PSO

Particle swarm optimization （PSO） is a new heuristic algorithm which has been applied to many optimization problems successfully. Attribute reduction is a key studying point of the rough set theory, and it has been proven that computing minimal reduc- tion of decision tables is a non-derterministic polynomial （NP）-hard problem. A new cooperative extended attribute reduction algorithm named Co-PSAR based on improved PSO is proposed, in which the cooperative evolutionary strategy with suitable fitness func- tions is involved to learn a good hypothesis for accelerating the optimization of searching minimal attribute reduction. Experiments on Benchmark functions and University of California, Irvine （UCI） data sets, compared with other algorithms, verify the superiority of the Co-PSAR algorithm in terms of the convergence speed, efficiency and accuracy for the attribute reduction.

Evolutionary Stable Strategies for Supply Chains: Selfishness,Fairness, and Altruism

The management strategies of a firm are inevitable affected by individual behavior preferences. The effect of individual preference on the evolutionary dynamics for supply chains is studied by employing replicator dynamics. Each firm has three behavior preferences: selfishness, fairness, and altruism. Firstly, the case that the strategy set of manufacturers and retailers including two pure strategies is considered and the effect of preference parameter on the equilibrium outcome in the shortterm interaction is discussed. Secondly, the equilibrium state in the short-term is always disturbed because the change of the environment, firm’s structure, and so forth. Using the replicator dynamics,the evolutionary stable strategies of manufacturers and retailers in the long-term interaction are analyzed. Finally, the extend case that the strategy set of manufacturers and retailers include three pure strategies is investigated. These results are found that the strategy profile in which both manufacturer and retailer choose fairness or altruism, or one player chooses fair or altruistic strategy and the other player chooses selfish strategy may be evolutionary stable, the stability of these equilibria depends on the the preference parameters.

Behavior game evolution strategy of financing platform for energysaving renovation of existing buildings

The operation optimization of the existing building energy-saving renovation financing platform is the basic support that needs to be solved in the existing building energy-saving renovation practice under the EPC mode.The essence of the operation of building energy-saving transformation financing platform is the joint effect of subjects’choice through the behavioral game strategy.Starting from the analysis of game relationship between the subjects of building energy-saving retrofit market,based on the user game theory,the author constructs a behavioral game model of energy-saving retrofit units,ESCOs and investors,discusses its behavioral game evolution and stability strategy.There is an implementation mechanism for the operation of building energy-saving renovation financing platform to enhance the effectiveness of the operation of the existing building energy-saving renovation financing platform and promote the development of the existing building energy-saving market.

Non-Recursive Relations Structure-Functionality

Non-recursive relations structure-functionality is an exclusive property of the recently introduced concept of boundedness. They provide a leading role of the hierarchy of the functional organization in the evolution of each and every complex system. The novel evolution strategy appears as a counterpart rather than as opponent to the survival of the fittest strategy because the survival of the fittest is more advantageous strategy in a slow varying environment while the novel strategy is more advantageous for a rapidly changing environment. Alongside, the non-recursive relations structure-functionality serves as grounds for coexistence of scaling dependent and scaling independent properties of complex systems.

Evolutionary computation in zoology and ecology

Evolutionary computational methods have adopted attributes of natural selection and evolution to solve problems in computer science, engineering, and other fields. The method is growing in use in zoology and ecology. Evolutionary principles may be merged with an agent-based modeling perspective to have individual animals or other agents compete. Four main categories are discussed： genetic algorithms, evolutionary programming, genetic programming, and evolutionary strategies. In evolutionary computation, a population is represented in a way that allows for an objective function to be assessed that is relevant to the problem of interest. The poorest performing members are removed from the population, and remaining members reproduce and may be mutated. The fitness of the members is again assessed, and the cycle continues until a stopping condition is met. Case studies include optimizing： egg shape given different clutch sizes, mate selection, migration of wildebeest, birds, and elk, vulture foraging behavior, algal bloom prediction, and species richness given energy constraints. Other case studies simulate the evolution of species and a means to project shifts in species ranges in response to a changing climate that includes competition and phenotypic plasticity. This introduction concludes by citing other uses of evolutionary computation and a review of the flexibility of the methods. For example, representing species＇ niche spaces subject to selective pressure allows studies on cladistics, the taxon cycle, neutral versus niche paradigms, fundamental versus realized niches, community structure and order of colonization, invasiveness, and responses to a changing climate.

Evolutionary approach for spatial architecture layout design enhanced by an agent-based topology finding system

This paper presents a method for the automatic generation of a spatial architectural layout from a user-specified architectural program. The proposed approach binds a multi-agent topology finding system and an evolutionary optimization process. The former generates topology satisfied layouts for further optimization, while the latter focuses on refining the layouts to achieve predefined architectural criteria. The topology finding process narrows the search space and increases the performance in subsequent optimization. Results imply that the spatial layout modeling and the muLti-floor topology are handled.

The Evolutionary Equilibrium of Block Withholding Attack

Bitcoin is the most famous and the most used cryptocurrency in the world,such that it has received extreme popularity in recent years.However the Bitcoin system is accompanied by different attacks,including the block withholding(BWH)attack.When a miner plays the BWH attack,it will withhold all the blocks newly discovered in the attack pool,damaging the honest miners’right to obtain the fair reward.In this paper,we consider a setting in which two miners may honestly mine or perform the BWH attack in a mining pool.Different strategy profiles will bring different payoffs,in addition influence the selection of the strategies.Therefore,we establish an evolutionary game model to study the behavior tendency of the miners and the evolutionary stable strategies under different conditions,by formulating the replicator dynamic equations.Through numerical simulations,we further verify the theoretical results on evolutionary stable solutions and discuss the impact of the factors on miners’strategic choice.Based on these simulation results,we also make some recommendations for the manager and the miners to mitigate the BWH attack and to promote the cooperation between miners in a mining pool.