IDEAS home Printed from https://ideas.repec.org/p/arx/papers/2604.22563.html

Preplay Losing Contracts: Inducing Strong Nash Equilibrium in the $n$-player Prisoner's Dilemma

Author

Listed:
  • Ian Fligler

Abstract

In strategic games such as the prisoner's dilemma, allowing players to make binding offers of utility transfers before play has been shown to alter incentives and potentially support cooperative outcomes. These preplay exchange mechanisms reshape payoffs by transferring utility while being contingent on actions; however, they typically require side payments that can reduce individual benefits relative to joint cooperation. In this paper, we extend the analysis to a finite $n$-player prisoner's dilemma with ordered strategy sets, defined such that any restriction of strategies by any subset of players still yields a prisoner's dilemma. To achieve a robust cooperative outcome that resists group deviations, we introduce a novel class of mechanisms: $\textit{losing contracts}$. Unlike transfer-based preplay mechanisms, losing contracts require players to irrevocably reduce their own utility if they defect, thereby aligning individual incentives with cooperation without inter-player payments. With appropriately chosen loss amounts, losing contracts induce joint cooperation as the unique strong Nash equilibrium in the modified game and in every restricted game within it, ensuring that cooperative incentives persist even under possible external constraints on strategy sets. We show that our contracts can be constructively defined, reducing the preplay stage to a simple and binary decision for each player: whether to sign the contract or not. Furthermore, if the losing contract is only executed when all players sign, signing is a strictly dominant strategy for all. Finally, we extend these results to certain public goods games.

Suggested Citation

  • Ian Fligler, 2026. "Preplay Losing Contracts: Inducing Strong Nash Equilibrium in the $n$-player Prisoner's Dilemma," Papers 2604.22563, arXiv.org.
  • Handle: RePEc:arx:papers:2604.22563
    as

    Download full text from publisher

    File URL: http://arxiv.org/pdf/2604.22563
    File Function: Latest version
    Download Restriction: no
    ---><---

    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:arx:papers:2604.22563. 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: arXiv administrators (email available below). General contact details of provider: http://arxiv.org/ .

    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.