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

Leveraging surrounding past strategies to maintain cooperation in the perverse prisoner's dilemma

Author

Listed:
  • Takahara, Akihiro
  • Sakiyama, Tomoko

Abstract

In spatial game theory, developed models preserving cooperators often incorporate memory to enhance realism. This study examined the role of memory in a spatial prisoner's dilemma. In the proposed model, all players use their own and their neighbors’ past memories and current states to update strategies under specific conditions. When a player's score is lower than that of a neighbor using the same strategy, and that neighbor has the highest score among all neighbors, the player revisits past strategies and adopts a less experienced strategy. This rule adjusts behavior under unfavorable conditions. Results showed that the proposed model effectively retains cooperators. Previous studies have often necessitated the use of long-term memory and intricate systems; however, the present model eliminates these requirements. Instead, it sustains cooperation by employing a strategy that relies on minimal historical information when determining the subsequent course of action.

Suggested Citation

  • Takahara, Akihiro & Sakiyama, Tomoko, 2025. "Leveraging surrounding past strategies to maintain cooperation in the perverse prisoner's dilemma," Applied Mathematics and Computation, Elsevier, vol. 493(C).
  • Handle: RePEc:eee:apmaco:v:493:y:2025:i:c:s0096300324007331
    DOI: 10.1016/j.amc.2024.129272
    as

    Download full text from publisher

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

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