Skip to main content Accessibility help
×
Hostname: page-component-76fb5796d-dfsvx Total loading time: 0 Render date: 2024-04-29T17:50:19.184Z Has data issue: false hasContentIssue false

22 - Basic Solution Concepts and Algorithms for 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

Aghassi, M. & Bertsimas, D. (2006). Robust game theory. Mathematical Programming, 107, 231273.Google Scholar
Barnhart, C., Johnson, E., Nemhauser, E., Savelsbergh, M., & Vance, P. (1994). Branch and price: Column generation for solving huge integer programs. Operations Research, 46, 316329.Google Scholar
Basar, T., & Olsder, G. H. (1995). Dynamic noncooperative game theory. 2nd edition. San Diego, CA: Academic Press.Google Scholar
Ben-Tal, A., & Nemirovski, A. (2002). Robust optimization – methodology and applications. Mathematical Programming, 92, 453480.CrossRefGoogle Scholar
Bertsimas, D., & Tsitsiklis, J. N. (1994). Introduction to linear optimization. Athena Scientific.Google Scholar
Breton, M., Alg, A., & Haurie, A. (1988). Sequential Stackelberg equilibria in two-person games. Optimization Theory and Applications, 59(1), 7197.CrossRefGoogle Scholar
Conitzer, V., & Sandholm, T. (2006). Computing the optimal strategy to commit to. ACM EC-06: 8290.Google Scholar
Cormen, T. H., Leiserson, C. E., Rivest, R. L., & Stein, C. (2009). Introduction to algorithms. 3rd edition. Cambridge, MA: MIT Press.Google Scholar
Fudenberg, D., & Tirole, J. (1991). Game theory. Cambridge, MA: MIT Press.Google Scholar
Halvorson, E., Conitzer, V., & Parr, R. (2009). Multi-step multi-sensor hider-seeker games. IJCAI, 336341.Google Scholar
Harsanyi, J.C., & Selten, R. (1972). A generalized Nash solution for two-person bargaining games with incomplete information. Management Science, 18(5), 80106.CrossRefGoogle Scholar
Jain, M., Kardes, E., Kiekintveld, C., Ordóñez, F., & Tambe, M. (2010). Security games with arbitrary schedules: A branch and price approach. AAAI.Google Scholar
Jain, M., Kiekintveld, C., & Tambe, M. (2011). Quality-bounded solutions for finite Bayesian Stackelberg games: Scaling up. In Proceedings of the International Conference on Autonomous Agents and Multiagent Systems (AAMAS).Google Scholar
Kiekintveld, C., Islam, T., & Kreinovich, V. (2013). Security games with interval uncertainty. In Twelfth International Conference on Autonomous Agents and Multiagent Systems (AAMAS).Google Scholar
Kiekintveld, C., Jain, M., Tsai, J., Pita, J., Tambe, M., & Ordóñez, F. (2009). Computing optimal randomized resource allocations for massive security games. In AAMAS-09.Google Scholar
Leitmann, , G. (1978). On generalized Stackelberg strategies. Optimization Theory and Applications, 26(4), 637643.CrossRefGoogle Scholar
Lerma, O., Kreinovich, V., & Kiekintveld, C. (2011). Linear-time resource allocation in security games with identical fully protective resources. In AAAI Workshop on Applied Adversarial Reasoning and Risk Modeling.Google Scholar
Osbourne, M.J., & Rubinstein, A. (1994). A course in game theory. Cambridge, MA: MIT Press.Google Scholar
Paruchuri, P., Pearce, J. P., Marecki, J., Tambe, M., Ordóñez, F., & Kraus, S. (2008). Playing games with security: An efficient exact algorithm for Bayesian Stackelberg games. In AAMAS-08, 895902.Google Scholar
Tambe, M. (2011). Security and game theory: Algorithms, deployed systems, lessons learned. Cambridge: Cambridge University Press.Google Scholar
von Stengel, B., & Zamir, S. (2004). Leadership with commitment to mixed strategies. Technical Report LSE-CDAM-2004-01, CDAM Research Report.Google Scholar
Yin, Z, & Tambe, M. (2012). A unified method for handling discrete and continuous uncertainty in Bayesian Stackelberg games. In International Conference on Autonomous Agents and Multiagent Systems (AAMAS).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
×