Approximation algorithm for security games with costly resources

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 7090 LNCS, Issue , 2011, Pages 13-24

  Bhattacharya, Sayan ^a   Conitzer, Vincent ^a   Munagala, Kamesh ^a  

^a Duke University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER GAMES; GAME THEORY;

ALLOCATION STRATEGY; GAME-THEORETIC; LOGARITHMIC APPROXIMATION; OPTIMIZATION PROBLEMS; POTENTIAL TARGETS; REAL-WORLD; SECURITY DOMAINS; SECURITY GAMES;

APPROXIMATION ALGORITHMS;

EID: 82955177005     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-25510-6_2     Document Type: Conference Paper

References (13)

1. An, B., Pita, J., Shieh, E., Tambe, M., Kiekintveld, C., Marecki, J.: GUARDS and PROTECT: next generation applications of security games. ACM SIGecom Exchanges 10(1), 31-34(2011)
2. Chen, X., Deng, X.: Settling the complexity of two-player Nash equilibrium. In: FOCS, pp. 261-272(2006)
3. Daskalakis, C., Goldberg, P. W., Papadimitriou, C. H.: The complexity of computing a Nash equilibrium. In: STOC, pp. 71-78(2006) (Pubitemid 44306539)
4. Dobson, G.: Worst-case analysis of greedy heuristics for integer programming with nonnegative data. Mathematics of Operations Research 7(4), 515-531(1982)
5. Etessami, K., Yannakakis, M.: On the complexity of Nash equilibria and other fixed points. SIAM J. Comput. 39(6), 2531-2597(2010)
6. Feige, U.: A threshold of ln n for approximating set-cover. Journal of the ACM 45(4), 634-652(1998)
7. Hochbaum, D.: Approximation Algorithms for NP-hard Problems. PWS Publishing Company (1997)
8. Kiekintveld, C., Jain, M., Tsai, J., Pita, J., Ordóñez, F., Tambe, M.: Computing optimal randomized resource allocations for massive security games. In: AAMAS, pp. 689-696(2009)
9. Korzhyk, D., Conitzer, V., Parr, R.: Complexity of computing optimal Stackelberg strategies in security resource allocation games. In: AAAI, pp. 805-810(2010)
10. Nemhauser, G., Wolsey, L., Fisher, M.: An analysis of approximations for maximizing submodular set functions. Mathematical Programming 14(1), 265-294(1978)
11. Pita, J., Jain, M., Ordóñez, F., Portway, C., Tambe, M., Western, C.: Using game theory for Los Angeles Airport security. AI Magazine 30(1), 43-57(2009)
12. Pita, J., Jain, M., Western, C., Portway, C., Tambe, M., Ordóñez, F., Kraus, S., Parachuri, P.: Deployed ARMOR protection: The application of a game-theoretic model for security at the Los Angeles International Airport. In: AAMAS - Industry and Applications Track, pp. 125-132(2008)
13. Tsai, J., Rathi, S., Kiekintveld, C., Ordóñez, F., Tambe, M.: IRIS - a tool for strategic security allocation in transportation. In: AAMAS - Industry Track, pp. 37-44(2009)