We investigate how very large populations are able to reach a global consensus, out of local "microscopic" interaction rules, in the framework of a recently introduced class of models of semiotic dynamics, the so-called Naming Game. We compare in particular the convergence mechanism for interacting agents embedded in a low-dimensional lattice with respect to the mean-field case. We highlight that in low-dimensions consensus is reached through a coarsening process which requires less cognitive effort of the agents, with respect to the mean-field case, but takes longer to complete. In 1-d the dynamics of the boundaries is mapped onto a truncated Markov process from which we analytically computed the diffusion coefficient. More generally we show that the convergence process requires a memory per agent scaling as N and lasts a time N^{1+2/d} in dimension d<5 (d=4 being the upper critical dimension), while in mean-field both memory and time scale as N^{3/2}, for a population of N agents. We present analytical and numerical evidences supporting this picture.
Non-Hermitian topology is a recent hot topic in condensed matters. In this paper, we propose a novel platform drawing interdisciplinary attention: rock-paper-scissors (RPS) cycles described by the evolutionary game theory. Specifically, we demonstrate the emergence of an exceptional point and a skin effect by analyzing topological properties of their payoff matrix. Furthermore, we discover striking dynamical properties in an RPS chain: the directive propagation of the population density in the bulk and the enhancement of the population density only around the right edge. Our results open new a…
Due to limited cognitive skills for perceptual error or other emotional reasons, players may keep their current strategies even if there is a more promising choice. Such behavior inertia has already been studied, but its consequences remained unexplored in the weak selection limit. To fill this gap, we consider a spatial public goods game model where inertia is considered during the imitation process. By using the identity-by-descent method, we present analytical forms of the critical synergy factor $r^\star$, which determines when cooperation is favored. We find that inertia hinders cooperati…
The maintenance of cooperation in the presence of spatial restrictions has been studied extensively. It is well-established that the underlying graph topology can significantly influence the outcome of games on graphs. Maintenance of cooperation could be difficult, especially in the absence of spatial restrictions. The evolution of cooperation would naturally depend on payoffs. However, payoffs are generally considered to be invariant in a given game. A natural yet unexplored question is whether the topology of the underlying structures on which the games are played, possesses no role whatsoev…
Does the scale-free topology favor the emergence of cooperation?
在最近的一封信中[F。桑托斯和J. M. Pacheco Phys. Rev. Lett. \textbf{95},098104(2005)],无标度网络被发现有利于合作的出现。在目前的工作中,一个进化的囚徒困境游戏的球员位于巴拉巴西-阿尔伯特无标度网络进行了详细研究。参与者是纯粹的战略家,可以采取两种策略:要么背叛,要么合作。Serval替代更新规则确定每个玩家的策略的演变。利用系统的蒙特卡罗模拟,我们计算了合作者的平均密度作为一个函数的诱惑,以缺陷。结果表明,数值实验得到的结果强烈依赖于博弈的动力学,这可能会降低无标度拓扑的合作的持久性的重要性。特别地,当允许在游戏的演化中模仿“更差的\rq \rq策略时,系统表现出从活跃状态(合作者和背叛者共存)到吸收状态(只有背叛者生存)的相变。