title: Naming game on networks: let everyone be both speaker and hearer.
abstract: To investigate how consensus is reached on a large self-organized peer-to-peer network, we extended the naming game model commonly used in language and communication to Naming Game in Groups (NGG). Differing from other existing naming game models, in NGG everyone in the population (network) can be both speaker and hearer simultaneously, which resembles in a closer manner to real-life scenarios. Moreover, NGG allows the transmission (communication) of multiple words (opinions) for multiple intra-group consensuses. The communications among indirectly-connected nodes are also enabled in NGG. We simulated and analyzed the consensus process in some typical network topologies, including random-graph networks, small-world networks and scale-free networks, to better understand how global convergence (consensus) could be reached on one common word. The results are interpreted on group negotiation of a peer-to-peer network, which shows that global consensus in the population can be reached more rapidly when more opinions are permitted within each group or when the negotiating groups in the population are larger in size. The novel features and properties introduced by our model have demonstrated its applicability in better investigating general consensus problems on peer-to-peer networks.
authors.affiliation: Department of Electronic Engineering, City University of Hong Kong.
authors.forename: Yuan
authors.initials: Y
authors.lastname: Gao
authors.affiliation: Department of Electronic Engineering, City University of Hong Kong.
authors.forename: Guanrong
authors.initials: G
authors.lastname: Chen
authors.affiliation: Department of Electronic Engineering, City University of Hong Kong.
authors.forename: Rosa H M
authors.initials: RH
authors.lastname: Chan
mesh_terms: D000465:Algorithms; D005716:Game Theory; D006801:Humans; D008962:Models, Theoretical; D060756:Social Networking