Related links

Authoritative: http://dx.doi.org/10.1063/1.2734403   (Publisher's PDF... likely be available here.)

Web search: Google Web Search   ::   Google Scholar

Within this site: Cited by (1)    References (39)

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.(c) 2007 American Institute of Physics.

@article{barrat07agreementDynamicsCHAOS,
  author={Alain Barrat and Andrea Baronchelli and Luca Dall'Asta and Vittorio Loreto},
  title={Agreement dynamics on interaction networks with diverse topologies},
  journal={Chaos},
  year={2007},
  month={JUN},
  volume={17},
  number={2},
  doi={10.1063/1.2734403},
  url={http://www.isrl.uiuc.edu/~amag/langev/paper/barrat07agreementDynamicsCHAOS.html}
}