Security scheduling for real-world networks

12th International Conference on Autonomous Agents and Multiagent Systems 2013, AAMAS 2013

Volumn 1, Issue , 2013, Pages 215-222

  Jain, Manish ^a   Conitzer, Vincent ^b   Tambe, Milind ^a  

^a University of Southern California   (United States)

^b Duke University   (United States)

Author keywords

Double oracle; Game theory; Minimax; Zero sum games

Indexed keywords

ALGORITHMS; AUTONOMOUS AGENTS; GAME THEORY; LAW ENFORCEMENT; MULTI AGENT SYSTEMS; NETWORK SECURITY; OPTIMAL SYSTEMS; OPTIMIZATION;

DAY-TO-DAY OPERATIONS; DOUBLE ORACLE; MINIMAX; NETWORK SECURITY PROBLEMS; REAL-WORLD NETWORKS; STATE-OF-THE-ART ALGORITHMS; URBAN ROAD NETWORKS; ZERO-SUM GAME;

PROBLEM SOLVING;

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

References (16)

1. S. Alpern. Infiltration Games on Arbitrary Graphs. Journal of Mathematical Analysis and Applications, 163: 286-288, 1992.
2. D. Eppstein and M. T. Goodrich. Studying (Non-Planar) Road Networks Through an Algorithmic Lens. CoRR, abs/0808.3694, 2008.
3. S. Gal. Search Games. Academic Press, New York, 1980.
4. M. Haklay and P. Weber. Openstreetmap: user-generated street maps. Pervasive Computing, IEEE, 7(4): 12-18, 2008.
5. E. Halvorson, V. Conitzer, and R. Parr. Multi-step Multi-sensor Hider-Seeker Games. In IJCAI, pages 159-166, 2009.
6. M. Jain, D. Korzhyk, O. Vanek, V. Conitzer, M. Pechoucek, and M. Tambe. A Double Oracle Algorithm for Zero-Sum Security Games on Graphs. In AAMAS, 2011.
7. M. Jain, K. Leyton-Brown, and M. Tambe. The Deployment-to-Saturation Ratio in Security Games. In AAAI, 2012.
8. H. B. McMahan, G. J. Gordon, and A. Blum. Planning in the Presence of Cost Functions Controlled by an Adversary. In ICML, pages 536-543, 2003.
9. G. L. Nemhauser, L. A. Wolsey, and M. L. Fisher. An Analysis of Approximations for Maximizing Submodular Set Functions-I. Mathematical Programming, 14(1): 265-294, Dec 1978.
10. S. Okamoto, N. Hazon, and K. Sycara. Solving non-zero sum multiagent network flow security games with attack costs. In AAMAS, pages 879-888, 2012.
11. E. Shieh, B. An, R. Yang, M. Tambe, C. Baldwin, J. DiRenzo, B. Maule, and G. Meyer. Protect: A Deployed Game Theoretic System to Protect the Ports of the United States. In AAMAS, 2012.
12. J. Tsai, Z. Yin, J. young Kwak, D. Kempe, C. Kiekintveld, and M. Tambe. Urban Security: Game-Theoretic Resource Allocation in Networked Physical Domains. In AAAI, pages 881-886, 2010.
13. O. Vanek, Z. Yin, M. Jain, B. Bosansky, M. Tambe, and M. Pechoucek. Game-theoretic resource allocation for malicious packet detection in computer networks. In AAMAS, 2012.
14. A. Washburn and K. Wood. Two-person Zero-sum Games for Network Interdiction. Operations Research, 43(2): 243-251, 1995.
15. R. Yang, F. Fang, A. X. Jiang, K. Rajagopal, M. Tambe, and R. Maheswaran. Designing Better Strategies against Human Adversaries in Network Security Games. In AAMAS (Extended Abstract), 2012.
16. Z. Yin, D. Korzhyk, C. Kiekintveld, V. Conitzer, and M. Tambe. Stackelberg vs. Nash in Security Games: Interch-angeability, Equivalence, and Uniqueness. In AAMAS, pages 1139-1146, 2010.