Security Games with Arbitrary Schedules: A Branch and Price Approach

Proceedings of the 24th AAAI Conference on Artificial Intelligence, AAAI 2010

Volumn , Issue , 2010, Pages 792-797

  Jain, Manish ^a   Kardeş, Erim ^a   Kiekintveld, Christopher ^a   Tambe, Milind ^a   Ordóñez, Fernando ^a,b  

^a University of Southern California ^*  (United States)

^b UNIVERSITY OF CHILE   (Chile)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; BRANCH AND BOUND METHOD; LINEAR PROGRAMMING;

BRANCH AND PRICE; CORRECT SOLUTION; DECISION SUPPORTS; FEDERAL AIR MARSHALS SERVICES; INFRASTRUCTURE PROTECTION; SCHEDULING CONSTRAINTS; SECURITY GAMES; STACKELBERG GAMES; STATE-OF-THE-ART ALGORITHMS; SUPPORT TOOL;

DECISION SUPPORT SYSTEMS;

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

References (13)

1. Barnhart, C.; Johnson, E.; Nemhauser, G.; Savelsbergh, M.; and Vance, P. 1994. Branch and price: Column generation for solving huge integer programs. In Operations Research, volume 46, 316-329.
2. Basilico, N.; Gatti, N.; and Amigoni, F. 2009. Leader-follower strategies for robotic patrolling in environments with arbitrary topologies. In AAMAS, 500-503.
3. Bertsimas, D., and Tsitsiklis, J. N. 1994. Introduction to Linear Optimization. Athena Scientific.
4. Breton, M.; Alg, A.; and Haurie, A. 1988. Sequential Stackelberg equilibria in two-person games. Optimization Theory and Applications 59(1):71-97.
5. Conitzer, V., and Sandholm, T. 2006. Computing the optimal strategy to commit to. In ACM EC-06, 82-90.
6. Halvorson, E.; Conitzer, V.; and Parr, R. 2009. Multi-step multi-sensor hider-seeker games. In IJCAI, 336-341.
7. Kiekintveld, C.; Jain, M.; Tsai, J.; Pita, J.; Tambe, M.; and Ordonez, F. 2009. Computing optimal randomized resource allocations for massive security games. In AAMAS, 689-696.
8. Korzhyk, D.; Conitzer, V.; and Parr, R. 2010. Complexity of computing optimal stackelberg strategies in security resource allocation games. In AAAI, to appear.
9. Leitmann, G. 1978. On generalized Stackelberg strategies. Optimization Theory and Applications 26(4):637-643.
10. Paruchuri, P.; Pearce, J. P.; Marecki, J.; Tambe, M.; Ordonez, F.; and Kraus, S. 2008. Playing games with security: An efficient exact algorithm for Bayesian Stackelberg games. In AAMAS-08, 895-902.
11. Pita, J.; Bellamane, H.; Jain, M.; Kiekintveld, C.; Tsai, J.; Ordez, F.; and Tambe, M. 2009. Security applications: Lessons of real-world deployment. In SIGECOM Issue 8.2.
12. Tsai, J.; Rathi, S.; Kiekintveld, C.; Ordez, F.; and Tambe, M. 2009. IRIS a tool for strategic security allocation in transportation networks. In AAMAS-09 (Industry Track), 37-44.
13. von Stengel, B., and Zamir, S. 2004. Leadership with commitment to mixed strategies. Technical Report LSE-CDAM-2004-01, CDAM Research Report.