Up to now, there have been a great number of studies that demonstrate the effect of spatial topology on the promotion of cooperation dynamics (namely, the so-called "spatial reciprocity"). However, most researchers probably attribute it to the positive assortment of strategies supported by spatial arrangement. In this paper, we analyze the time course of cooperation evolution under different evolution rules. Interestingly, a typical evolution process can be divided into two evident periods: the enduring (END) period and the expanding (EXP) period where the former features that cooperators try to endure defectors' invasion and the latter shows that perfect C clusters fast expand their area. We find that the final cooperation level relies on two key factors: the formation of the perfect C cluster at the end of the END period and the expanding fashion of the perfect C cluster during the EXP period. For deterministic rule, the smooth expansion of C cluster boundaries enables cooperators to reach a dominant state, whereas, the rough boundaries for stochastic rule cannot provide a sufficient beneficial environment for the evolution of cooperation. Moreover, we show that expansion of the perfect C cluster is closely related to the cluster coefficient of interaction topology. To some extent, we present a viable method for understanding the spatial reciprocity mechanism in nature and hope that it will inspire further studies to resolve social dilemmas.

We propose a new pairwise Fermi updating rule by considering a social average payoff when an agent copies a neighbor's strategy. In the update rule, a focal agent compares her payoff with the social average payoff of the same strategy that her pairwise opponent has. This concept might be justified by the fact that people reference global and, somehow, statistical information, not local information when imitating social behaviors. We presume several possible ways for the social average. Simulation results prove that the social average of some limited agents realizes more significant cooperation than that of the entire population.

We investigate the influence of initial fraction of cooperators on the evolution of cooperation in spatial prisoner's dilemma games. Compared with the results of heterogeneous networks, we find that there is a relatively low initial fraction of cooperators to guarantee higher equilibrium cooperative level. While this interesting phenomenon is contrary to the commonly shared knowledge that higher initial fraction of cooperators can provide better environment for the evolution of cooperation. To support our outcome, we explore the time courses of cooperation and find that the whole course can be divided into two sequent stages: enduring (END) and expanding (EXP) periods. At the end of END period, thought there is a limited number of cooperator clusters left for the case of low initial setup, these clusters can smoothly expand to hold the whole system in the EXP period. However, for high initial fraction of cooperators, superfluous cooperator clusters hinder their effective expansion, which induces many remaining defectors surrounding the cooperator clusters. Moreover, through intensive analysis, we also demonstrate that when the tendency of three cooperation cluster characteristics (cluster size, cluster number and cluster shape) are consistent within END and EXP periods, the state that maximizes cooperation can be favored.

We propose a novel idea for the so-called pairwise-Fermi process by considering copyresistance when an agent copies a neighbor's strategy, which implies that the focal agent with relatively affluent payoff vis-à-vis social average might be negative to copy her neighbor's strategy even if her payoff is less than the neighbor's payoff. Simulation results reveal that this idea with a revised strategy adaptation process significantly enhances cooperation for prisoner's dilemma games played on time-constant networks.

The stochastic optimal velocity (SOV) model, which is a cellular automata model, has been widely used because of its good reproducibility of the fundamental diagram, despite its simplicity. However, it has a drawback: in SOV, a vehicle that is temporarily stopped takes a long time to restart. This study proposes a revised SOV model that suppresses this particular defect; the basic concept of this model is derived from the car-following model, which considers the velocity gap between a particular vehicle and the preceding vehicle. A series of simulations identifies the model parameters and clarifies that the proposed model can reproduce the three traffic phases: free, jam, and even synchronized phases, which cannot be achieved by the conventional SOV model.