IDEAS home Printed from https://ideas.repec.org/p/arx/papers/2507.10148.html
   My bibliography  Save this paper

A Folk Theorem for Indefinitely Repeated Network Games

Author

Listed:
  • Andrea Benso

Abstract

We consider a repeated game in which players, considered as nodes of a network, are connected. Each player observes her neighbors' moves only. Thus, monitoring is private and imperfect. Players can communicate with their neighbors at each stage; each player, for any subset of her neighbors, sends the same message to any player of that subset. Thus, communication is local and both public and private. Both communication and monitoring structures are given by the network. The solution concept is perfect Bayesian equilibrium. In this paper we show that a folk theorem holds if and only if the network is 2-connected for any number of players.

Suggested Citation

  • Andrea Benso, 2025. "A Folk Theorem for Indefinitely Repeated Network Games," Papers 2507.10148, arXiv.org.
    • Handle: RePEc:arx:papers:2507.10148
    as

    Download full text from publisher

    File URL: http://arxiv.org/pdf/2507.10148
    File Function: Latest version
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. 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.
    2. Konishi, Hideo & Ray, Debraj, 2003. "Coalition formation as a dynamic process," Journal of Economic Theory, Elsevier, vol. 110(1), pages 1-41, May.
    3. Sorin, Sylvain, 1992. "Repeated games with complete information," Handbook of Game Theory with Economic Applications, in: R.J. Aumann & S. Hart (ed.), Handbook of Game Theory with Economic Applications, edition 1, volume 1, chapter 4, pages 71-107, Elsevier.
    4. JÊrÆme Renault & Tristan Tomala, 1998. "Repeated proximity games," International Journal of Game Theory, Springer;Game Theory Society, vol. 27(4), pages 539-559.
    5. 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.
    6. Fudenberg, Drew & Maskin, Eric, 1991. "On the dispensability of public randomization in discounted repeated games," Journal of Economic Theory, Elsevier, vol. 53(2), pages 428-438, April.
    7. Tristan Tomala, 2008. "Probabilistic Reliability and Privacy of Communication Using Multicast in General Neighbor Networks," Post-Print hal-00464542, HAL.
    8. Vartiainen, Hannu, 2011. "Dynamic coalitional equilibrium," Journal of Economic Theory, Elsevier, vol. 146(2), pages 672-698, March.
    9. Ehud Lehrer, 1992. "Two-Player Repeated Games with Nonobservable Actions and Observable Payoffs," Mathematics of Operations Research, INFORMS, vol. 17(1), pages 200-224, February.
    10. Drew Fudenberg & David K. Levine, 2008. "An Approximate Folk Theorem with Imperfect Private Information," World Scientific Book Chapters, in: Drew Fudenberg & David K Levine (ed.), A Long-Run Collaboration On Long-Run Games, chapter 14, pages 309-330, World Scientific Publishing Co. Pte. Ltd..
    11. Obara, Ichiro, 2009. "Folk theorem with communication," Journal of Economic Theory, Elsevier, vol. 144(1), pages 120-134, January.
    12. Mailath, George J. & Samuelson, Larry, 2006. "Repeated Games and Reputations: Long-Run Relationships," OUP Catalogue, Oxford University Press, number 9780195300796.
    13. Michihiro Kandori & Hitoshi Matsushima, 1998. "Private Observation, Communication and Collusion," Econometrica, Econometric Society, vol. 66(3), pages 627-652, May.
    14. repec:dau:papers:123456789/6115 is not listed on IDEAS
    15. Lehrer, E, 1989. "Lower Equilibrium Payoffs in Two-Player Repeated Games with Non-observable Actions," International Journal of Game Theory, Springer;Game Theory Society, vol. 18(1), pages 57-89.
    Full references (including those not matched with items on IDEAS)

    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. Laclau, M., 2013. "Repeated games with local monitoring and private communication," Economics Letters, Elsevier, vol. 120(2), pages 332-337.
    2. Laclau, M., 2014. "Communication in repeated network games with imperfect monitoring," Games and Economic Behavior, Elsevier, vol. 87(C), pages 136-160.
    3. Laclau, Marie, 2012. "A folk theorem for repeated games played on a network," Games and Economic Behavior, Elsevier, vol. 76(2), pages 711-737.
    4. Jérôme Renault & Tristan Tomala, 2011. "General Properties of Long-Run Supergames," Dynamic Games and Applications, Springer, vol. 1(2), pages 319-350, June.
    5. Ashkenazi-Golan, Galit & Lehrer, Ehud, 2019. "What you get is what you see: Cooperation in repeated games with observable payoffs," Journal of Economic Theory, Elsevier, vol. 181(C), pages 197-237.
    6. Ashkenazi-Golan, Galit & Lehrer, Ehud, 2019. "Blackwell's comparison of experiments and discounted repeated games," Games and Economic Behavior, Elsevier, vol. 117(C), pages 163-194.
    7. Deb, Joyee & González-Díaz, Julio & Renault, Jérôme, 2016. "Uniform folk theorems in repeated anonymous random matching games," Games and Economic Behavior, Elsevier, vol. 100(C), pages 1-23.
    8. Markus Kinateder, 2006. "Repeated Games Played in a Network," UFAE and IAE Working Papers 674.06, Unitat de Fonaments de l'Anàlisi Econòmica (UAB) and Institut d'Anàlisi Econòmica (CSIC).
    9. 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.
    10. , H. & ,, 2016. "Approximate efficiency in repeated games with side-payments and correlated signals," Theoretical Economics, Econometric Society, vol. 11(1), January.
    11. Tristan Tomala, 2011. "Fault Reporting in Partially Known Networks and Folk Theorems," Operations Research, INFORMS, vol. 59(3), pages 754-763, June.
    12. 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.
    13. Yamamoto, Yuichi, 2009. "A limit characterization of belief-free equilibrium payoffs in repeated games," Journal of Economic Theory, Elsevier, vol. 144(2), pages 802-824, March.
    14. Laclau, Marie & Renou, Ludovic & Venel, Xavier, 2024. "Communication on networks and strong reliability," Journal of Economic Theory, Elsevier, vol. 217(C).
    15. 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.
    16. Mouraviev, Igor, 2006. "Private Observation, Tacit Collusion and Collusion with Communication," Working Paper Series 672, Research Institute of Industrial Economics.
    17. Renault, Jérôme & Renou, Ludovic & Tomala, Tristan, 2014. "Secure message transmission on directed networks," Games and Economic Behavior, Elsevier, vol. 85(C), pages 1-18.
    18. Tomala, Tristan, 2009. "Perfect communication equilibria in repeated games with imperfect monitoring," Games and Economic Behavior, Elsevier, vol. 67(2), pages 682-694, November.
    19. Marie Laclau & Ludovic Renou & Xavier Venel, 2020. "Robust communication on networks," Papers 2007.00457, arXiv.org, revised Oct 2020.
    20. Kimmo Berg & Gijs Schoenmakers, 2017. "Construction of Subgame-Perfect Mixed-Strategy Equilibria in Repeated Games," Games, MDPI, vol. 8(4), pages 1-14, November.

    More about this item

    NEP fields

    This paper has been announced in the following NEP Reports:

    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:arx:papers:2507.10148. 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: arXiv administrators (email available below). General contact details of provider: http://arxiv.org/ .

    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.