The Efficacy of Choosing Strategy with General Regression Neural Network on Evolutionary Markov Games

Nowadays, Evolutionary Game Theory which studies the learning model of players,has attracted more attention than before. These Games can simulate the real situationand dynamic during processing time. This paper creates the Evolutionary MarkovGames, which maps players’ strategy-choosing to a Markov Decision Processes(MDPs) with payoffs. Boltzmann distribution is used for transition probability andthe General Regression Neural Network (GRNN) simulating the strategy-choosing inEvolutionary Markov Games. Prisoner’s dilemma is a problem that uses the methodand output results showing the overlapping the human strategy-choosing line andGRNN strategy-choosing line after 48 iterations, and they choose the same strate-gies. Also, the error rate of the GRNN training by Tit for Tat (TFT) strategy is lowerthan similar work and shows a better re

The Evolutionary Price of Anarchy: Locally Bounded Agents in a Dynamic Virus Game

The Price of Anarchy (PoA) is a well-established game-theoretic concept to shed light on coordination issues arising in open distributed systems. Leaving agents to selfishly optimize comes with the risk of ending up in sub-optimal states (in terms of performance and/or costs), compared to a centralized system design. However, the PoA relies on strong assumptions about agents\u27 rationality (e.g., resources and information) and interactions, whereas in many distributed systems agents interact locally with bounded resources. They do so repeatedly over time (in contrast to "one-shot games"), and their strategies may evolve. Using a more realistic evolutionary game model, this paper introduces a realized evolutionary Price of Anarchy (ePoA). The ePoA allows an exploration of equilibrium selection in dynamic distributed systems with multiple equilibria, based on local interactions of simple memoryless agents. Considering a fundamental game related to virus propagation on networks, we present analytical bounds on the ePoA in basic network topologies and for different strategy update dynamics. In particular, deriving stationary distributions of the stochastic evolutionary process, we find that the Nash equilibria are not always the most abundant states, and that different processes can feature significant off-equilibrium behavior, leading to a significantly higher ePoA compared to the PoA studied traditionally in the literature

Imitators and Optimizers in Cournot Oligopoly

We analyze a symmetric n-firm Cournot oligopoly with a heterogeneous population of optimizers and imitators. Imitators mimic the output decision of the most successful firms of the previous round a l`a Vega-Redondo (1997). Optimizers play a myopic best response to the opponents’ previous output. Firms are allowed to make mistakes and deviate from the decision rules with a small probability. Applying stochastic stability analysis, we find that the long run distribution converges to a recurrent set of states in which imitators are better off than are optimizers. This finding appears to be robust even when optimizers are more sophisticated. It suggests that imitators drive optimizers out of the market contradicting a fundamental conjecture by Friedman (1953)

Evolutionary game of coalition building under external pressure

We study the fragmentation-coagulation (or merging and splitting) evolutionary control model as introduced recently by one of the authors, where $N$ small players can form coalitions to resist to the pressure exerted by the principal. It is a Markov chain in continuous time and the players have a common reward to optimize. We study the behavior as $N$ grows and show that the problem converges to a (one player) deterministic optimization problem in continuous time, in the infinite dimensional state space