Securing interdependent assets
| LEADER | caa a22 4500 | ||
|---|---|---|---|
| 001 | 605514925 | ||
| 003 | CHVBK | ||
| 005 | 20210128100706.0 | ||
| 007 | cr unu---uuuuu | ||
| 008 | 210128e20150301xx s 000 0 eng | ||
| 024 | 7 | 0 | |a 10.1007/s10458-014-9258-0 |2 doi |
| 035 | |a (NATIONALLICENCE)springer-10.1007/s10458-014-9258-0 | ||
| 245 | 0 | 0 | |a Securing interdependent assets |h [Elektronische Daten] |c [Yevgeniy Vorobeychik, Joshua Letchford] |
| 520 | 3 | |a Stackelberg security game models have become among the leading practical game theoretic approaches to security, having seen actual deployment in the LAX Airport, the United States Federal Air Marshals Service, and the United States Coast Guard, among others. However, most techniques for computing optimal security policies in Stackelberg games to date do not explicitly account for interdependencies among targets. We introduce a novel framework for computing optimal randomized security policies in networked (interdependent) domains. Our framework rests upon a Stackelberg security game model, within which we explicitly capture the indirect spread of damages due either to malicious attacks or unintended failures. We proceed to specify a particular simple, yet natural model of damage spread based on a graphical representation of asset interdependencies coupled with an independent failure cascade model. For the general model, we present an algorithm based on submodularity of the attacker's decision problem, in combination with local search, to approximate optimal security resource allocation across the assets, and show experimentally that our algorithm is far more scalable than an alternative exact approach, yields nearly optimal results, and offers substantial improvement over a well-known heuristic alternative. We then show that in a particular important special case we can compute optimal security policies exactly and efficiently. We proceed to apply our framework to study comparative network resilience, unifying previously disparate strands of research in the area, and to offer insights into other aspects of the interdependent security problem. | |
| 540 | |a The Author(s), 2014 | ||
| 700 | 1 | |a Vorobeychik |D Yevgeniy |u Vanderbilt University, 2301 Vanderbilt Place, 37235-1679, Nashville, TN, USA |4 aut | |
| 700 | 1 | |a Letchford |D Joshua |u Sandia National Laboratories, P.O. Box 969, Livermore, CA, USA |4 aut | |
| 773 | 0 | |t Autonomous Agents and Multi-Agent Systems |d Springer US; http://www.springer-ny.com |g 29/2(2015-03-01), 305-333 |x 1387-2532 |q 29:2<305 |1 2015 |2 29 |o 10458 | |
| 856 | 4 | 0 | |u https://doi.org/10.1007/s10458-014-9258-0 |q text/html |z Onlinezugriff via DOI |
| 898 | |a BK010053 |b XK010053 |c XK010000 | ||
| 900 | 7 | |a Metadata rights reserved |b Springer special CC-BY-NC licence |2 nationallicence | |
| 908 | |D 1 |a research-article |2 jats | ||
| 949 | |B NATIONALLICENCE |F NATIONALLICENCE |b NL-springer | ||
| 950 | |B NATIONALLICENCE |P 856 |E 40 |u https://doi.org/10.1007/s10458-014-9258-0 |q text/html |z Onlinezugriff via DOI | ||
| 950 | |B NATIONALLICENCE |P 700 |E 1- |a Vorobeychik |D Yevgeniy |u Vanderbilt University, 2301 Vanderbilt Place, 37235-1679, Nashville, TN, USA |4 aut | ||
| 950 | |B NATIONALLICENCE |P 700 |E 1- |a Letchford |D Joshua |u Sandia National Laboratories, P.O. Box 969, Livermore, CA, USA |4 aut | ||
| 950 | |B NATIONALLICENCE |P 773 |E 0- |t Autonomous Agents and Multi-Agent Systems |d Springer US; http://www.springer-ny.com |g 29/2(2015-03-01), 305-333 |x 1387-2532 |q 29:2<305 |1 2015 |2 29 |o 10458 | ||