Next Article in Journal
On Information Aggregation and Interim Efficiency in Networks
Previous Article in Journal
Interdependent Defense Games with Applications to Internet Security at the Level of Autonomous Systems
Article Menu

Export Article

Open AccessArticle
Games 2017, 8(1), 14; doi:10.3390/g8010014

Swap Equilibria under Link and Vertex Destruction

Department of Computer Science, Kiel University, Christian-Albrechts-Platz 4, 24118 Kiel, Germany
*
Author to whom correspondence should be addressed.
Academic Editors: Klaus Ritzberger, Ryuhei Uehara, John W. Patty and Ulrich Berger
Received: 3 December 2016 / Revised: 6 February 2017 / Accepted: 14 February 2017 / Published: 22 February 2017
View Full-Text   |   Download PDF [261 KB, uploaded 22 February 2017]   |  

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. View Full-Text
Keywords: network formation game; swap equilibrium; adversary model; destruction model; graph connectivity; network robustness network formation game; swap equilibrium; adversary model; destruction model; graph connectivity; network robustness
Figures

Figure 1

This is an open access article distributed under the Creative Commons Attribution License which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited. (CC BY 4.0).

Scifeed alert for new publications

Never miss any articles matching your research from any publisher
  • Get alerts for new papers matching your research
  • Find out the new papers from selected authors
  • Updated daily for 49'000+ journals and 6000+ publishers
  • Define your Scifeed now

SciFeed Share & Cite This Article

MDPI and ACS Style

Kliemann, L.; Shirazi Sheykhdarabadi, E.; Srivastav, A. Swap Equilibria under Link and Vertex Destruction. Games 2017, 8, 14.

Show more citation formats Show less citations formats

Note that from the first issue of 2016, MDPI journals use article numbers instead of page numbers. See further details here.

Related Articles

Article Metrics

Article Access Statistics

1

Comments

[Return to top]
Games EISSN 2073-4336 Published by MDPI AG, Basel, Switzerland RSS E-Mail Table of Contents Alert
Back to Top