Interdependent defense games: Modeling interdependent security under deliberate attacks

Uncertainty in Artificial Intelligence - Proceedings of the 28th Conference, UAI 2012

Volumn , Issue , 2012, Pages 152-162

  Chan, Hau ^a   Ceyko, Michael ^b   Ortiz, Luis E ^a  

^a Stony Brook University   (United States)

^b HARVARD UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

AUTONOMOUS SYSTEMS; GAME-THEORETIC; NASH EQUILIBRIA; POLYNOMIAL-TIME ALGORITHMS; REAL-WORLD; UTILITY FUNCTIONS;

ALGORITHMS; MULTI AGENT SYSTEMS; POLYNOMIALS;

COMPUTER GAMES;

EID: 84886075365     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (31)

1. Vicki M. Bier and M. Naceur Azaiez, editors. Game Theoretic Risk Analysis of Security Threats. Springer, 2009.
2. Eva Carceles-Poveda and Yair Tauman. Strategic aspects of terrorism. Games and Economic Behavior, 2011. Forthcoming.
3. Hau Chan, Michael Ceyko, and Luis E. Ortiz. Interdependent defense games: Modeling interdependent security under deliberate attacks (Supplementary Material). http://www.cs.stonybrook.edu/ ~leortiz/papers/dg-UAI-SM-final.pdf, June 2012.
4. Xi Chen, Xiaotie Deng, and Shang-Hua Teng. Settling the complexity of computing two-player Nash equilibria. J. ACM, 56(3):1-57, 2009.
5. Vincent Conitzer and Tuomas Sandholm. New complexity results about Nash equilibria. Games and Economic Behavior, 63(2):621-641, 2008.
6. Second World Congress of the Game Theory Society. Marco Cremonini and Dmitri Nizovtsev. Understanding and influencing attackers' decisions: Implications for security investment strategies. In The Fifth Workshop on the Economics of Information Security (WEIS 2006), 2006.
7. Constantinos Daskalakis, Paul W. Goldberg, and Christos H. Papadimitriou. The complexity of computing a Nash equilibrium. Commun. ACM, 52(2): 89-97, 2009.
8. D. Fudenberg and D. Levine. The Theory of Learning in Games. MIT Press, 1999.
9. Neal Fultz and Jens Grossklags. Blue versus red: Towards a model of distributed security attacks. In Roger Dingledine and Philippe Golle, editors, Financial Cryptography and Data Security, pages 167-183. Springer-Verlag, Berlin, Heidelberg, 2009.
10. I. Gilboa and E. Zemel. Nash and correlated equilibria: some complexity considerations. Games and Economic Behavior, 1:80-93, 1989.
11. Konstantinos Gkonis and Harilaos Psaraftis. Container transportation as an interdependent security problem. Journal of Transportation Security, 3:197-211, 2010.
12. Georg Gottlob, Gianluigi Greco, and Francesco Scarcello. Pure Nash equilibria: Hard and easy games. J. Artif. Int. Res., 24(1):357-406, 2005.
13. Geoffrey Heal and Howard Kunreuther. IDS models of airline security. Journal of Conflict Resolution, 49 (2):201-217, April 2005.
14. Geoffrey Heal and Howard Kunreuther. Modeling interdependent risks. Risk Analysis, 27:621-634, July 2007.
15. Manish Jain, Dmytro Korzhyky, Ondrej Vanek, Vincent Conitzery, Michal Pechoucek, and Milind Tambe. A double oracle algorithm for zero-sum security games on graphs. In AAMAS, 2011.
16. Benjamin Johnson, Jens Grossklags, Nicolas Christin, and John Chuang. Uncertainty in interdependent security games. In Proceedings of the First International Conference on Decision and Game Theory for Security, GameSec'10, pages 234-244.
17. Berlin, Heidelberg, 2010. Springer-Verlag. M. Kearns, M. Littman, and S. Singh. Graphical models for game theory. In Proceedings of the Conference on Uncertainty in Artificial Intelligence, pages 253-260, 2001.
18. Michael Kearns. Economics, computer science, and policy. Issues in Science and Technology, Winter 2005.
19. Michael Kearns. Graphical games. In Noam Nisan, Tim Roughgarden, Eva Tardos, and Vijay V. Vaziran, editors, Algorithmic Game Theory, chapter 7, pages 159-180. Cambridge University Press, 2007.
20. Michael Kearns and Luis E. Ortiz. Algorithms for interdependent security games. In Neural Information Processing Systems (NIPS), 2003.
21. Christopher Kiekintveld, Manish Jain, Jason Tsai, James Pita, Fernando Ordonez, and Milind Tambe. Computing optimal randomized resource allocations for massive security games. In AAMAS, pages 689-696, 2009.
22. Dmytro Korzhyk, Vincent Conitzer, and Ronald Parr. Complexity of computing optimal Stackelberg strategies in security resource allocation games. In AAAI, 2010.
23. Dmytro Korzhyk, Vincent Conitzer, and Ronald Parr. Security games with multiple attacker resources. In IJCAI, pages 273-279, 2011a.
24. Dmytro Korzhyk, Vincent Conitzer, and Ronald Parr. Solving Stackelberg games with uncertain observability. In AAMAS, pages 1013-1020, 2011b.
25. Howard Kunreuther and Geoffrey Heal. Interdependent security. Journal of Risk and Uncertainty, 26 (2-3):231-249, March 2003.
26. Peng Liu. Incentive-based modeling and inference of attacker intent, objectives, and strategies. In Proc. of the 10th ACM Computer and Communications Security Conference (CCS'03), pages 179-189, 2003.
27. Kong-Wei Lye and Jeannette Wing. Game strategies in network security. In Proceedings of the Workshop on Foundations of Computer Security, pages 1-2, 2002.
28. Anahad O'Connor and Eric Schmitt. Terror attempt seen as man tries to ignite device on jet. The New York Times, 25 December 2009. Cited 31 August 2010. Avaliable at http://www.nytimes.com/ 2009/12/26/us/26plane.html.
29. Sankardas Roy, Charles Ellis, Sajjan Shiva, Dipankar Dasgupta, Vivek Shandilya, and QishiWu. A survey of game theory as applied to network security. In Proceedings of the 2010 43rd Hawaii International Conference on System Sciences, HICSS '10, pages 1-10
30. Washington, DC, USA, 2010. IEEE Computer Society. Yuval Shavitt and Eran Shir. DIMES: Let the Internet measure itself. ACM SIGCOMM Computer Communication Review, 35(5):71-74, October 2005.
31. Satinder P. Singh, Michael J. Kearns, and Yishay Mansour. Nash convergence of gradient dynamics in general-sum games. In UAI, pages 541-548, 2000.