Skip to main content Accessibility help
×
Hostname: page-component-76fb5796d-5g6vh Total loading time: 0 Render date: 2024-04-29T20:37:05.770Z Has data issue: false hasContentIssue false

23 - Mixed-Integer Optimization Methods for Solving Stackelberg Security Games

Published online by Cambridge University Press:  13 December 2017

Ali E. Abbas
Affiliation:
University of Southern California
Milind Tambe
Affiliation:
University of Southern California
Detlof von Winterfeldt
Affiliation:
University of Southern California
Get access

Summary

Image of the first page of this content. For PDF version, please use the ‘Save PDF’ preceeding this image.'
Type
Chapter
Information
Publisher: Cambridge University Press
Print publication year: 2017

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

Alpern, S., Morton, A., & Papadaki, K. (2011). Patrolling games. Operations Research, 59, 12461257.Google Scholar
Barnhart, C., Johnson, E. L., Nemhauser, G. L., Savelsbergh, M. W., & Vance, P. H. (1998). Branch-and-price: Column generation for solving huge integer programs. Operations Research, 46(3), 316329.Google Scholar
Bertsimas, D., & Tsitsiklis, J. N. (1997). Introduction to linear optimization, volume 6. Belmont, MA: Athena Scientific.Google Scholar
Brown, M., Haskell, W. B., & Tambe, M. (2014). Addressing scalability and robustness in security games with multiple boundedly rational adversaries. In Decision and Game Theory for Security (pp. 2342). Springer.Google Scholar
Casorrán-Amilburu, C., Fortz, B., Labbé, M., & Ordóñez, F. (2015). Novel formulations for Stackelberg security games. Technical report, Départment d’Informatique, Université Libre de Bruxelles.Google Scholar
de Farias, D. P., & Van Roy, B. (2014, August). On constraint sampling in the linear programming approach to approximate dynamic programming. Mathematics of Operations Research, 29(3), 462478.Google Scholar
Hochbaum, D. S., Lyu, C., & Ordóñez, F. (2014). Security routing games with multivehicle Chinese postman problem. Networks, 64(3), 181191.Google Scholar
Jain, M., Conitzer, V., & Tambe, M. (2013). Security scheduling for real-world networks. In International Conference on Autonomous Agents and Multiagent Systems (AAMAS).Google Scholar
Jain, M., Kardes, E., Kiekintveld, C., Ordónez, F., & Tambe, M. (2010). Security games with arbitrary schedules: A branch and price approach. AAAI.Google Scholar
Jain, M., Korzhyk, D., Vanek, O., Conitzer, V., Pechoucek, M., & Tambe, M. (2011). A double oracle algorithm for zero-sum security games on graphs. In International Conference on Autonomous Agents and Multiagent Systems (AAMAS).Google Scholar
Jain, M., Tsai, J., Pita, J., Kiekintveld, C., Rathi, S., Ordóñez, F., & Tambe., M. (2010). Software assistants for randomized patrol planning for the LAX airport police and the federal air marshals service. Interfaces, 40(4), 267290.CrossRefGoogle Scholar
Kiekintveld, C., Jain, M., Tsai, J., Pita, J., Ordóñez, F., & Tambe, M. (2009). Computing optimal randomized resource allocations for massive security games. In Proceedings of the 8th International Conference on Autonomous Agents and Multiagent Systems-Volume 1 (pp. 689696). International Foundation for Autonomous Agents and Multiagent Systems.Google Scholar
Kortanek, K., & No, H. (1993). A central cutting plane algorithm for convex semi-infinite programming problems. SIAM Journal on Optimization, 3(4), 901918.Google Scholar
Lagos, F., Ordóñez, F., & Labbé, M. (2015). Column generation for a strong formulation of Stackelberg games. In AAAI 2015 Spring Symposium Series.Google Scholar
Paruchuri, P., Pearce, J., Marecki, J., Tambe, M., Ordóñez, F., & Kraus, S. (2008). Playing games for security: An efficient exact algorithm for solving Bayesian games. In Proceedings of the 7th International Conference on Autonomous Agents and Multiagent Systems. International Foundation for Autonomous Agents and Multiagent Systems.Google Scholar
Ruszczynski, , A. (2006). Nonlinear optimization. Princeton, NJ: Princeton University Press.Google Scholar
Shieh, E., An, B., Yang, R., Tambe, M., Baldwin, C., DiRenzo, J., Maule, B., & Meyer, G. (2012). PROTECT: An application of computational game theory for the security of the ports of the United States. In Conference on Artificial Intelligence (AAAI) – Spotlight Track.Google Scholar
Spencer, , T. (2013). A heuristic algorithm for a Stackelberg security game on a network. Master’s thesis, Universidad de Chile.Google Scholar
Yang, R., Jiang, A. X., Tambe, M., & Ordóñez, F. (2013). Scaling-up security games with boundedly rational adversaries: A cutting-plane approach. In Proceedings of the 23rd International Joint Conference on Artificial Intelligence (pp. 404410). AAAI Press.Google Scholar
Yang, R., Kiekintveld, C., Ordóñez, F., Tambe, M., & John, R. (2013). Improving resource allocation strategies against human adversaries in security games: An extended study. Artificial Intelligence Journal (AIJ), 195, 440469.CrossRefGoogle Scholar
Yin, Z., Jain, M., Tambe, M., & Ordóñez, F. (2011). Risk-averse strategies for security games with execution and observational uncertainty. In Conference on Artificial Intelligence (AAAI).Google Scholar

Save book to Kindle

To save this book to your Kindle, first ensure coreplatform@cambridge.org is added to your Approved Personal Document E-mail List under your Personal Document Settings on the Manage Your Content and Devices page of your Amazon account. Then enter the ‘name’ part of your Kindle email address below. Find out more about saving to your Kindle.

Note you can select to save to either the @free.kindle.com or @kindle.com variations. ‘@free.kindle.com’ emails are free but can only be saved to your device when it is connected to wi-fi. ‘@kindle.com’ emails can be delivered even when you are not connected to wi-fi, but note that service fees apply.

Find out more about the Kindle Personal Document Service.

Available formats
×

Save book to Dropbox

To save content items to your account, please confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your account. Find out more about saving content to Dropbox.

Available formats
×

Save book to Google Drive

To save content items to your account, please confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your account. Find out more about saving content to Google Drive.

Available formats
×