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

Fault Reporting in Partially Known Networks and Folk Theorems

Author

Listed:
  • Tristan Tomala

    (GREGH - Groupement de Recherche et d'Etudes en Gestion à HEC - HEC Paris - Ecole des Hautes Etudes Commerciales - CNRS - Centre National de la Recherche Scientifique)

Abstract

We consider a group of players who perform tasks repeatedly. The players are nodes of a communication network and observe their neighbors' actions. Players have partial knowledge of the network and only know their set of neighbors. We study the existence of protocols for fault reporting: whenever a player chooses a faulty action, the communication protocol starts and the output publicly reveals the identity of the faulty player. We consider two setups. In the first one, players do not share authentication keys. We show that existence of a protocol for fault reporting is equivalent to the 2-vertex-connectedness of the network: no single vertex deletion disconnects the graph. In the second setup, we allow players to share authentication keys. We show that existence of a distribution of the keys and of a protocol for fault reporting is equivalent to the 2-edge-connectedness of the network: no single edge deletion disconnects the graph. We give applications to the implementation of socially optimal outcomes in repeated games.

Suggested Citation

  • Tristan Tomala, 2011. "Fault Reporting in Partially Known Networks and Folk Theorems," Post-Print hal-00632806, HAL.
    • Handle: RePEc:hal:journl:hal-00632806
    DOI: 10.1287/opre.1110.0936
    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. R.J. Aumann & S. Hart (ed.), 2002. "Handbook of Game Theory with Economic Applications," Handbook of Game Theory with Economic Applications, Elsevier, edition 1, volume 3, number 3.
    2. 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.
    3. Drew Fudenberg & David Levine & Eric Maskin, 2008. "The Folk Theorem With Imperfect Public Information," World Scientific Book Chapters, in: Drew Fudenberg & David K Levine (ed.), A Long-Run Collaboration On Long-Run Games, chapter 12, pages 231-273, World Scientific Publishing Co. Pte. Ltd..
    4. Aumann, Robert J., 1974. "Subjectivity and correlation in randomized strategies," Journal of Mathematical Economics, Elsevier, vol. 1(1), pages 67-96, March.
    5. Drew Fudenberg & Eric Maskin, 2008. "The Folk Theorem In Repeated Games With Discounting Or With Incomplete Information," World Scientific Book Chapters, in: Drew Fudenberg & David K Levine (ed.), A Long-Run Collaboration On Long-Run Games, chapter 11, pages 209-230, World Scientific Publishing Co. Pte. Ltd..
    6. 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.
    7. 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.
    8. Tristan Tomala, 2008. "Probabilistic Reliability and Privacy of Communication Using Multicast in General Neighbor Networks," Post-Print hal-00464542, HAL.
    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. Marie Laclau & Ludovic Renou & Xavier Venel, 2020. "Robust communication on networks," Papers 2007.00457, arXiv.org, revised Oct 2020.
    2. Laclau, M., 2014. "Communication in repeated network games with imperfect monitoring," Games and Economic Behavior, Elsevier, vol. 87(C), pages 136-160.
    3. 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.
    4. Laclau, Marie, 2012. "A folk theorem for repeated games played on a network," Games and Economic Behavior, Elsevier, vol. 76(2), pages 711-737.
    5. Somayeh Kokabisaghi & Eric J Pauwels & Andre B Dorsman, 2019. "To snipe or not to snipe, that is the question! Transitions in sniping behaviour among competing algorithmic traders," Papers 1912.04012, arXiv.org, revised Sep 2020.
    6. Laclau, M., 2013. "Repeated games with local monitoring and private communication," Economics Letters, Elsevier, vol. 120(2), pages 332-337.
    7. Marie Laclau & Ludovic Renou & Xavier Venel, 2024. "Communication on networks and strong reliability," Working Papers hal-03099678, HAL.

    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. 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.
    3. Laclau, M., 2014. "Communication in repeated network games with imperfect monitoring," Games and Economic Behavior, Elsevier, vol. 87(C), pages 136-160.
    4. 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).
    5. Laclau, Marie, 2012. "A folk theorem for repeated games played on a network," Games and Economic Behavior, Elsevier, vol. 76(2), pages 711-737.
    6. Tomala, Tristan, 2009. "Perfect communication equilibria in repeated games with imperfect monitoring," Games and Economic Behavior, Elsevier, vol. 67(2), pages 682-694, November.
    7. Kimmo Berg & Gijs Schoenmakers, 2017. "Construction of Subgame-Perfect Mixed-Strategy Equilibria in Repeated Games," Games, MDPI, vol. 8(4), pages 1-14, November.
    8. 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.
    9. Contou-Carrère, Pauline & Tomala, Tristan, 2011. "Finitely repeated games with semi-standard monitoring," Journal of Mathematical Economics, Elsevier, vol. 47(1), pages 14-21, January.
    10. Du, Chuang, 2012. "Solving payoff sets of perfect public equilibria: an example," MPRA Paper 38622, University Library of Munich, Germany.
    11. Hörner, Johannes & Takahashi, Satoru, 2016. "How fast do equilibrium payoff sets converge in repeated games?," Journal of Economic Theory, Elsevier, vol. 165(C), pages 332-359.
    12. Sekiguchi, Tadashi, 1997. "Efficiency in Repeated Prisoner's Dilemma with Private Monitoring," Journal of Economic Theory, Elsevier, vol. 76(2), pages 345-361, October.
    13. Richard McLean & Ichiro Obara & Andrew Postlewaite, 2001. "Informational Smallness and Private Monitoring in Repeated Games," PIER Working Paper Archive 05-024, Penn Institute for Economic Research, Department of Economics, University of Pennsylvania, revised 20 Jul 2005.
    14. Pauline Contou-Carrère & Tristan Tomala, 2010. "Finitely repeated games with semi-standard monitoring," Post-Print halshs-00524134, HAL.
    15. Olivier Gossner & Tristan Tomala, 2007. "Secret Correlation in Repeated Games with Imperfect Monitoring," Mathematics of Operations Research, INFORMS, vol. 32(2), pages 413-424, May.
    16. 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.
    17. Sau-Him Lau & Vai-Lam Mui, 2008. "Using Turn Taking to Mitigate Coordination and Conflict Problems in the Repeated Battle of the Sexes Game," Theory and Decision, Springer, vol. 65(2), pages 153-183, September.
    18. Luca Anderlini & Dino Gerardi & Roger Lagunoff, 2004. "The Folk Theorem in Dynastic Repeated Games," Levine's Bibliography 122247000000000577, UCLA Department of Economics.
    19. 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.
    20. Mouraviev, Igor, 2006. "Private Observation, Tacit Collusion and Collusion with Communication," Working Paper Series 672, Research Institute of Industrial Economics.

    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:hal-00632806. 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.