IDEAS home Printed from https://ideas.repec.org/
MyIDEAS: Login to save this paper or follow this series

Repeated Games Played in a Network

Delayed perfect monitoring in an infinitely repeated discounted game is modelled by letting the players form a connected and undirected network. Players observe their immediate neighbors' behavior only, but communicate over time the repeated game's history truthfully throughout the network. The Folk Theorem extends to this setup, although for a range of discount factors strictly below 1, the set of sequential equilibria and the corresponding payoff set may be reduced. A general class of games is analyzed without imposing restrictions on the dimensionality of the payoff space. This and the bilateral communication structure allow for limited results under strategic communication only. As a by-product this model produces a network result; namely, the level of cooperation in this setup depends on the network's diameter, and not on its clustering coefficient as in other models.

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://pareto.uab.es/wp/2006/67406.pdf
Download Restriction: no

Paper provided by Unitat de Fonaments de l'Anàlisi Econòmica (UAB) and Institut d'Anàlisi Econòmica (CSIC) in its series UFAE and IAE Working Papers with number 674.06.

as
in new window

Length: 34
Date of creation: 23 Nov 2006
Date of revision:
Handle: RePEc:aub:autbar:674.06
Contact details of provider: Postal: 08193, Bellaterra, Barcelona
Phone: 34 93 592 1203
Fax: +34 93 542-1223
Web page: http://pareto.uab.cat
Email:


More information through EDIRC

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. Michihiro Kandori, 2001. "Introduction to Repeated Games with Private Monitoring," CIRJE F-Series CIRJE-F-114, CIRJE, Faculty of Economics, University of Tokyo.
  2. David Kreps & Robert Wilson, 1998. "Sequential Equilibria," Levine's Working Paper Archive 237, David K. Levine.
  3. 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.
  4. Fudenberg, Drew & Levine, David I & Maskin, Eric, 1994. "The Folk Theorem with Imperfect Public Information," Econometrica, Econometric Society, vol. 62(5), pages 997-1039, September.
  5. 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.
  6. Drew Fudenberg & David K Levine & Satoru Takahashi, 2004. "Perfect Public Equilibrium When Players are Patient," Levine's Working Paper Archive 618897000000000865, David K. Levine.
  7. Spagnolo, Giancarlo & Lippert, Steffen, 2004. "Networks of Relations," SSE/EFI Working Paper Series in Economics and Finance 570, Stockholm School of Economics, revised 03 May 2005.
  8. Ben-Porath, Elchanan & Kahneman, Michael, 2003. "Communication in repeated games with costly monitoring," Games and Economic Behavior, Elsevier, vol. 44(2), pages 227-250, August.
  9. JÊrÆme Renault & Tristan Tomala, 1998. "Repeated proximity games," International Journal of Game Theory, Springer, vol. 27(4), pages 539-559.
  10. Abreu, Dilip & Dutta, Prajit K & Smith, Lones, 1994. "The Folk Theorem for Repeated Games: A NEU Condition," Econometrica, Econometric Society, vol. 62(4), pages 939-48, July.
  11. Michihiro Kandori & Hitoshi Matsushima, 1998. "Private Observation, Communication and Collusion," Econometrica, Econometric Society, vol. 66(3), pages 627-652, May.
  12. Olivier Compte, 1998. "Communication in Repeated Games with Imperfect Private Monitoring," Econometrica, Econometric Society, vol. 66(3), pages 597-626, May.
  13. Fernando Vega-Redondo & Matteo Marsili & Frantisek Slanina, 2005. "Clustering, Cooperation, and Search in Social Networks," Journal of the European Economic Association, MIT Press, vol. 3(2-3), pages 628-638, 04/05.
Full references (including those not matched with items on IDEAS)

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

When requesting a correction, please mention this item's handle: RePEc:aub:autbar:674.06. 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: (Xavier Vila)

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.

This information is provided to you by IDEAS at the Research Division of the Federal Reserve Bank of St. Louis using RePEc data.