publication . Preprint . 2014

Naming game with learning errors in communications

Lou, Yang; Chen, Guanrong;
Open Access English
  • Published: 17 Dec 2014
Abstract
Naming game simulates the process of naming an objective by a population of agents organized in a certain communication network topology. By pair-wise iterative interactions, the population reaches a consensus state asymptotically. In this paper, we study naming game with communication errors during pair-wise conversations, where errors are represented by error rates in a uniform probability distribution. First, a model of naming game with learning errors in communications (NGLE) is proposed. Then, a strategy for agents to prevent learning errors is suggested. To that end, three typical topologies of communication networks, namely random-graph, small-world and s...
Subjects
free text keywords: Computer Science - Social and Information Networks, Physics - Physics and Society
Related Organizations
Download from

[1] Baronchelli, A. The minimal naming game: a complex systems approach. Experiments in Language Evolution. Luc Steels (ed.). Amsterdam: John Benjamins Co., (2012).

[2] Wang, W. X., Lin, B. Y., Tang, C. L. & Chen, G. R. Agreement dynamics of finite-memory language games on networks. The European Physical Journal B-Condensed Matter and Complex Systems, 60(4), 529-536 (2007).

[3] Lu, Q., Korniss, G., & Szymanski, B. K. The naming game in social networks: community formation and consensus engineering. Journal of Economic Interaction and Coordination, 4(2), 221-235 (2009). [OpenAIRE]

[4] Li, B., Chen, G. R., & Chow, T. W. Naming game with multiple hearers. Communications in Nonlinear Science and Numerical Simulation, 18(5), 1214-1228 (2013).

[5] Gao, Y., Chen, G. R., & Chan, R. H. M. Naming game on networks: let everyone be both speaker and hearer. Scientific Reports, 4, 6149, 1-9 (2014).

[6] Nowak, M. A., Plotkin, J. B., & Krakauer, D. C. The evolutionary language game. Journal of Theoretical Biology 200(2), 147-162 (1999). [OpenAIRE]

[7] Lim, C. C., & Zhang, W. Noisy naming games, partial synchronization and coarse-graining in social networks. In Network Science Workshop (NSW), IEEE, 25-29 (2011).

[8] Liu, R. R., Jia, C. X., Yang, H. X., & Wang, B. H. Naming game on small-world networks with geographical effects. Physica A: Statistical Mechanics and its Applications, 388(17), 3615-3620 (2009).

[9] Dall'Asta, L., Baronchelli, A., Barrat, A., & Loreto, V. Nonequilibrium dynamics of language games on complex networks. Physical Review E, 74(3), 036105 (2006).

[10] Erdős, P., & Rényi, A. On the strength of connectedness of a random graph. Acta Mathematica Hungarica, 12(1), 261-267 (1961).

[11] Watts, D. J., & Strogatz, S. H. Collective dynamics of 'small-world' networks, Nature, 393(6684), 440-442 (1998).

[12] Baronchelli, A., Dall'Asta, L., Barrat, A., & Loreto, V. The role of topology on the dynamics of the naming game. The European Physical Journal-Special Topics, 143(1), 233-235 (2007). [OpenAIRE]

[13] Baronchelli, A., Loreto, V., & Steels, L. In-depth analysis of the naming game dynamics: the homogeneous mixing case. International Journal of Modern Physics C, 19(5), 785-812 (2008). [OpenAIRE]

[14] Lou, Y. & Chen, G. Supplementary information for the manuscript “Naming game with learning errors in communications”, http://www.ee.cityu.edu.hk/~gchen/pdf/NGLE-SI.pdf 1.0000 +0.1785 +0.1827 +0.2084 +0.1518 +0.1642 +0.1485 +0.1749 +0.0888 +0.1443 +0.2334 +0.1067 +0.0574 +0.0925 +0.1268 +0.1356 +0.1527 +0.2858 +0.1217 −0.0002 +0.1560 +0.1110 +0.0558 +0.2607 22+/1−

Powered by OpenAIRE Research Graph
Any information missing or wrong?Report an Issue