IDEAS home Printed from https://ideas.repec.org/a/spr/eurphb/v60y2007i4p529-536.html
   My bibliography  Save this article

Agreement dynamics of finite-memory language games on networks

Author

Listed:
  • W. X. Wang
  • B. Y. Lin
  • C. L. Tang
  • G. R. Chen

Abstract

We propose a Finite-Memory Naming Game (FMNG) model with respect to the bounded rationality of agents or finite resources for information storage in communication systems. We study its dynamics on several kinds of complex networks, including random networks, small-world networks and scale-free networks. We focus on the dynamics of the FMNG affected by the memory restriction as well as the topological properties of the networks. Interestingly, we found that the most important quantity, the convergence time of reaching the consensus, shows some non-monotonic behaviors by varying the average degrees of the networks with the existence of the fastest convergence at some specific average degrees. We also investigate other main quantities, such as the success rate in negotiation, the total number of words in the system and the correlations between agents of full memory and the total number of words, which clearly explain the nontrivial behaviors of the convergence. We provide some analytical results which help better understand the dynamics of the FMNG. We finally report a robust scaling property of the convergence time, which is regardless of the network structure and the memory restriction. Copyright EDP Sciences/Società Italiana di Fisica/Springer-Verlag 2007

Suggested Citation

  • W. X. Wang & B. Y. Lin & C. L. Tang & G. R. Chen, 2007. "Agreement dynamics of finite-memory language games on networks," The European Physical Journal B: Condensed Matter and Complex Systems, Springer;EDP Sciences, vol. 60(4), pages 529-536, December.
    • Handle: RePEc:spr:eurphb:v:60:y:2007:i:4:p:529-536
    DOI: 10.1140/epjb/e2008-00013-5
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1140/epjb/e2008-00013-5
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1140/epjb/e2008-00013-5?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Lou, Yang & Chen, Guanrong & Hu, Jianwei, 2018. "Communicating with sentences: A multi-word naming game model," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 490(C), pages 857-868.
    2. Qiming Lu & G. Korniss & Boleslaw Szymanski, 2009. "The Naming Game in social networks: community formation and consensus engineering," Journal of Economic Interaction and Coordination, Springer;Society for Economic Science with Heterogeneous Interacting Agents, vol. 4(2), pages 221-235, November.
    3. Zhou, Jianfeng & Lou, Yang & Chen, Guanrong & Tang, Wallace K.S., 2018. "Multi-language naming game," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 496(C), pages 620-634.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:eurphb:v:60:y:2007:i:4:p:529-536. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.