IDEAS home Printed from https://ideas.repec.org/p/hal/journl/halshs-01204780.html
   My bibliography  Save this paper

Plausible cooperation

Author

Listed:
  • Olivier Compte

    (PSE - Paris-Jourdan Sciences Economiques - ENS-PSL - École normale supérieure - Paris - PSL - Université Paris Sciences et Lettres - INRA - Institut National de la Recherche Agronomique - EHESS - École des hautes études en sciences sociales - ENPC - École des Ponts ParisTech - CNRS - Centre National de la Recherche Scientifique, PSE - Paris School of Economics - UP1 - Université Paris 1 Panthéon-Sorbonne - ENS-PSL - École normale supérieure - Paris - PSL - Université Paris Sciences et Lettres - EHESS - École des hautes études en sciences sociales - ENPC - École des Ponts ParisTech - CNRS - Centre National de la Recherche Scientifique - INRAE - Institut National de Recherche pour l’Agriculture, l’Alimentation et l’Environnement)

  • Andrew Postlewaite

    (University of Pennsylvania)

Abstract

There is a large repeated games literature illustrating how future interactions provide incentives for cooperation. Much of the earlier literature assumes public monitoring. Departures from public monitoring to private monitoring that incorporate differences in players' observations may dramatically complicate coordination and the provision of incentives, with the consequence that equilibria with private monitoring often seem unrealistically complex or fragile. We set out a model in which players accomplish cooperation in an intuitively plausible fashion. Players process information via a mental system – a set of psychological states and a transition function between states depending on observations. Players restrict attention to a relatively small set of simple strategies, and consequently, might learn which perform well.

