Abstract
Asymptotic properties of the symmetric and asymmetric naming games have been studied under some restrictions in a community of agents. In one version, the vocabulary sizes of the agents are restricted to finite capacities. In this case, compared to the original naming games, the dynamics takes much longer time for achieving the consensus. In the second version, the symmetric game starts with a limited number of distinct names distributed among the agents. Three different quantities are measured for a quantitative comparison, namely, the maximum value of the total number of names in the community, the time at which the community attains the maximal number of names, and the global convergence time. Using an extensive numerical study, the entire set of three power law exponents characterizing these quantities are estimated for both the versions which are observed to be distinctly different from their counter parts of the original naming games. © 2017 Elsevier B.V.
| Original language | English |
|---|---|
| Pages (from-to) | 177-187 |
| Number of pages | 11 |
| Journal | Physica A: Statistical Mechanics and its Applications |
| Volume | 478 |
| DOIs | |
| Publication status | Published - 15 Jul 2017 |
Fingerprint
Cite this
}
Asymptotic properties of restricted naming games. / Bhattacherjee, Biplab; Datta, Amitava; Manna, S. S.
In: Physica A: Statistical Mechanics and its Applications, Vol. 478, 15.07.2017, p. 177-187.Research output: Contribution to journal › Article
TY - JOUR
T1 - Asymptotic properties of restricted naming games
AU - Bhattacherjee, Biplab
AU - Datta, Amitava
AU - Manna, S. S.
PY - 2017/7/15
Y1 - 2017/7/15
N2 - Asymptotic properties of the symmetric and asymmetric naming games have been studied under some restrictions in a community of agents. In one version, the vocabulary sizes of the agents are restricted to finite capacities. In this case, compared to the original naming games, the dynamics takes much longer time for achieving the consensus. In the second version, the symmetric game starts with a limited number of distinct names distributed among the agents. Three different quantities are measured for a quantitative comparison, namely, the maximum value of the total number of names in the community, the time at which the community attains the maximal number of names, and the global convergence time. Using an extensive numerical study, the entire set of three power law exponents characterizing these quantities are estimated for both the versions which are observed to be distinctly different from their counter parts of the original naming games. © 2017 Elsevier B.V.
AB - Asymptotic properties of the symmetric and asymmetric naming games have been studied under some restrictions in a community of agents. In one version, the vocabulary sizes of the agents are restricted to finite capacities. In this case, compared to the original naming games, the dynamics takes much longer time for achieving the consensus. In the second version, the symmetric game starts with a limited number of distinct names distributed among the agents. Three different quantities are measured for a quantitative comparison, namely, the maximum value of the total number of names in the community, the time at which the community attains the maximal number of names, and the global convergence time. Using an extensive numerical study, the entire set of three power law exponents characterizing these quantities are estimated for both the versions which are observed to be distinctly different from their counter parts of the original naming games. © 2017 Elsevier B.V.
KW - Critical exponents
KW - Critical phenomena
KW - Naming games
KW - Scaling
KW - Self-organized systems
KW - Structures and organization in complex systems
UR - http://www.scopus.com/inward/record.url?scp=85014839356&partnerID=8YFLogxK
U2 - 10.1016/j.physa.2017.02.070
DO - 10.1016/j.physa.2017.02.070
M3 - Article
VL - 478
SP - 177
EP - 187
JO - PHYSICA A-STATISTICAL MECHANICS AND ITS APPLICATIONS
JF - PHYSICA A-STATISTICAL MECHANICS AND ITS APPLICATIONS
SN - 0378-4371
ER -