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

More Players, Less Cooperation? Evolution of Conditional Cooperation in the N-player Iterated Prisoner’s Dilemma Game

Author

Listed:
  • Zeng, Weijun
  • Li, Minqiang

Abstract

The N-player iterated prisoner’s dilemma (IPD) game well manifests conflicts of interest in social dilemma, such as contribution vs. free-riding in digital commons and sharing data or not in federated learning. This paper explores the effects of the benefit-to-cost ratio and the number of players on the emergence of cooperation in the N-player IPD game. Theoretical conditions on the benefit-to-cost ratio are first derived to ensure the optimality of simultaneous cooperation for any player subset, thereby precluding partial defection and promoting conditional cooperation among the players. A conditional-cooperation mechanism based on social comparison is then proposed to evolve the expected cooperation. Simulation results demonstrate that the proposed mechanism effectively facilitates the evolution of conditional cooperation. Interestingly, a larger number of players leads to a higher cooperation level when the value of the benefit-to-cost ratio over the number of players is kept constant, in that the players’ incentive to cooperate scales with the number of players in the game while the per capita benefit of cooperation remains invariant. This holds in both well-mixed and network-structured interactions. Furthermore, breaking down boundaries of clusters of players is observed to further promote the conditional cooperation, contrasting with prior findings that clustering fosters cooperation. This occurs because low clustering facilitates the spread of conditional cooperation among players under social comparison. Finally, the obtained conditional-cooperation results prove quite robust against uncertain payoffs and noise occurrences.

Suggested Citation

  • Zeng, Weijun & Li, Minqiang, 2026. "More Players, Less Cooperation? Evolution of Conditional Cooperation in the N-player Iterated Prisoner’s Dilemma Game," Applied Mathematics and Computation, Elsevier, vol. 526(C).
  • Handle: RePEc:eee:apmaco:v:526:y:2026:i:c:s0096300326001037
    DOI: 10.1016/j.amc.2026.130051
    as

    Download full text from publisher

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

    File URL: https://libkey.io/10.1016/j.amc.2026.130051?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:526:y:2026:i:c:s0096300326001037. 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.