IDEAS home Printed from https://ideas.repec.org/a/plo/pone00/0244814.html
   My bibliography  Save this article

Dynamic aspiration based on Win-Stay-Lose-Learn rule in spatial prisoner’s dilemma game

Author

Listed:
  • Zhenyu Shi
  • Wei Wei
  • Xiangnan Feng
  • Xing Li
  • Zhiming Zheng

Abstract

Prisoner’s dilemma game is the most commonly used model of spatial evolutionary game which is considered as a paradigm to portray competition among selfish individuals. In recent years, Win-Stay-Lose-Learn, a strategy updating rule base on aspiration, has been proved to be an effective model to promote cooperation in spatial prisoner’s dilemma game, which leads aspiration to receive lots of attention. In this paper, according to Expected Value Theory and Achievement Motivation Theory, we propose a dynamic aspiration model based on Win-Stay-Lose-Learn rule in which individual’s aspiration is inspired by its payoff. It is found that dynamic aspiration has a significant impact on the evolution process, and different initial aspirations lead to different results, which are called Stable Coexistence under Low Aspiration, Dependent Coexistence under Moderate aspiration and Defection Explosion under High Aspiration respectively. Furthermore, a deep analysis is performed on the local structures which cause defectors’ re-expansion, the concept of END- and EXP-periods are used to justify the mechanism of network reciprocity in view of time-evolution, typical feature nodes for defectors’ re-expansion called Infectors, Infected nodes and High-risk cooperators respectively are found. Compared to fixed aspiration model, dynamic aspiration introduces a more satisfactory explanation on population evolution laws and can promote deeper comprehension for the principle of prisoner’s dilemma.

Suggested Citation

  • Zhenyu Shi & Wei Wei & Xiangnan Feng & Xing Li & Zhiming Zheng, 2021. "Dynamic aspiration based on Win-Stay-Lose-Learn rule in spatial prisoner’s dilemma game," PLOS ONE, Public Library of Science, vol. 16(1), pages 1-22, January.
  • Handle: RePEc:plo:pone00:0244814
    DOI: 10.1371/journal.pone.0244814
    as

    Download full text from publisher

    File URL: https://journals.plos.org/plosone/article?id=10.1371/journal.pone.0244814
    Download Restriction: no

    File URL: https://journals.plos.org/plosone/article/file?id=10.1371/journal.pone.0244814&type=printable
    Download Restriction: no

    File URL: https://libkey.io/10.1371/journal.pone.0244814?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
    ---><---

    Citations

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


    Cited by:

    1. Shi, Zhenyu & Wei, Wei & Perc, Matjaž & Li, Baifeng & Zheng, Zhiming, 2022. "Coupling group selection and network reciprocity in social dilemmas through multilayer networks," Applied Mathematics and Computation, Elsevier, vol. 418(C).
    2. Zhu, Wenqiang & Pan, Qiuhui & Song, Sha & He, Mingfeng, 2023. "Effects of exposure-based reward and punishment on the evolution of cooperation in prisoner’s dilemma game," Chaos, Solitons & Fractals, Elsevier, vol. 172(C).
    3. Shi, Zhenyu & Wei, Wei & Feng, Xiangnan & Zhang, Ruizhi & Zheng, Zhiming, 2021. "Effects of dynamic-Win-Stay-Lose-Learn model with voluntary participation in social dilemma," Chaos, Solitons & Fractals, Elsevier, vol. 151(C).
    4. Shi, Zhenyu & Wei, Wei & Zheng, Hongwei & Zheng, Zhiming, 2023. "Bidirectional supervision: An effective method to suppress corruption and defection under the third party punishment mechanism of donation games," Applied Mathematics and Computation, Elsevier, vol. 450(C).

    More about this item

    Statistics

    Access and download statistics

    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:plo:pone00:0244814. 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: plosone (email available below). General contact details of provider: https://journals.plos.org/plosone/ .

    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.