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: https://arxiv.org/pdf/2604.22563
    File Function: Latest version
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. Ben-Porath, Elchanan & Dekel, Eddie, 1992. "Signaling future actions and the potential for sacrifice," Journal of Economic Theory, Elsevier, vol. 57(1), pages 36-51.
    2. Cheng-Zhong Qin, 2008. "Inducing Cooperation by Self-Stipulated Penalties," Annals of Economics and Finance, Society for AEF, vol. 9(2), pages 385-395, November.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Andrés Perea & Elias Tsakas, 2019. "Limited focus in dynamic games," International Journal of Game Theory, Springer;Game Theory Society, vol. 48(2), pages 571-607, June.
    2. Van Damme, Eric, 2002. "Strategic equilibrium," Handbook of Game Theory with Economic Applications, in: R.J. Aumann & S. Hart (ed.), Handbook of Game Theory with Economic Applications, edition 1, volume 3, chapter 41, pages 1521-1596, Elsevier.
    3. Catonini, Emiliano & De Vito, Nicodemo, 2024. "Cautious belief and iterated admissibility," Journal of Mathematical Economics, Elsevier, vol. 110(C).
    4. Karl WÄrneryd, 1998. "Communication, complexity, and evolutionary stability," International Journal of Game Theory, Springer;Game Theory Society, vol. 27(4), pages 599-609.
    5. Sobel, Joel, 2017. "A note on pre-play communication," University of California at San Diego, Economics Working Paper Series qt68d1t1xg, Department of Economics, UC San Diego.
    6. Govindan, Srihari & Robson, Arthur J., 1998. "Forward Induction, Public Randomization, and Admissibility," Journal of Economic Theory, Elsevier, vol. 82(2), pages 451-457, October.
    7. Mark Bagnoli & Susan G. Watts, 2017. "Voluntary Assurance of Voluntary CSR Disclosure," Journal of Economics & Management Strategy, Wiley Blackwell, vol. 26(1), pages 205-230, February.
    8. Bo Chen & Rajat Deb, 2018. "The role of aggregate information in a binary threshold game," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 51(3), pages 381-414, October.
    9. Ilkka Leppänen, 2020. "Partial commitment in an endogenous timing duopoly," Annals of Operations Research, Springer, vol. 287(2), pages 783-799, April.
    10. Dutta, Rohan & Ishii, Ryosuke, 2016. "Dynamic commitment games, efficiency and coordination," Journal of Economic Theory, Elsevier, vol. 163(C), pages 699-727.
    11. Blume, Andreas & Gneezy, Uri, 2010. "Cognitive forward induction and coordination without common knowledge: An experimental study," Games and Economic Behavior, Elsevier, vol. 68(2), pages 488-511, March.
    12. Dale, Donald J. & Morgan, John & Rosenthal, Robert W., 2002. "Coordination through Reputations: A Laboratory Experiment," Games and Economic Behavior, Elsevier, vol. 38(1), pages 52-88, January.
    13. Stanford, William, 1999. "On the number of pure strategy Nash equilibria in finite common payoffs games," Economics Letters, Elsevier, vol. 62(1), pages 29-34, January.
    14. Vincent J. Vannetelbosch & P. Jean-Jacques Herings, 1999. "Refinements of rationalizability for normal-form games," International Journal of Game Theory, Springer;Game Theory Society, vol. 28(1), pages 53-68.
    15. Blume, Andreas, 1998. "Communication, Risk, and Efficiency in Games," Games and Economic Behavior, Elsevier, vol. 22(2), pages 171-202, February.
    16. Bertomeu, Jeremy & Cheynel, Edwige & Hu, Peicong, 2026. "Disclosure under noisy information processing," MPRA Paper 128905, University Library of Munich, Germany.
    17. David Sally, 2002. "`What an Ugly Baby!'," Rationality and Society, , vol. 14(1), pages 78-108, February.
    18. Perea Andrés, 2003. "Rationalizability and Minimal Complexity in Dynamic Games," Research Memorandum 047, Maastricht University, Maastricht Research School of Economics of Technology and Organization (METEOR).
    19. Gary Charness & Francesco Feri & Miguel A. Meléndez-Jiménez & Matthias Sutter, 2023. "An Experimental Study on the Effects of Communication, Credibility, and Clustering in Network Games," The Review of Economics and Statistics, MIT Press, vol. 105(6), pages 1530-1543, November.
    20. Elias Tsakas & Nikolas Tsakas & Dimitrios Xefteris, 2021. "Resisting persuasion," Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 72(3), pages 723-742, October.

    More about this item

    NEP fields

    This paper has been announced in the following NEP Reports:

    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.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with 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: https://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.