Decay of Invincible Clusters of Cooperators in the Evolutionary Prisoner's Dilemma Game

摘要: Two types of invincible clusters cooperators are defined in the one-dimensional evolutionary Prisoner's Dilemma game. These can either be peaceful or aggressive. The survival these is discussed context repeated game with imitation and asynchronous updating procedure. decay rates for two analyzed numerically, all enumeration configuration small chain size. We find characteristic difference patterns clusters. experience monotonic exponential decay, while aggressive ones shows an interesting minimum density before going through a slow at long time. A heuristic argument existence minima provided.