Agreement dynamics of finite-memory language games on networks |
| |
Authors: | W X Wang B Y Lin C L Tang G R Chen |
| |
Institution: | (1) Department of Electronic Engineering, City University of Hong Kong, Hong Kong SAR, P.R. China;(2) Department of Modern Physics and Nonlinear Science Center, University of Science and Technology of China, Hefei, 230026, P.R. China |
| |
Abstract: | We propose a Finite-Memory Naming Game (FMNG) model with
respect to the bounded rationality of agents or finite resources for
information storage in communication systems. We study its dynamics
on several kinds of complex networks, including random networks,
small-world networks and scale-free networks. We focus on the
dynamics of the FMNG affected by the memory restriction as well as
the topological properties of the networks. Interestingly, we found
that the most important quantity, the convergence time of reaching
the consensus, shows some non-monotonic behaviors by varying the
average degrees of the networks with the existence of the fastest
convergence at some specific average degrees. We also investigate
other main quantities, such as the success rate in negotiation, the
total number of words in the system and the correlations between
agents of full memory and the total number of words, which clearly
explain the nontrivial behaviors of the convergence. We provide some
analytical results which help better understand the dynamics of the
FMNG. We finally report a robust scaling property of the convergence
time, which is regardless of the network structure and the memory
restriction. |
| |
Keywords: | 89 75 -k Complex systems 05 65 +b Self-organized systems 89 65 Ef Social organizations anthropology |
本文献已被 SpringerLink 等数据库收录! |
|