IDEAS home Printed from https://ideas.repec.org/a/kap/theord/v99y2025i1d10.1007_s11238-025-10048-w.html
   My bibliography  Save this article

Payment schemes for finitely repeated Prisoner’s Dilemma games

Author

Listed:
  • Elena M. Parilina

    (Saint Petersburg State University)

  • Alena Pisareva

    (Saint Petersburg State University)

  • Georges Zaccour

    (GERAD, HEC Montréal)

Abstract

In the paper we consider finitely repeated Prisoner’s Dilemma and propose the method of sustaining cooperation based on the $$\varepsilon$$ ε -equilibrium in limited retaliation behavior strategies. The main feature of this strategy is that the punishment of a deviated player does not necessarily last until the end of the game. The duration of punishment depends on the stage when deviation happens and it is not uniquely defined. We propose two payment schemes along the cooperative trajectory to sustain cooperation based on limited retaliation strategies. If the payments in the game are organized following these schemes, when they exist, then players have no incentive to deviate and cooperation is sustainable against individual deviations.

Suggested Citation

  • Elena M. Parilina & Alena Pisareva & Georges Zaccour, 2025. "Payment schemes for finitely repeated Prisoner’s Dilemma games," Theory and Decision, Springer, vol. 99(1), pages 461-490, September.
  • Handle: RePEc:kap:theord:v:99:y:2025:i:1:d:10.1007_s11238-025-10048-w
    DOI: 10.1007/s11238-025-10048-w
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s11238-025-10048-w
    File Function: Abstract
    Download Restriction: Access to full text is restricted to subscribers.

    File URL: https://libkey.io/10.1007/s11238-025-10048-w?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:kap:theord:v:99:y:2025:i:1:d:10.1007_s11238-025-10048-w. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    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.