Naming Games in Spatially-Embedded Random Networks

dc.creatorLu, Qiming
dc.creatorKorniss, G.
dc.creatorSzymanski, Boleslaw K.
dc.date2006-04-19
dc.date2007-05-07
dc.date.accessioned2026-07-07T07:59:36Z
dc.date.available2026-07-07T07:59:36Z
dc.descriptionWe investigate a prototypical agent-based model, the Naming Game, on random geometric networks. The Naming Game is a minimal model, employing local communications that captures the emergence of shared communication schemes (languages) in a population of autonomous semiotic agents. Implementing the Naming Games on random geometric graphs, local communications being local broadcasts, serves as a model for agreement dynamics in large-scale, autonomously operating wireless sensor networks. Further, it captures essential features of the scaling properties of the agreement process for spatially-embedded autonomous agents. We also present results for the case when a small density of long-range communication links are added on top of the random geometric graph, resulting in a "small-world"-like network and yielding a significantly reduced time to reach global agreement.
dc.descriptionWe have found a programming error in our code used to generate the results of the earlier version. We have corrected the error, reran all simulations, and regenerated all data plots. While the qualitative behavior of the model has not changed, the numerical values of some of the scaling exponents did. 7 figures
dc.identifierhttps://arxiv.org/abs/cs/0604075
dc.identifierhttp://arxiv.org/abs/cs/0604075
dc.identifierProceedings of the 2006 American Association for Artificial Intelligence Fall Symposium Series, Interaction and Emergent Phenomena in Societies of Agents (AAAI Press, Menlo Park, CA 2006) pp. 148-155
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/128430
dc.subjectMultiagent Systems
dc.subjectStatistical Mechanics
dc.subjectArtificial Intelligence
dc.titleNaming Games in Spatially-Embedded Random Networks
dc.typetext

Files

Collections