IDEAS home Printed from https://ideas.repec.org/p/hal/journl/halshs-01411520.html

Optimal design and defense of networks under link attacks

Author

Listed:
  • 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])

  • Liza Charroin

    (UL2 - Université Lumière - Lyon 2, GATE Lyon Saint-Étienne - Groupe d'Analyse et de Théorie Economique Lyon - Saint-Etienne - ENS de Lyon - École normale supérieure de Lyon - Université 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)

  • Corinne Touati

    (MESCAL - Middleware efficiently scalable - Centre Inria de l'Université Grenoble Alpes - Inria - Institut National de Recherche en Informatique et en Automatique - LIG - Laboratoire d'Informatique de Grenoble - UPMF - Université Pierre Mendès France - Grenoble 2 - UJF - Université Joseph Fourier - Grenoble 1 - Grenoble INP - Institut polytechnique de Grenoble - Grenoble Institute of Technology - INPG - Institut National Polytechnique de Grenoble - CNRS - Centre National de la Recherche Scientifique, LIG - Laboratoire d'Informatique de Grenoble - Grenoble INP - Institut polytechnique de Grenoble - Grenoble Institute of Technology - CNRS - Centre National de la Recherche Scientifique - UGA [2016-2019] - Université Grenoble Alpes [2016-2019])

Abstract

Networks facilitate the exchange of goods and information and create benefits. We consider a network composed of complementary nodes, i.e., nodes that need to be connected to generate a positive payoff. This network may face intelligent attacks on links. To study how the network should be designed, we develop a strategic model, inspired by Dziubiński and Goyal (2013), with two players: a Designer and an Adversary. The Designer has two potential ways to defend her network: forming destructible links among the given set of nodes to increase connectivity or protecting a group of nodes (with indestructible links). Links formation and protections (indestructible links) are costly. The Adversary then allocates her resources to attack links. We examine two situations which differ according to the number of protections available to the Designer. Our main findings are that if the number of protections is not limited, the Designer should either protect all the nodes, or create a large number of (destructible) links to absorb the Adversary's attack; if the available number of protections is limited, then a strategy that uses protections and links can be the equilibrium.

Suggested Citation

  • Christophe Bravard & Liza Charroin & Corinne Touati, 2016. "Optimal design and defense of networks under link attacks," Post-Print halshs-01411520, HAL.
    • Handle: RePEc:hal:journl:halshs-01411520
    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
    for a similarly titled item that would be available.

    Other versions of this item:

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Hans Haller, 2015. "Network Vulnerability: A Designer-Disruptor Game," Working Papers e07-50, Virginia Polytechnic Institute and State University, Department of Economics.
    2. Bouveret, Géraldine & Mandel, Antoine, 2021. "Social interactions and the prophylaxis of SI epidemics on networks," Journal of Mathematical Economics, Elsevier, vol. 93(C).
    3. Sonja Brangewitz & Behnud Mir Djawadi & Angelika Endres & Britta Hoyer, "undated". "Network Formation and Disruption - An Experiment - Are Efficient Networks too Complex?," ETA: Economic Theory and Applications 258012, Fondazione Eni Enrico Mattei (FEEM).
    4. Lasse Kliemann & Elmira Shirazi Sheykhdarabadi & Anand Srivastav, 2017. "Swap Equilibria under Link and Vertex Destruction," Games, MDPI, vol. 8(1), pages 1-18, February.
    5. 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.
    6. Christophe Bravard & Jacques Durieu & Sudipta Sarangi & Corinne Touati, 2024. "Influence and Counter-Influence in Networks [Mécanismes d'influence et de contre-influence dans les réseaux]," Post-Print hal-04733885, HAL.
    7. Geraldine Bouveret & Antoine Mandel, 2020. "Prophylaxis of Epidemic Spreading with Transient Dynamics," Papers 2007.07580, arXiv.org.
    8. Hans Haller & Britta Hoyer, 2015. "Note on the Common Enemy Effect under Strategic Network Formation and Disruption," Working Papers e07-49, Virginia Polytechnic Institute and State University, Department of Economics.
    9. Yang, Bo & Zuo, Youcheng & Hu, Xiaoming & Cheng, Weizheng & Li, Nuohan & Liu, Qi, 2024. "Enhancing core–periphery robustness of networks against link-based attacks with imprecise information," Chaos, Solitons & Fractals, Elsevier, vol. 183(C).
    10. 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.

    More about this item

    Keywords

    ;
    ;
    ;
    ;

    JEL classification:

    • D74 - Microeconomics - - Analysis of Collective Decision-Making - - - Conflict; Conflict Resolution; Alliances; Revolutions
    • D85 - Microeconomics - - Information, Knowledge, and Uncertainty - - - Network Formation

    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:halshs-01411520. 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.

    We have no bibliographic references for this item. You can help adding them by using 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.