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

Aspiration-based full cooperation in finite systems of players

Author

Listed:
  • Płatkowski, Tadeusz

Abstract

We propose a mathematical model of evolution of a finite well-mixed population of players who change their behavior if the payoff obtained from Prisoner’s Dilemma based interactions is smaller than a threshold (aspiration level). The threshold can be a fixed constant or a dynamical variable, which depends on some overall dynamically changing characteristics of the system. We investigate the dependence of full cooperation on the group size, game payoffs, aspiration level, and heterogeneity of the system. For endogenous aspirations we find analytically conditions which guarantee full cooperation in the long run for all initial configurations and group sizes. The result is robust to a stochastic choice of strategies by the heterogeneous players, as documented by numerical simulations.

Suggested Citation

  • Płatkowski, Tadeusz, 2015. "Aspiration-based full cooperation in finite systems of players," Applied Mathematics and Computation, Elsevier, vol. 251(C), pages 46-54.
    • Handle: RePEc:eee:apmaco:v:251:y:2015:i:c:p:46-54
    DOI: 10.1016/j.amc.2014.11.054
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0096300314015860
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.amc.2014.11.054?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:251:y:2015:i:c:p:46-54. 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.