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

Past-performance-driven strategy updating promote cooperation in the spatial prisoner's dilemma game

Author

Listed:
  • Lu, Shounan
  • Wang, Yang

Abstract

Strategy update rules play an important role in repeated Prisoner's Dilemma games. This work proposes a modified strategy update rule based on the traditional Fermi function, in which individual past performance is taken into account in strategy update. Then, the consistency aspiration α serves as a benchmark to measure an individual's past performance, and the past performance score is dynamically adjusted during the evolution process according to the BM reinforcement learning rules. The computational results indicate that the proposed modified strategy update rules can significantly improve system cooperation t than the traditional version, and the network reciprocity effect is enhanced as the result of past performance is coupled into the strategy update rule. Moreover, different temptation to defection b exist a corresponding aspiration α result in maximizing system cooperation. Furthermore, an optimal sensitivity level β can also result in a maximizing system cooperation. As a whole, for α − β phase diagram, different a will correspond to an optimal value β that allows the system to achieve the maximum cooperation. Finally, the proposed mechanism is robust. Hopefully this can help to inspire further research on how to deal with social dilemmas.

Suggested Citation

  • Lu, Shounan & Wang, Yang, 2025. "Past-performance-driven strategy updating promote cooperation in the spatial prisoner's dilemma game," Applied Mathematics and Computation, Elsevier, vol. 491(C).
  • Handle: RePEc:eee:apmaco:v:491:y:2025:i:c:s0096300324006817
    DOI: 10.1016/j.amc.2024.129220
    as

    Download full text from publisher

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

    File URL: https://libkey.io/10.1016/j.amc.2024.129220?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:491:y:2025:i:c:s0096300324006817. 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.