Automata networks for multi-party communication in the Naming Game
This work addresses the development of linguistic conventions for researchers in computational linguistics and complex systems, but it is incremental as it extends existing Naming Game models with a new formalization.
The authors tackled the problem of modeling multi-party communication in the Naming Game by defining an automata networks approach, and they proved convergence for three different updating schemes while recovering key features through simulations.
The Naming Game has been studied to explore the role of self-organization in the development and negotiation of linguistic conventions. In this paper, we define an automata networks approach to the Naming Game. Two problems are faced: (1) the definition of an automata networks for multi-party communicative interactions; and (2) the proof of convergence for three different orders in which the individuals are updated (updating schemes). Finally, computer simulations are explored in two-dimensional lattices with the purpose to recover the main features of the Naming Game and to describe the dynamics under different updating schemes.