Advanced Search
MyIDEAS: Login to save this article or follow this journal

A folk theorem for repeated games played on a network

Contents:

Author Info

  • Laclau, Marie

Abstract

I consider repeated games on a network where players interact and communicate with their neighbors. At each stage, players choose actions and exchange private messages with their neighbors. The payoff of a player depends only on his own action and on the actions of his neighbors. At the end of each stage, a player is only informed of his payoff and of the messages he received from his neighbors. Payoffs are assumed to be sensitive to unilateral deviations. The main result is to establish a necessary and sufficient condition on the network for a Nash folk theorem to hold, for any such payoff function.

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://www.sciencedirect.com/science/article/pii/S0899825612001285
Download Restriction: Full text for ScienceDirect subscribers only

As the access to this document is restricted, you may want to look for a different version under "Related research" (further below) or search for a different version of it.

Bibliographic Info

Article provided by Elsevier in its journal Games and Economic Behavior.

Volume (Year): 76 (2012)
Issue (Month): 2 ()
Pages: 711-737

as in new window
Handle: RePEc:eee:gamebe:v:76:y:2012:i:2:p:711-737

Contact details of provider:
Web page: http://www.elsevier.com/locate/inca/622836

Related research

Keywords: Repeated games; Imperfect monitoring; Networks; Folk theorem; Communication protocols;

Find related papers by JEL classification:

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. Lehrer, E, 1989. "Lower Equilibrium Payoffs in Two-Player Repeated Games with Non-observable Actions," International Journal of Game Theory, Springer, vol. 18(1), pages 57-89.
  2. Andrea Galeotti & Sanjeev Goyal & Matthew O. Jackson & Fernando Vega-Redondo & Leeat Yariv, 2008. "Network Games," Economics Working Papers ECO2008/07, European University Institute.
    • Andrea Galeotti & Sanjeev Goyal & Matthew O. Jackson & Fernando Vega-Redondo & Leeat Yariv, 2010. "Network Games," Review of Economic Studies, Oxford University Press, vol. 77(1), pages 218-244.
  3. D. Fudenberg & D. K. Levine, 1991. "An Approximate Folk Theorem with Imperfect Private Information," Levine's Working Paper Archive 607, David K. Levine.
  4. Ichiro Obara, 2007. "Folk Theorem with Communication," Levine's Bibliography 784828000000000351, UCLA Department of Economics.
  5. Drew Fudenberg & David K. Levine & Eric Maskin, 1994. "The Folk Theorem with Imperfect Public Information," Levine's Working Paper Archive 394, David K. Levine.
  6. Kreps, David M & Wilson, Robert, 1982. "Sequential Equilibria," Econometrica, Econometric Society, vol. 50(4), pages 863-94, July.
  7. Renault, Jerome & Tomala, Tristan, 2004. "Learning the state of nature in repeated games with incomplete information and signals," Games and Economic Behavior, Elsevier, vol. 47(1), pages 124-156, April.
  8. JÊrÆme Renault & Tristan Tomala, 1998. "Repeated proximity games," International Journal of Game Theory, Springer, vol. 27(4), pages 539-559.
  9. SORIN, Sylvain, 1988. "Repeated games with complete information," CORE Discussion Papers 1988022, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
  10. Jeffrey C. Ely & Johannes Hörner & Wojciech Olszewski, 2005. "Belief-Free Equilibria in Repeated Games," Econometrica, Econometric Society, vol. 73(2), pages 377-415, 03.
  11. Johannes Hörner & Wojciech Olszewski, 2006. "The Folk Theorem for Games with Private Almost-Perfect Monitoring," Econometrica, Econometric Society, vol. 74(6), pages 1499-1544, November.
  12. Renault, Jérôme & Tomala, Tristan, 2004. "Communication equilibrium payoffs in repeated games with imperfect monitoring," Economics Papers from University Paris Dauphine 123456789/6103, Paris Dauphine University.
  13. Johannes Hörnerx & Wojciech Olszewski, 2009. "How Robust Is the Folk Theorem?," The Quarterly Journal of Economics, MIT Press, vol. 124(4), pages 1773-1814, November.
  14. Michihiro Kandori & Hitoshi Matsushima, 1998. "Private Observation, Communication and Collusion," Econometrica, Econometric Society, vol. 66(3), pages 627-652, May.
  15. Olivier Compte, 1998. "Communication in Repeated Games with Imperfect Private Monitoring," Econometrica, Econometric Society, vol. 66(3), pages 597-626, May.
  16. Mailath, George J. & Samuelson, Larry, 2006. "Repeated Games and Reputations: Long-Run Relationships," OUP Catalogue, Oxford University Press, number 9780195300796, September.
  17. Fudenberg, Drew & Maskin, Eric, 1986. "The Folk Theorem in Repeated Games with Discounting or with Incomplete Information," Econometrica, Econometric Society, vol. 54(3), pages 533-54, May.
  18. Ben-Porath, Elchanan & Kahneman, Michael, 1996. "Communication in Repeated Games with Private Monitoring," Journal of Economic Theory, Elsevier, vol. 70(2), pages 281-297, August.
  19. Bramoulle, Yann & Kranton, Rachel, 2007. "Public goods in networks," Journal of Economic Theory, Elsevier, vol. 135(1), pages 478-494, July.
  20. Robert J. Aumann, 1995. "Repeated Games with Incomplete Information," MIT Press Books, The MIT Press, edition 1, volume 1, number 0262011476, December.
Full references (including those not matched with items on IDEAS)

Citations

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:eee:gamebe:v:76:y:2012:i:2:p:711-737. 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: (Zhang, Lei).

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.