IDEAS home Printed from https://ideas.repec.org/a/eee/apmaco/v525y2026ics0096300326001256.html

The survival of the weakest in a biased donation game

Author

Listed:
  • Wang, Chaoqian
  • Li, Jingyang
  • Wang, Xinwei
  • Zhu, Wenqiang
  • Szolnoki, Attila

Abstract

Cooperating first then mimicking the partner’s act has been proven to be effective in utilizing reciprocity in social dilemmas. However, the extent to which this, called Tit-for-Tat strategy, should be regarded as equivalent to unconditional cooperators remains controversial. Here, we introduce a biased Tit-for-Tat (T) strategy that cooperates differently toward unconditional cooperators (C) and fellow T players through independent bias parameters. The results show that, even under strong dilemmas in the donation game framework, this three-strategy system can exhibit diverse phase diagrams on the parameter plane. In particular, when T-bias is small and C-bias is large, a “hidden T phase” emerges, in which the weakest T strategy dominates. The dominance of the weakened T strategy originates from a counterintuitive mechanism characterizing non-transitive ecological systems: T suppresses its relative fitness to C, rapidly eliminates the cyclic dominance clusters, and subsequently expands slowly to take over the entire population. Analysis in well-mixed populations confirms that this phenomenon arises from structured populations. Our study thus reveals the subtle role of bias regulation in cooperative modes by emphasizing the “survival of the weakest” effect in a broader context.

Suggested Citation

  • Wang, Chaoqian & Li, Jingyang & Wang, Xinwei & Zhu, Wenqiang & Szolnoki, Attila, 2026. "The survival of the weakest in a biased donation game," Applied Mathematics and Computation, Elsevier, vol. 525(C).
  • Handle: RePEc:eee:apmaco:v:525:y:2026:i:c:s0096300326001256
    DOI: 10.1016/j.amc.2026.130073
    as

    Download full text from publisher

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

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

    for a different version of it.

    More about this item

    Keywords

    ;
    ;
    ;
    ;

    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:eee:apmaco:v:525:y:2026:i:c:s0096300326001256. 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.