City Research Online

Abstract

We review the behavior of a recently introduced model of agreement dynamics, called the "Naming Game." This model describes the self-organized emergence of linguistic conventions and the establishment of simple communication systems in a population of agents with pairwise local interactions. The mechanisms of convergence towards agreement strongly depend on the network of possible interactions between the agents. In particular, the mean-field case in which all agents communicate with all the others is not efficient, since a large temporary memory is requested for the agents. On the other hand, regular lattice topologies lead to a fast local convergence but to a slow global dynamics similar to coarsening phenomena. The embedding of the agents in a small-world network represents an interesting tradeoff: a local consensus is easily reached, while the long-range links allow to bypass coarsening-like convergence. We also consider alternative adaptive strategies which can lead to faster global convergence.

Publication Type:	Article
Additional Information:	This article may be downloaded for personal use only. Any other use requires prior permission of the author and AIP Publishing. The following article appeared in Barrat, A, Baronchelli, A, Dall'Asta, L & Loreto, V (2007). Agreement dynamics on interaction networks with diverse topologies. Chaos, 17(2), 026111 and may be found at http://dx.doi.org/10.1063/1.2734403.
Subjects:	Q Science > QA Mathematics
Departments:	School of Science & Technology > Mathematics
SWORD Depositor:	Symplectic Administrator

Export

Downloads