Playing games for security: An efficient exact algorithm for solving Bayesian Stackelberg games

Proceedings of the International Joint Conference on Autonomous Agents and Multiagent Systems, AAMAS

Volumn 2, Issue , 2008, Pages 877-884

  Paruchuri, Praveen ^a   Pearce, Jonathan P ^b   Marecki, Janusz ^b   Tambe, Milind ^b   Ordonez, Fernando ^b   Kraus, Sarit ^c  

^a INTELLIGENT AUTOMATION INC   (United States)

^b UNIVERSITY OF SOUTHERN CALIFORNIA   (United States)

^c BAR ILAN UNIVERSITY   (Israel)

Author keywords

Bayesian and Stackelberg games; Game theory; Security of agent systems

Indexed keywords

AUTONOMOUS AGENTS; GAME THEORY; LINEAR PROGRAMMING; MULTI AGENT SYSTEMS;

AGENT SYSTEMS; BAYESIAN STACKELBERG GAMES; EFFICIENT EXACT ALGORITHMS; LOS ANGELES INTERNATIONAL AIRPORTS; MIXED INTEGER LINEAR PROGRAMMING; OPTIMAL STRATEGIES; SECURITY DOMAINS; STACKELBERG GAMES;

ALGORITHMS;

EID: 84899919065     PISSN: 15488403     EISSN: 15582914     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (16)

1. R. W. Beard and T. W. McLain. Multiple UAV cooperative search under collision avoidance and limited range communication constraints. In IEEE CDC, 2003.
2. G. Brown, M. Carlyle, J. Salmeron, and K. Wood. Defending critical infrastructure. Interfaces, 36(6):530-544, 2006.
3. J. Brynielsson and S. Amborg. Bayesian games for threat prediction and situation analysis. In FUSION, 2004.
4. J. Cardinal, M. Labbe, S. Langerman, and B. Palop. Pricing of geometric transportation networks. In I7th Canadian Conference on Computational Geometry, 2005.
5. V. Conitzer and T. Sandholm. Computing the optimal strategy to commit to. In EC, 2006.
6. D. Fudenberg and J. Tirole. Game Theory. MIT Press, 1991.
7. J. C. Harsanyi and R. Selten. A generalized Nash solution for two-person bargaining games with incomplete information. Management Science, 18(5):80-106, 1972.
8. D. Koller, N. Megiddo, and B. von Stengel. Fast algorithms for finding randomized strategies in game trees. In 26th ACM Symposium on Theory of Computing, 1994.
9. D. Koller and A. Pfeffer. Representations and solutions for game-theoretic problems. AI, 94( 1-2): 167-215, 1997.
10. Y. A. Korilis, A. A. Lazar, and A. Orda. Achieving network optima using stackelberg routing strategies. In IEEE/ACM Transactions on Networking, 1997.
11. A. Murr. Random checks. In Newsweek National News. http://www.newsweek. com/id/4340I, 28 Sept. 2007.
12. P. Paruchuri, J. P. Pearce, M. Tambe, F. Ordonez, and S. Kraus. An efficient heuristic approach for security against multiple adversaries. In AAMAS, 2007.
13. J. Pita, M. Jain, J. Marecki, F. Ordonez, C. Portway, M. Tambe, C. Western, P. Paruchuri, and S. Kraus. Deployed armor protection: The application of a game theoretic model for security at the los angeles internation airport. In AAMAS Industry Track, 2008.
14. S. Ruan, C. Meirina, F. Yu, K. R. Pattipati, and R. L. Popp. Patrolling in a stochastic environment. In 10th Intl. Command and Control Research and Tech. Symp., 2005.
15. T. Sandholm, A. Gilpin, and V. Conitzer. Mixed-integer programming methods for finding nash equilibria. In AAAI, 2005.
16. L. A. Wolsey. Integer Programming. John Wiley, 1998.