IDEAS home Printed from https://ideas.repec.org/a/eee/apmaco/v500y2025ics0096300325001304.html
   My bibliography  Save this article

An evolutionary game-based vicsek model with a fixed number of neighbors

Author

Listed:
  • Zhao, Hui
  • Zhang, Zhenyu
  • Tchappi, Igor
  • Li, Li

Abstract

In the face of collective motion, people often face a binary decision: they may interact with others and pay for communication, or they can choose to go alone and forgo these costs. Evolutionary game theory (EGT) emerges in this setting as a crucial paradigm to address this complex issue. In this study, an EGT-based Vicsek with a fixed number of neighbors is proposed. It assumed that the agent had a limited view and just considered a certain number of neighbors. Agents exhibit varying movement patterns depending on the strategies they choose. Each agent's payoff depends on balancing the benefits of group movement against the communication costs with selected neighbors. Using the Fermi rule, individuals adjust their strategies accordingly. The study indicates that agents achieve the highest levels of cooperation and the fastest convergence times in high-density environments. When density is constant, increasing the number of neighbors enhances the synchronization; when the number of neighbors remains unchanged, a lower density leads to better synchronization. Additionally, the results show that EGT could boost the synchronization and accelerate the convergence of self-propelled agents.

Suggested Citation

  • Zhao, Hui & Zhang, Zhenyu & Tchappi, Igor & Li, Li, 2025. "An evolutionary game-based vicsek model with a fixed number of neighbors," Applied Mathematics and Computation, Elsevier, vol. 500(C).
  • Handle: RePEc:eee:apmaco:v:500:y:2025:i:c:s0096300325001304
    DOI: 10.1016/j.amc.2025.129403
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0096300325001304
    Download Restriction: Full text for ScienceDirect subscribers only

    File URL: https://libkey.io/10.1016/j.amc.2025.129403?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.

    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:eee:apmaco:v:500:y:2025:i:c:s0096300325001304. 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: Catherine Liu (email available below). General contact details of provider: https://www.journals.elsevier.com/applied-mathematics-and-computation .

    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.