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

Network connectivity under node failure

Author

Listed:
  • Pascal Billand

    (GATE Lyon Saint-Étienne - Groupe d'Analyse et de Théorie Economique Lyon - Saint-Etienne - ENS de Lyon - École normale supérieure de Lyon - UL2 - Université Lumière - Lyon 2 - UCBL - Université Claude Bernard Lyon 1 - Université de Lyon - UJM - Université Jean Monnet - Saint-Étienne - CNRS - Centre National de la Recherche Scientifique)

  • Christophe Bravard

    (GAEL - Laboratoire d'Economie Appliquée de Grenoble - Grenoble INP - Institut polytechnique de Grenoble - Grenoble Institute of Technology - INRA - Institut National de la Recherche Agronomique - CNRS - Centre National de la Recherche Scientifique - UGA [2016-2019] - Université Grenoble Alpes [2016-2019], UGA UFR FEG - Université Grenoble Alpes - Faculté d'Économie de Grenoble - UGA [2016-2019] - Université Grenoble Alpes [2016-2019])

  • Sitharama S. Iyengar

    (FIU - Florida International University [Miami])

  • Rajnish Kumar

    (Queen's Management School - QUB - Queen's University [Belfast])

  • Sudipta Sarangi

    (Virginia Tech [Blacksburg], DIW Berlin - Deutsches Institut für Wirtschaftsforschung)

Abstract

We examine a non-cooperative model of network formation where players may stop functioning. We identify conditions under which Nash and efficient networks will remain connected after the loss of kk nodes by introducing the notion of kk-Node Super Connectivity.

Suggested Citation

  • Pascal Billand & Christophe Bravard & Sitharama S. Iyengar & Rajnish Kumar & Sudipta Sarangi, 2016. "Network connectivity under node failure," Post-Print hal-01404559, HAL.
    • Handle: RePEc:hal:journl:hal-01404559
    DOI: 10.1016/j.econlet.2016.10.028
    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. Sanjeev Goyal & Adrien Vigier, 2014. "Attack, Defence, and Contagion in Networks," Review of Economic Studies, Oxford University Press, vol. 81(4), pages 1518-1542.
    2. Venkatesh Bala & Sanjeev Goyal, 2000. "original papers : A strategic analysis of network reliability," Review of Economic Design, Springer;Society for Economic Design, vol. 5(3), pages 205-228.
    3. Dziubiński, Marcin & Goyal, Sanjeev, 2013. "Network design and defence," Games and Economic Behavior, Elsevier, vol. 79(C), pages 30-43.
    4. Britta Hoyer & Kris De Jaegher, 2016. "Strategic Network Disruption and Defense," Journal of Public Economic Theory, Association for Public Economic Theory, vol. 18(5), pages 802-830, October.
    5. Haller, Hans & Sarangi, Sudipta, 2005. "Nash networks with heterogeneous links," Mathematical Social Sciences, Elsevier, vol. 50(2), pages 181-201, September.
    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. Bougheas, Spiros, 2022. "Contagion in networks: Stability and efficiency," Mathematical Social Sciences, Elsevier, vol. 115(C), pages 64-77.
    2. Borkotokey, Surajit & Chakrabarti, Subhadip & Gilles, Robert P. & Gogoi, Loyimee & Kumar, Rajnish, 2021. "Probabilistic network values," Mathematical Social Sciences, Elsevier, vol. 113(C), pages 169-180.

    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. Bravard, Christophe & Charroin, Liza & Touati, Corinne, 2017. "Optimal design and defense of networks under link attacks," Journal of Mathematical Economics, Elsevier, vol. 68(C), pages 62-79.
    2. Haller, Hans & Hoyer, Britta, 2019. "The common enemy effect under strategic network formation and disruption," Journal of Economic Behavior & Organization, Elsevier, vol. 162(C), pages 146-163.
    3. Britta Hoyer & Kris De Jaegher, 2023. "Network disruption and the common-enemy effect," International Journal of Game Theory, Springer;Game Theory Society, vol. 52(1), pages 117-155, March.
    4. Dan Kovenock & Brian Roberson, 2018. "The Optimal Defense Of Networks Of Targets," Economic Inquiry, Western Economic Association International, vol. 56(4), pages 2195-2211, October.
    5. Landwehr, Jakob, 2015. "Network design and imperfect defense," Center for Mathematical Economics Working Papers 537, Center for Mathematical Economics, Bielefeld University.
    6. Billand, Pascal & Bravard, Christophe & Sarangi, Sudipta, 2012. "Existence of Nash networks and partner heterogeneity," Mathematical Social Sciences, Elsevier, vol. 64(2), pages 152-158.
    7. Joost Vandenbossche & Thomas Demuynck, 2013. "Network Formation with Heterogeneous Agents and Absolute Friction," Computational Economics, Springer;Society for Computational Economics, vol. 42(1), pages 23-45, June.
    8. Pascal Billand & Christophe Bravard & Sudipta Sarangi & J. Kamphorst, 2011. "Confirming information flows in networks," Post-Print halshs-00672351, HAL.
    9. Ping Sun & Elena Parilina, 2022. "Impact of Utilities on the Structures of Stable Networks with Ordered Group Partitioning," Dynamic Games and Applications, Springer, vol. 12(4), pages 1131-1162, December.
    10. Acemoglu, Daron & Malekian, Azarakhsh & Ozdaglar, Asu, 2016. "Network security and contagion," Journal of Economic Theory, Elsevier, vol. 166(C), pages 536-585.
    11. Billand, Pascal & Bravard, Christophe & Kamphorst, Jurjen & Sarangi, Sudipta, 2017. "Network formation when players seek confirmation of information," Mathematical Social Sciences, Elsevier, vol. 89(C), pages 20-31.
    12. Haller, Hans, 2012. "Network extension," Mathematical Social Sciences, Elsevier, vol. 64(2), pages 166-172.
    13. Breitmoser, Yves & Vorjohann, Pauline, 2013. "Efficient structure of noisy communication networks," Mathematical Social Sciences, Elsevier, vol. 66(3), pages 396-409.
    14. Djawadi, Behnud Mir & Endres, Angelika & Hoyer, Britta & Recker, Sonja, 2019. "Network formation and disruption - An experiment are equilibrium networks too complex?," Journal of Economic Behavior & Organization, Elsevier, vol. 157(C), pages 708-734.
    15. Marco Pelliccia, 2020. "Decentralized Defence of a (Directed) Network Structure," Defence and Peace Economics, Taylor & Francis Journals, vol. 31(6), pages 659-676, August.
    16. repec:use:tkiwps:1616 is not listed on IDEAS
    17. Lasse Kliemann & Elmira Shirazi Sheykhdarabadi & Anand Srivastav, 2017. "Swap Equilibria under Link and Vertex Destruction," Games, MDPI, vol. 8(1), pages 1-18, February.
    18. Toni Ahnert & Michael Brolley & David Cimon & Ryan Riordan, 2022. "Cyber Risk and Security Investment," Staff Working Papers 22-32, Bank of Canada.
    19. Marcin Dziubinski & Sanjeev Goyal, 2014. "How to Defend a Network?," Cambridge Working Papers in Economics 1450, Faculty of Economics, University of Cambridge.
    20. Pramila Krishnan & Emanuela Sciubba, 2009. "Links and Architecture in Village Networks," Economic Journal, Royal Economic Society, vol. 119(537), pages 917-949, April.
    21. Banchongsan Charoensook, 2020. "On the Interaction between Small Decay, Agent Heterogeneity and Diameter of Minimal Strict Nash Networks in Two-way Flow Model," Annals of Economics and Finance, Society for AEF, vol. 21(2), pages 331-361, November.

    More about this item

    Keywords

    efficient networks; connectivity; node failure; nash networks;
    All these keywords.

    JEL classification:

    • C7 - Mathematical and Quantitative Methods - - Game Theory and Bargaining Theory
    • D8 - Microeconomics - - Information, Knowledge, and Uncertainty
    • R4 - Urban, Rural, Regional, Real Estate, and Transportation Economics - - Transportation Economics

    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:hal:journl:hal-01404559. 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.