Advanced Search
MyIDEAS: Login to save this paper or follow this series

Effecting Cooperation

Contents:

Author Info

  • Olivier Compte

    ()
    (Paris School of Economics, Ecole Nationale des Ponts et Chaussées, CERAS)

  • Andrew Postlewaite

    ()
    (Department of Economics, University of Pennsylvania)

Abstract

There is a large repeated games literature illustrating how future interactions provide incentives for cooperation. Much of this literature assumes public monitoring: players always observe precisely the same thing. Even slight deviations from public monitoring to private monitoring that incorporate differences in players’ observations dramatically complicate coordination. Equilibria with private monitoring often seem unrealistically complex. 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.

Download Info

If you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
File URL: http://economics.sas.upenn.edu/system/files/working-papers/09-019.pdf
Download Restriction: no

Bibliographic Info

Paper provided by Penn Institute for Economic Research, Department of Economics, University of Pennsylvania in its series PIER Working Paper Archive with number 09-019.

as in new window
Length: 36 pages
Date of creation: 01 Jul 2007
Date of revision: 29 May 2009
Handle: RePEc:pen:papers:09-019

Contact details of provider:
Postal: 3718 Locust Walk, Philadelphia, PA 19104
Phone: 215-898-9992
Fax: 215-573-2378
Email:
Web page: http://economics.sas.upenn.edu/pier
More information through EDIRC

Related research

Keywords: Repeated games; private monitoring; bounded rationality; cooperation;

Other versions of this item:

Find related papers by JEL classification:

This paper has been announced in the following NEP Reports:

References

References listed on IDEAS
Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.:
as in new window
  1. Kalai, Ehud & Stanford, William, 1988. "Finite Rationality and Interpersonal Complexity in Repeated Games," Econometrica, Econometric Society, vol. 56(2), pages 397-410, March.
  2. Bagwell, Kyle, 1995. "Commitment and observability in games," Games and Economic Behavior, Elsevier, vol. 8(2), pages 271-280.
  3. 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.
  4. Rubinstein, Ariel, 1995. "On the Interpretation of Decision Problems with Imperfect Recall," Mathematical Social Sciences, Elsevier, vol. 30(3), pages 324-324, December.
  5. Christopher Phelan & Andrzej Skrzypacz, 2007. "Private Monitoring with Infinite Histories," NajEcon Working Paper Reviews 843644000000000079, www.najecon.org.
  6. Michi Kandori, 2010. "Social Norms and Community Enforcement," Levine's Working Paper Archive 630, David K. Levine.
  7. Miller, John H., 1996. "The coevolution of automata in the repeated Prisoner's Dilemma," Journal of Economic Behavior & Organization, Elsevier, vol. 29(1), pages 87-112, January.
  8. Kandori, Michihiro & Mailath, George J & Rob, Rafael, 1993. "Learning, Mutation, and Long Run Equilibria in Games," Econometrica, Econometric Society, vol. 61(1), pages 29-56, January.
  9. George J. Mailath & Stephen Morris, 1999. "Repeated Games with Almost-Public Monitoring," Cowles Foundation Discussion Papers 1236, Cowles Foundation for Research in Economics, Yale University.
  10. 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.
  11. Michihiro Kandori & Hitoshi Matsushima, 1998. "Private Observation, Communication and Collusion," Econometrica, Econometric Society, vol. 66(3), pages 627-652, May.
  12. Abreu, Dilip & Rubinstein, Ariel, 1988. "The Structure of Nash Equilibrium in Repeated Games with Finite Automata," Econometrica, Econometric Society, vol. 56(6), pages 1259-81, November.
  13. Ben-Porath Elchanan, 1993. "Repeated Games with Finite Automata," Journal of Economic Theory, Elsevier, vol. 59(1), pages 17-32, February.
  14. Sainty, Barbara, 1999. "Achieving greater cooperation in a noisy prisoner's dilemma: an experimental investigation," Journal of Economic Behavior & Organization, Elsevier, vol. 39(4), pages 421-435, July.
  15. Olivier Compte, 1998. "Communication in Repeated Games with Imperfect Private Monitoring," Econometrica, Econometric Society, vol. 66(3), pages 597-626, May.
  16. Sekiguchi, Tadashi, 1997. "Efficiency in Repeated Prisoner's Dilemma with Private Monitoring," Journal of Economic Theory, Elsevier, vol. 76(2), pages 345-361, October.
  17. Abreu, Dilip, 1986. "Extremal equilibria of oligopolistic supergames," Journal of Economic Theory, Elsevier, vol. 39(1), pages 191-225, June.
  18. Piccione, Michele, 2002. "The Repeated Prisoner's Dilemma with Imperfect Private Monitoring," Journal of Economic Theory, Elsevier, vol. 102(1), pages 70-83, January.
  19. 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.
  20. Compte, Olivier, 2002. "On Sustaining Cooperation without Public Observations," Journal of Economic Theory, Elsevier, vol. 102(1), pages 106-150, January.
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 in new window

Cited by:
  1. Monte, Daniel & Said, Maher, 2010. "Learning in hidden Markov models with bounded memory," MPRA Paper 23854, University Library of Munich, Germany, revised 23 Jun 2010.
  2. Julian Romero, 2011. "Finite Automata in Undiscounted Repeated Games with Private Monitoring," Purdue University Economics Working Papers 1260, Purdue University, Department of Economics.

Lists

This item is not listed on Wikipedia, on a reading list or among the top items on IDEAS.

Statistics

Access and download statistics

Corrections

When requesting a correction, please mention this item's handle: RePEc:pen:papers:09-019. See general information about how to correct material in RePEc.

For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Dolly Guarini).

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 references are entirely missing, you can add them using this form.

If the full references list an item that is present in RePEc, but the system did not link 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 profile, as there may be some citations waiting for confirmation.

Please note that corrections may take a couple of weeks to filter through the various RePEc services.