Suggested Citation

  • Olivier Compte & Andrew Postlewaite, 2015. "Plausible cooperation," Post-Print halshs-01204780, HAL.
  • Handle: RePEc:hal:journl:halshs-01204780
    as

    Download full text from publisher

    To our knowledge, this item is not available for download. To find whether it is available, there are three options:
    1. Check below whether another version of this item is available online.
    2. Check on the provider's web page whether it is in fact available.
    3. Perform a search for a similarly titled item that would be available.

    Other versions of this item:

    References listed on IDEAS

    as
    1. Michihiro Kandori & Ichiro Obara, 2007. "Finite State Equilibria in Dynamic Games," 2007 Meeting Papers 253, Society for Economic Dynamics.
    2. Bagwell, Kyle, 1995. "Commitment and observability in games," Games and Economic Behavior, Elsevier, vol. 8(2), pages 271-280.
    3. Christopher Phelan & Andrzej Skrzypacz, 2006. "Private monitoring with infinite histories," Staff Report 383, Federal Reserve Bank of Minneapolis.
    4. Ben-porath, Elchanan, 1990. "The complexity of computing a best response automaton in repeated games with mixed strategies," Games and Economic Behavior, Elsevier, vol. 2(1), pages 1-12, March.
    5. Neyman, Abraham, 1985. "Bounded complexity justifies cooperation in the finitely repeated prisoners' dilemma," Economics Letters, Elsevier, vol. 19(3), pages 227-229.
    6. Ely, Jeffrey C. & Valimaki, Juuso, 2002. "A Robust Folk Theorem for the Prisoner's Dilemma," Journal of Economic Theory, Elsevier, vol. 102(1), pages 84-105, January.
    7. Abraham Neyman, 1998. "Finitely Repeated Games with Finite Automata," Mathematics of Operations Research, INFORMS, vol. 23(3), pages 513-552, August.
    8. Kalai, Ehud & Stanford, William, 1988. "Finite Rationality and Interpersonal Complexity in Repeated Games," Econometrica, Econometric Society, vol. 56(2), pages 397-410, March.
    9. Mailath, George J. & Morris, Stephen, 2002. "Repeated Games with Almost-Public Monitoring," Journal of Economic Theory, Elsevier, vol. 102(1), pages 189-228, January.
    10. Sekiguchi, Tadashi, 1997. "Efficiency in Repeated Prisoner's Dilemma with Private Monitoring," Journal of Economic Theory, Elsevier, vol. 76(2), pages 345-361, October.
    11. Compte, Olivier, 2002. "On Sustaining Cooperation without Public Observations," Journal of Economic Theory, Elsevier, vol. 102(1), pages 106-150, January.
    12. Eitan Altman & Konstantin Avrachenkov & Richard Marquez & Gregory Miller, 2005. "Zero-sum constrained stochastic games with independent state processes," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 62(3), pages 375-386, December.
    13. Abreu, Dilip & Rubinstein, Ariel, 1988. "The Structure of Nash Equilibrium in Repeated Games with Finite Automata," Econometrica, Econometric Society, vol. 56(6), pages 1259-1281, November.
    14. Ben-Porath Elchanan, 1993. "Repeated Games with Finite Automata," Journal of Economic Theory, Elsevier, vol. 59(1), pages 17-32, February.
    15. Rubinstein, Ariel, 1986. "Finite automata play the repeated prisoner's dilemma," Journal of Economic Theory, Elsevier, vol. 39(1), pages 83-96, June.
    16. Piccione, Michele, 2002. "The Repeated Prisoner's Dilemma with Imperfect Private Monitoring," Journal of Economic Theory, Elsevier, vol. 102(1), pages 70-83, January.
    17. Andrew Postlewaite & Olivier Compte, 2008. "Repeated Relationships with Limits on Information Processing," PIER Working Paper Archive 08-026, Penn Institute for Economic Research, Department of Economics, University of Pennsylvania.
    18. Christine Hauser & Hugo Hopenhayn, 2008. "Trading Favors: Optimal Exchange and Forgiveness," Carlo Alberto Notebooks 88, Collegio Carlo Alberto.
    19. Olivier Compte, 1998. "Communication in Repeated Games with Imperfect Private Monitoring," Econometrica, Econometric Society, vol. 66(3), pages 597-626, May.
    20. Abreu, Dilip, 1986. "Extremal equilibria of oligopolistic supergames," Journal of Economic Theory, Elsevier, vol. 39(1), pages 191-225, June.
    21. Olivier Compte & Andrew Postlewaite, 2013. "Belief free equilibria," PIER Working Paper Archive 13-020, Penn Institute for Economic Research, Department of Economics, University of Pennsylvania.
    22. Gilboa, Itzhak, 1988. "The complexity of computing best-response automata in repeated games," Journal of Economic Theory, Elsevier, vol. 45(2), pages 342-352, August.
    23. Okuno-Fujiwara Masahiro & Postlewaite Andrew, 1995. "Social Norms and Random Matching Games," Games and Economic Behavior, Elsevier, vol. 9(1), pages 79-109, April.
    24. Michihiro Kandori, 1992. "Social Norms and Community Enforcement," The Review of Economic Studies, Review of Economic Studies Ltd, vol. 59(1), pages 63-80.
    25. Michihiro Kandori & Hitoshi Matsushima, 1998. "Private Observation, Communication and Collusion," Econometrica, Econometric Society, vol. 66(3), pages 627-652, May.
    26. Kalai, Ehud & Samet, Dov & Stanford, William, 1988. "A Note on Reactive Equilibria in the Discounted Prisoner's Dilemma and Associated Games," International Journal of Game Theory, Springer;Game Theory Society, vol. 17(3), pages 177-186.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Jehiel, Philippe & Samuelson, Larry, 2023. "The analogical foundations of cooperation," Journal of Economic Theory, Elsevier, vol. 208(C).

    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. Olivier Compte & Andrew Postlewaite, 2007. "Effecting Cooperation," PIER Working Paper Archive 09-019, Penn Institute for Economic Research, Department of Economics, University of Pennsylvania, revised 29 May 2009.
    2. Oliver Compte & Andrew Postlewaite, 2010. "Plausible Cooperation, Fourth Version," PIER Working Paper Archive 15-006, Penn Institute for Economic Research, Department of Economics, University of Pennsylvania, revised 23 Jan 2015.
    3. Andrew Postlewaite & Olivier Compte, 2008. "Repeated Relationships with Limits on Information Processing," PIER Working Paper Archive 08-026, Penn Institute for Economic Research, Department of Economics, University of Pennsylvania.
    4. Kandori, Michihiro, 2002. "Introduction to Repeated Games with Private Monitoring," Journal of Economic Theory, Elsevier, vol. 102(1), pages 1-15, January.
    5. Mailath, George J. & Morris, Stephen, 2002. "Repeated Games with Almost-Public Monitoring," Journal of Economic Theory, Elsevier, vol. 102(1), pages 189-228, January.
    6. Renault, Jérôme & Scarsini, Marco & Tomala, Tristan, 2008. "Playing off-line games with bounded rationality," Mathematical Social Sciences, Elsevier, vol. 56(2), pages 207-223, September.
    7. Hubie Chen, 2013. "Bounded rationality, strategy simplification, and equilibrium," International Journal of Game Theory, Springer;Game Theory Society, vol. 42(3), pages 593-611, August.
    8. Ehud Kalai, 1995. "Games," Discussion Papers 1141, Northwestern University, Center for Mathematical Studies in Economics and Management Science.
    9. , H. & ,, 2016. "Approximate efficiency in repeated games with side-payments and correlated signals," Theoretical Economics, Econometric Society, vol. 11(1), January.
    10. , J. & ,, 2006. "Coordination failure in repeated games with almost-public monitoring," Theoretical Economics, Econometric Society, vol. 1(3), pages 311-340, September.
    11. Hernández, Penélope & Urbano, Amparo, 2008. "Codification schemes and finite automata," Mathematical Social Sciences, Elsevier, vol. 56(3), pages 395-409, November.
    12. Mailath, George J. & Olszewski, Wojciech, 2011. "Folk theorems with bounded recall under (almost) perfect monitoring," Games and Economic Behavior, Elsevier, vol. 71(1), pages 174-192, January.
    13. Fabian Dvorak & Sebastian Fehrler, 2024. "Negotiating Cooperation under Uncertainty: Communication in Noisy, Indefinitely Repeated Interactions," American Economic Journal: Microeconomics, American Economic Association, vol. 16(3), pages 232-258, August.
    14. Drew Fudenberg & David K. Levine, 2008. "The Nash-threats folk theorem with communication and approximate common knowledge in two player games," World Scientific Book Chapters, in: Drew Fudenberg & David K Levine (ed.), A Long-Run Collaboration On Long-Run Games, chapter 15, pages 331-343, World Scientific Publishing Co. Pte. Ltd..
    15. Ueda, Masahiko, 2023. "Memory-two strategies forming symmetric mutual reinforcement learning equilibrium in repeated prisoners’ dilemma game," Applied Mathematics and Computation, Elsevier, vol. 444(C).
    16. Aumann, Robert J., 1997. "Rationality and Bounded Rationality," Games and Economic Behavior, Elsevier, vol. 21(1-2), pages 2-14, October.
    17. McLean, Richard & Obara, Ichiro & Postlewaite, Andrew, 2014. "Robustness of public equilibria in repeated games with private monitoring," Journal of Economic Theory, Elsevier, vol. 153(C), pages 191-212.
    18. Miyagawa, Eiichi & Miyahara, Yasuyuki & Sekiguchi, Tadashi, 2008. "The folk theorem for repeated games with observation costs," Journal of Economic Theory, Elsevier, vol. 139(1), pages 192-221, March.
    19. Bhaskar, V. & Obara, Ichiro, 2002. "Belief-Based Equilibria in the Repeated Prisoners' Dilemma with Private Monitoring," Journal of Economic Theory, Elsevier, vol. 102(1), pages 40-69, January.
    20. Yamamoto, Yuichi, 2007. "Efficiency results in N player games with imperfect private monitoring," Journal of Economic Theory, Elsevier, vol. 135(1), pages 382-413, July.

    More about this item

    Keywords

    Repeated games; Private monitoring; Bounded rationality; Cooperation;
    All these keywords.

    JEL classification:

    • D01 - Microeconomics - - General - - - Microeconomic Behavior: Underlying Principles
    • D70 - Microeconomics - - Analysis of Collective Decision-Making - - - General

    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:hal:journl:halshs-01204780. 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: CCSD (email available below). General contact details of provider: https://hal.archives-ouvertes.fr/ .

    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.