Next Article in Journal
Swap Equilibria under Link and Vertex Destruction
Next Article in Special Issue
On Information Aggregation and Interim Efficiency in Networks
Previous Article in Journal
Topological Aspects of the Multi-Language Phases of the Naming Game on Community-Based Networks
Article Menu

Export Article

Open AccessArticle
Games 2017, 8(1), 13; doi:10.3390/g8010013

Interdependent Defense Games with Applications to Internet Security at the Level of Autonomous Systems

1
Department of Computer Science, Trinity University, San Antonio, TX 78212, USA
2
Department of Computer Science, Stony Brook University, Stony Brook, NY 11794, USA
3
Tumblr, 35 E 21 Street, Ground Floor, New York, NY 10010, USA
4
Department of Computer and Information Science, University of Michigan-Dearborn, Dearborn, MI 48128, USA
*
Author to whom correspondence should be addressed.
Received: 1 October 2016 / Accepted: 28 December 2016 / Published: 16 February 2017
(This article belongs to the Special Issue Decision Making for Network Security and Privacy)
View Full-Text   |   Download PDF [8064 KB, uploaded 21 February 2017]   |  

Abstract

We propose interdependent defense (IDD) games, a computational game-theoretic framework to study aspects of the interdependence of risk and security in multi-agent systems under deliberate external attacks. Our model builds upon interdependent security (IDS) games, a model by Heal and Kunreuther that considers the source of the risk to be the result of a fixed randomized-strategy. We adapt IDS games to model the attacker’s deliberate behavior. We define the attacker’s pure-strategy space and utility function and derive appropriate cost functions for the defenders. We provide a complete characterization of mixed-strategy Nash equilibria (MSNE), and design a simple polynomial-time algorithm for computing all of them for an important subclass of IDD games. We also show that an efficient algorithm to determine whether some attacker’s strategy can be a part of an MSNE in an instance of IDD games is unlikely to exist. Yet, we provide a dynamic programming (DP) algorithm to compute an approximate MSNE when the graph/network structure of the game is a directed tree with a single source. We also show that the DP algorithm is a fully polynomial-time approximation scheme. In addition, we propose a generator of random instances of IDD games based on the real-world Internet-derived graph at the level of autonomous systems (≈27 K nodes and ≈100 K edges as measured in March 2010 by the DIMES project). We call such games Internet games. We introduce and empirically evaluate two heuristics from the literature on learning-in-games, best-response gradient dynamics (BRGD) and smooth best-response dynamics (SBRD), to compute an approximate MSNE in IDD games with arbitrary graph structures, such as randomly-generated instances of Internet games. In general, preliminary experiments applying our proposed heuristics are promising. Our experiments show that, while BRGD is a useful technique for the case of Internet games up to certain approximation level, SBRD is more efficient and provides better approximations than BRGD. Finally, we discuss several extensions, future work, and open problems. View Full-Text
Keywords: computational game theory; interdependent security; equilibrium computation; equilibrium characterization; fully polynomial-time approximation scheme; learning in games; autonomous-systems internet security application computational game theory; interdependent security; equilibrium computation; equilibrium characterization; fully polynomial-time approximation scheme; learning in games; autonomous-systems internet security application
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

Chan, H.; Ceyko, M.; Ortiz, L. Interdependent Defense Games with Applications to Internet Security at the Level of Autonomous Systems. Games 2017, 8, 13.

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