GRA W NAZYWANIE Z PREFERENCYJNYM WYBOREM PARTNERÓW

In this paper, a naming game on an adaptive weighted network is examined. A weight of connection for a given pair of agents depends on their communication success rate and determines the probability with which the agents communicate. When the preference toward successfully communicating agents is not so strong, the model behaves similarly to the naming game on a complete graph. In particular, it quickly reaches a single-language state, albeit some details of the dynamics are different from the complete-graph version. Much different behaviour appears when the preference toward successfully communicating agents is stronger and the model gets trapped in a multi-language regime. In this case gradual coarsening and extinction of languages lead to the emergence of a dominant language, albeit with some other languages still being present. A comparison of distribution of languages in the model and in the human population is discussed.In this paper, a naming game on an adaptive weighted network is examined. A weight of connection for a given pair of agents depends on their communication success rate and determines the probability with which the agents communicate. When the preference toward successfully communicating agents is not so strong, the model behaves similarly to the naming game on a complete graph. In particular, it quickly reaches a single-language state, albeit some details of the dynamics are different from the complete-graph version. Much different behaviour appears when the preference toward successfully communicating agents is stronger and the model gets trapped in a multi-language regime. In this case gradual coarsening and extinction of languages lead to the emergence of a dominant language, albeit with some other languages still being present. A comparison of distribution of languages in the model and in the human population is discussed.

A Chemical Model of the Naming Game

Abstract. A key feature of many biological distributed systems is that they have the capacity to behave in highly coordinated ways. In the domain of language, such coordination dynamics have been studied within the framework of language games. As yet however, a fundamental understanding that goes beyond the simplest cases is still missing. In this paper, a novel approach is proposed for investigating coordination problems. I illustrate the approach for a simple but well studied case called the naming game. I will therefore bring together a number of ideas from Artificial Chemistry and Chemical Reaction Network Theory, Semiotic Dynamics and Immunology, and conclude by arguing why the proposed approach provides a good starting point for tackling more complex coordination problems as well