IDEAS home Printed from https://ideas.repec.org/p/wpa/wuwpga/0404001.html
   My bibliography  Save this paper

Cooperative equilibria in the finite iterated prisoner's dilemma

Author

Listed:
  • Kae Nemoto

    (National Institute of Informatics, Japan)

  • Michael J Gagen

    (Institute for Molecular Bioscience, University of Queensland)

Abstract

Nash equilibria are defined using uncorrelated behavioural or mixed joint probability distributions effectively assuming that players of bounded rationality must discard information to locate equilibria. We propose instead that rational players will use all the information available in correlated distributions to constrain payoff function topologies and gradients to generate novel 'constrained' equilibria, each one a backwards induction pathway optimizing payoffs in the constrained space. In the finite iterated prisoner's dilemma, we locate constrained equilibria maximizing payoffs via cooperation additional to the unconstrained (Nash) equilibrium maximizing payoffs via defection. Our approach clarifies the usual assumptions hidden in backwards induction.

Suggested Citation

  • Kae Nemoto & Michael J Gagen, 2004. "Cooperative equilibria in the finite iterated prisoner's dilemma," Game Theory and Information 0404001, University Library of Munich, Germany.
    • Handle: RePEc:wpa:wuwpga:0404001
    Note: Type of Document - pdf; pages: 15
    as

    Download full text from publisher

    File URL: https://econwpa.ub.uni-muenchen.de/econ-wp/game/papers/0404/0404001.pdf
    Download Restriction: no
    ---><---

    More about this item

    Keywords

    finite iterated prisoner's dilemma; Nash equilibria; constrained optimization; backwards induction; expected payoff ensemble;
    All these keywords.

    JEL classification:

    • C72 - Mathematical and Quantitative Methods - - Game Theory and Bargaining Theory - - - Noncooperative Games
    • C61 - Mathematical and Quantitative Methods - - Mathematical Methods; Programming Models; Mathematical and Simulation Modeling - - - Optimization Techniques; Programming Models; Dynamic Analysis

    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:wpa:wuwpga:0404001. 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: EconWPA (email available below). General contact details of provider: https://econwpa.ub.uni-muenchen.de .

    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.