Computing randomized security strategies in networked domains

AAAI Workshop - Technical Report

Volumn WS-11-06, Issue , 2011, Pages 49-56

  Letchford, Joshua ^a   Vorobeychik, Yevgeniy ^b  

^a Duke University   (United States)

^b SANDIA NATIONAL LABORATORIES   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BENEFITS AND COSTS; LINEAR PROGRAMMING TECHNIQUES; RANDOM GRAPHS; SECURITY MODEL; SECURITY POLICY; SECURITY STRATEGIES; STACKELBERG;

GAME THEORY; PUBLIC WORKS; SECURITY SYSTEMS; SUPPLY CHAINS;

CRITICAL INFRASTRUCTURES;

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

References (12)

1. Conitzer, V., and Sandholm, T. 2006. Computing the optimal strategy to commit to. In Proceedings of the 7th ACM conference on Electronic commerce, EC '06, 82-90. New York, NY, USA: ACM.
2. Cormican, K. J.; Morton, D. P.; and Wood, R. K. 1998. Stochastic network interdiction. Operations Research 46(2):184-197. (Pubitemid 128655394)
3. Dodds, P. S., and Watts, D. J. 2005. A generalized model of social and biological contagion. Journal of Theoretical Biology 232:587-604. (Pubitemid 39575100)
4. Dudenhoeffer, D. D.; Permann, M. R.; and Manic, M. 2006. CIMS: A framework for infrastructure interdependency modeling and analysis. In Perrone, L.; Wieland, F.; Liu, J.; Lawson, B.; Nicol, D.; and Fujimoto, R., eds., Proceedings of the 2006 Winter Simulation Conference, 478-485.
5. Jain, M.; Tsai, J.; Pita, J.; Kiekintveld, C.; Rathi, S.; Tambe, M.; and Ordóñez, F. 2010. Software assistants for randomized patrol planning for the lax airport police and the federal air marshal service. Interfaces 40:267-290.
6. Kempe, D.; Kleinberg, J. M.; and Éva Tardos. 2003. Maximizing the spread of influence in a social network. In Ninth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, 137-146.
7. Kiekintveld, C.; Jain, M.; Tsai, J.; Pita, J.; Ordez, O.; and Tambe, M. 2009. Computing optimal randomized resource allocations for massive security games. In In AAMAS-09.
8. Kunreuther, H., and Heal, G. 2003. Interdependent security. Journal of Risk and Uncertainty 26(2-3):231-249.
9. Newman, M. 2010. Networks: An Introduction. Oxford University Press.
10. Paruchuri, P. 2008. Playing games for security: An efficient exact algorithm for solving bayesian stackelberg games. In In AAMAS.
11. Roy, S.; Ellis, C.; Shiva, S.; Dasgupta, D.; Shandilya, V.; and Wu, Q. 2010. A survey of game theory as applied to network security. In Forty-Third Hawaii International Conference on System Sciences, 1-10.
12. Soramaki, K.; Bech, M. L.; Arnold, J.; Glass, R. J.; and Beyeler, W. 2007. The topology of interbank payment flows. Physica A 379:317-333. (Pubitemid 46453032)