Skip to main content Accessibility help
×
Hostname: page-component-848d4c4894-x24gv Total loading time: 0 Render date: 2024-05-29T04:37:44.225Z Has data issue: false hasContentIssue false

11 - Approximation Methods for Infinite Bayesian Stackelberg Games: Modeling Distributional Payoff Uncertainty

from PART IV - FUTURE RESEARCH

Published online by Cambridge University Press:  05 January 2012

Milind Tambe
Affiliation:
University of Southern California
Get access

Summary

Introduction

Stackelberg games are increasingly important for informing real-world decision making, including a growing body of work that applies these techniques in security domains such as critical infrastructure protection (Bier, 2007; Sandler and D. G. A. M., 2003), computer networks (Alpcan and Basar, 2003; Nguyen and Basar 2009), and robot patrolling strategies (Agmon et al., 2009; Basilico, Gatti, and Amigoni, 2009; Gatti, 2008). Two software systems that use this type of game modeling are in use by the the Los Angeles International Airport (LAX) (Pita et al., 2008) and the Federal Air Marshals Service (FAMS) (Tsai et al., 2009) to assist with resource allocation decision. A key issue that has arisen in these applications is whether the models can accurately represent the uncertainty that domain experts have about the inputs used to construct the game models, including the preferences and capabilities of terrorist adversaries.

To apply game-theoretic reasoning, the first step in the analysis is to construct a precise game model. The typical approach (e.g., in the LAX and FAMS applications) is to construct a model using a combination of the available data and expert opinions. Unfortunately, the data is often limited or imprecise, especially in regard to information about the terrorist adversaries. For example, it can be difficult to predict precisely how attackers will weigh casualties, economic consequences, media exposure, and other factors when selecting targets.

Type
Chapter
Information
Security and Game Theory
Algorithms, Deployed Systems, Lessons Learned
, pp. 213 - 232
Publisher: Cambridge University Press
Print publication year: 2011

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

M., Aghassi and D., Bertsimas. Robust game theory. Mathematical Programming: Series A and B, 107(1):231–273, 2006.Google Scholar
N., Agmon, S., Kraus, G.A., Kaminka, and V., Sadov. Adversarial uncertainty in multi-robot patrol. In IJCAI, 2009.Google Scholar
T., Alpcan and T., Basar. A game theoretic approach to decision and analysis in network intrusion detection. In Proc. of the 42nd IEEE Conference on Decision and Control, 2003.Google Scholar
O., Armantier, J.-P., Florens, and J.-F., Richard. Approximation of Bayesian Nash equilibrium. Journal of Applied Econometrics, 23(7):965–981, December 2008.Google Scholar
N., Basiloco, N., Gatti, and F., Amigoni. Leader-follower strategies for robotic patrolling in environments with arbitrary topologies. In International Conference on Autonomous Agents and Multiagent Systems (AAMAS), 2009.Google Scholar
V. M., Bier. Choosing what to protect. Risk Analysis, 27(3):607–620, 2007.Google Scholar
G., Cai and P. R., Wurman. Monte Carlo approximation in incomplete information, sequential auction games. Decision Support Systems, 39(2):153–168, 2005.Google Scholar
S., Ceppi, N., Gatti, and N., Basilico. Computing Bayes-Nash equilibria through support enumeration methods in Bayesian two-player strategic-form games. In Proceedings of the ACM/IEEE International Conference on Intelligent Agent Technology (IAT), Milan, Italy, September 15–18, 2009.Google Scholar
V., Conitzer and T., Sandholm. Computing the optimal strategy to commit to. In ACM Conference on Electronic Commerce, 2006.Google Scholar
N., Gatti. Game theoretical insights in strategic patrolling: Model and algorithm in normal-form. In European Conference on AI (ECAI), 2008.Google Scholar
J. C., Harsanyi. Games with incomplete information played by Bayesian players (parts i–iii). Management Science, 14, 1967–8.Google Scholar
M., Jain, C., Kiekintveld, and M., Tambe. Quality-bounded solutions for finite Bayesian Stackelberg games: Scaling up. In International Conference on Autonomous Agents and Multiagent Systems (AAMAS), 2011.Google Scholar
C., Kiekintveld, M., Jain, J., Tsai, J., Pita, F., Ordóñez, and M., Tambe. Computing optimal randomized resource allocations for massive security games. In International Conference on Autonomous Agents and Multiagent Systems (AAMAS), 2009.Google Scholar
V., Krishna. Auction Theory. Academic Press, 2002.Google Scholar
R. D., Luce and H., Raiffa. Games and Decisions. John Wiley and Sons, New York, 1957. Dover republication 1989.
D., McFadden. Quantal choice analysis: A survey. Annals of Economic and Social Measurement, 5(4):363–390, 1976.Google Scholar
K. C., Nguyen and T. A. T., Basar. Security games with incomplete information. In Proc. of IEEE Intl. Conf. on Communications (ICC 2009), 2009.Google Scholar
P., Paruchuri, J. P., Pearce, J., Marecki, M., Tambe, F., Ordonez, and S., Kraus. Playing games with security: An efficient exact algorithm for Bayesian Stackelberg games. In International Conference on Autonomous Agents and Multiagent Systems (AAMAS), 2008.Google Scholar
J., Pita, M., Jain, F., Ordóñez, M., Tambe, S., Kraus, and R., Magori-Cohen. Effective solutions for real-world Stackelberg games: When agents must deal with human uncertainties. In International Conference on Autonomous Agents and Multiagent Systems (AAMAS), 2009.Google Scholar
J., Pita, M., Jain, C., Western, C., Portway, M., Tambe, F., Ordonez, S., Kraus, and P., Paruchuri. Depoloyed ARMOR protection: The application of a game-theoretic model for security at the Los Angeles International Airport. In International Conference on Autonomous Agents and Multiagent Systems (AAMAS) (Industry Track), 2008.Google Scholar
D. M., Reeves and M. P., Wellman. Computing best-response strategies in infinite games of incomplete information. In International Conference on Uncertainty in AI (UAI), 2004.Google Scholar
T., Sandler and D. G. A. M., Terrorismand game theory. Simulation and Gaming, 34(3):319–337, 2003.Google Scholar
P., Taylor and L., Jonker. Evolutionary stable strategies and game dynamics. Mathematical Biosciences, 16:76–83, 1978.Google Scholar
J., Tsai, S., Rathi, C., Kiekintveld, F., Ordóñez, and M., Tambe. IRIS - A tools for strategic security allocation in transportation networks. In International Conference on Autonomous Agents and Multiagent Systems (AAMAS) (Industry Track), 2009.Google Scholar
H., von Stackelberg. Marktform und Gleichgewicht. Springer, Vienna, 1934.Google Scholar
K., wei Lye and J. M., Wing. Game strategies in network security. International Journal of Information Security, 4(1–2):71–86, 2005.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
×