The Grounded Naming Game

2012 ◽  
pp. 41-59 ◽  
Author(s):  
Luc Steels ◽  
Martin Loetzsch
Keyword(s):  
Naming Game

The naming game: A discrepancy among the medical community

2015 ◽  
Vol 29 (3) ◽  
pp. 285-289 ◽  
Author(s):  
Marios Loukas ◽  
Islam Aly ◽  
R. Shane Tubbs ◽  
Robert H. Anderson
Keyword(s):  
Medical Community ◽  
Naming Game

Word diversity can accelerate consensus in naming game

2012 ◽  
Vol 21 (3) ◽  
pp. 030205 ◽  
Author(s):  
Xiao-Dan Zhang ◽  
Zhen Wang ◽  
Fei-Fei Zheng ◽  
Miao Yang
Keyword(s):  
Naming Game

scholarly journals Analysis of the high-dimensional naming game with committed minorities

2016 ◽  
Vol 93 (5) ◽  
Author(s):  
William Pickering ◽  
Boleslaw K. Szymanski ◽  
Chjan Lim
Keyword(s):  
High Dimensional ◽  
Naming Game

scholarly journals The naming game in language dynamics revisited

2014 ◽  
Vol 51 (A) ◽  
pp. 139-158
Author(s):  
Nicolas Lanchier
Keyword(s):  
Mean Field ◽  
Field Approximation ◽  
Point Of View ◽  
Mean Field Approximation ◽  
Complete Graphs ◽  
Naming Game ◽  
Limiting Behavior ◽  
Linguistic Convention ◽  
Regular Lattices ◽  
The One

In this article we study a biased version of the naming game in which players are located on a connected graph and interact through successive conversations in order to select a common name for a given object. Initially, all the players use the same word B except for one bilingual individual who also uses word A. Both words are attributed a fitness, which measures how often players speak depending on the words they use and how often each word is spoken by bilingual individuals. The limiting behavior depends on a single parameter, ϕ, denoting the ratio of the fitness of word A to the fitness of word B. The main objective is to determine whether word A can invade the system and become the new linguistic convention. From the point of view of the mean-field approximation, invasion of word A is successful if and only if ϕ > 3, a result that we also prove for the process on complete graphs relying on the optimal stopping theorem for supermartingales and random walk estimates. In contrast, for the process on the one-dimensional lattice, word A can invade the system whenever ϕ > 1.053, indicating that the probability of invasion and the critical value for ϕ strongly depend on the degree of the graph. The system on regular lattices in higher dimensions is also studied by comparing the process with percolation models.

scholarly journals modeling category coordination: comments and complications

2005 ◽  
Vol 28 (4) ◽  
pp. 496-497
Author(s):  
james a. hampton
Keyword(s):  
Social Status ◽  
Naming Game ◽  
The Social

consideration of color alone can give a misleading impression of the three approaches to category coordination: the nativist, empiricist and culturalist models. empiricist models can benefit from a wider range of correlational information in the environment. also, all three approaches may explain a set of perceptual categories within the human repertoire. finally, a suggestion is offered for supplementing the naming game by varying the social status of agents.

scholarly journals Naming Game on Networks: Let Everyone be Both Speaker and Hearer

2014 ◽  
Vol 4 (1) ◽  
Author(s):  
Yuan Gao ◽  
Guanrong Chen ◽  
Rosa H. M. Chan
Keyword(s):  
Naming Game
Sign in / Sign up

Export Citation Format

Share Document