Christophe Bravard

interaction seminar

Christophe Bravard

University of Grenoble Alpes, INRA
Optimal design and defense of networks under link attacks
Co-écrit avec
Liza Charroin, Corinne Touati

VC Salle A

Centre de la Vieille-Charité - Salle A

Centre de la Vieille Charité
2 rue de la Charité
13002 Marseille

Jeudi 16 juin 2016| 12:30 - 13:45

Mathieu Faure : mathieu.faure[at]
Kenan Huremovic : kenan.huremovic[at]


Networks facilitate the exchange of goods and information and create benefits. We consider a network with complementary nodes, i.e. nodes 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 and protected, we develop a strategic model inspired by Dziubinski and Goyal (2013) with two players: a Designer and an Adversary. First, the Designer forms costly protected and non-protected links. Then, the Adversary attacks at most k links given that attacks are costly and that protected links cannot be removed by her attacks. The Adversary aims at disconnecting the network shaped by the Designer. The Designer builds a protected network that minimizes her costs given that it has to resist the attacks of the Adversary. We establish that in equilibrium the Designer forms a minimal 1-link-connected network which contains only protected links, or a minimal (k + 1)-link-connected network which contains only non-protected links, or a network which contains one protected link and (n -1)(k + 1)/2 non-protected links. We also examine situations where the Designer can only create a limited number of protected links and situations where protected links are imperfect, that is protected links can be removed by attacks with some probabilities. We show that if the available number of protected links is limited, then, in equilibrium, there exists a network which contains several protected and non-protected links. In the imperfect defense framework, we provide conditions under which the results of the benchmark model are preserved.