2015/10/08 by Javier Vera, Vera, Javier, Pedro Montealegre +3
Biochemistry, Genetics and Molecular Biology · Computer Science · #Cellular Automata and Applications #Computability, Logic, AI Algorithms #Computation and Language (cs.CL) #DNA and Biological Computing #FOS: Computer and information sciences
paper · pdf · doi:10.48550/arxiv.1510.02358
openalex publication_date 2015/10/08 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
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.