Continuous Spatial Public Goods Game Based on Particle Swarm Optimization with Memory Stability

Abstract

Public goods games have been extensively studied to determine the mechanism behind cooperation in social dilemmas. Previous public goods games based on particle swarm algorithms enabled individuals to integrate their past best strategies with the current best strategies of their neighbors, which can effectively promote cooperation. In this paper, we introduce the concept of memory stability and explore the effects of different memory stability coefficients on strategy distribution, strategy update rate, and average cooperation level. Our simulation results showed that, in the case of a very high propensity coefficient, infinite memory stability coefficients cannot reach a high level of cooperation, while reducing memory stability can reach a very high level of cooperation. At a low enhancement factor, weakening memory stability decreased the average cooperation level, while at a higher enhancement factor, a weakening memory stability greatly increased the average group cooperation level. Our study provides new insights into the application of particle swarm algorithms to public goods games.