How to reach linguistic consensus: a proof of convergence for the naming game.
In this paper we introduce a mathematical model of naming games. Naming games have been widely used within research on the origins and evolution of language. Despite the many interesting empirical results these studies have produced, most of this research lacks a formal elucidating theory. In this paper we show how a population of agents can reach linguistic consensus, i.e. learn to use one common language to communicate with one another. Our approach differs from existing formal work in two important ways: one, we relax the too strong assumption that an agent samples infinitely often during each time interval. This assumption is usually made to guarantee convergence of an empirical learning process to a deterministic dynamical system. Two, we provide a proof that under these new realistic conditions, our model converges to a common language for the entire population of agents. Finally the model is experimentally validated.
De Vylder
Bart
B
Artificial Intelligence Lab, Vrije Universiteit Brussel, Belgium. bartdv@arti.vub.ac.be <bartdv@arti.vub.ac.be>
Tuyls
Karl
K
D005075:Biological Evolution; D032921:Consensus; D005716:Game Theory; D006801:Humans; D007802:Language; D007858:Learning; D008037:Linguistics; D008960:Models, Psychological; D012931:Social Environment