Please use this identifier to cite or link to this item: http://hdl.handle.net/10419/168016
Authors: 
Kliemann, Lasse
Sheykhdarabadi, Elmira Shirazi
Srivastav, Anand
Year of Publication: 
2017
Citation: 
[Journal:] Games [ISSN:] 2073-4336 [Volume:] 8 [Year:] 2017 [Issue:] 1 [Pages:] 1-18
Abstract: 
We initiate the study of the destruction or adversary model (Kliemann 2010) using the swap equilibrium (SE) stability concept (Alon et al., 2010). The destruction model is a network formation game incorporating the robustness of a network under a more or less targeted attack. In addition to bringing in the SE concept, we extend the model from an attack on the edges to an attack on the vertices of the network. We prove structural results and linear upper bounds or super-linear lower bounds on the social cost of SE under different attack scenarios. For the case that the vertex to be destroyed is chosen uniformly at random from the set of max-sep vertices (i.e., where each causes a maximum number of separated player pairs), we show that there is no tree SE with only one max-sep vertex. We conjecture that there is no tree SE at all. On the other hand, we show that for the uniform measure, all SE are trees (unless two-connected). This opens a new research direction asking where the transition from 'no cycle' to 'at least one cycle' occurs when gradually concentrating the measure on the max-sep vertices.
Subjects: 
network formation game
swap equilibrium
adversary model
destruction model
graph connectivity
network robustness
Persistent Identifier of the first edition: 
Creative Commons License: 
http://creativecommons.org/licenses/by/4.0/
Document Type: 
Article
Appears in Collections:

Files in This Item:
File
Size
261.45 kB





Items in EconStor are protected by copyright, with all rights reserved, unless otherwise indicated.