resolution of the stochastic strategy spatial prisoners dilemma by means of particle swarm optimization解决随机策略空间粒子群优化的囚徒困境的手段.pdfVIP

Resolution of the Stochastic Strategy Spatial Prisoner’s Dilemma by Means of Particle Swarm Optimization 1 1 1,2 ˇ 3 Jianlei Zhang , Chunyan Zhang , Tianguang Chu *, Matjaz Perc 1 State Key Laboratory for Turbulence and Complex Systems, College of Engineering, Peking University, Beijing, China, 2 Key Laboratory of Machine Perception, Ministry of Education, Peking University, Beijing, China, 3 Department of Physics, Faculty of Natural Sciences and Mathematics, University of Maribor, Maribor, Slovenia Abstract We study the evolution of cooperation among selfish individuals in the stochastic strategy spatial prisoner’s dilemma game. We equip players with the particle swarm optimization technique, and find that it may lead to highly cooperative states even if the temptations to defect are strong. The concept of particle swarm optimization was originally introduced within a simple model of social dynamics that can describe the formation of a swarm, i.e., analogous to a swarm of bees searching for a food source. Essentially, particle swarm optimization foresees changes in the velocity profile of each player, such that the best locations are targeted and eventually occupied. In our case, each player keeps track of the highest payoff attained within a local topological neighborhood and its individual highest payoff. Thus, players make use of their own memory that keeps score of the most profitable strategy in previous actions, as well as use of the knowledge gained by the swarm as a whole, to find the best available strategy for themselves and the society. Following extensive simulations of this setup, we find a significant increase in the level of cooperation for a wide range of parameters, and also a full resolution of the prisoner’s dilemma. We