Quality-bounded solutions for finite Bayesian stackelberg games: Scaling up

10th International Conference on Autonomous Agents and Multiagent Systems 2011, AAMAS 2011

Volumn 2, Issue , 2011, Pages 937-944

  Jain, Manish ^a   Kiekintveld, Christopher ^b   Tambe, Milind ^a  

^a Computer Science Department University of Southern California ^*  (United States)

^b University of Texas at El Paso   (United States)

Author keywords

Bayesian stackelberg games; Game theory; Hierarchical decomposition

Indexed keywords

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

ALGORITHM FOR SOLVING; BAYESIAN STACKELBERG GAMES; BRANCH AND BOUND SEARCH; FEDERAL AIR MARSHALS SERVICES; HIERARCHICAL DECOMPOSITIONS; INTERNATIONAL FLIGHTS; ORDERS OF MAGNITUDE; PRACTICAL SOLUTIONS;

APPROXIMATION ALGORITHMS;

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

References (17)

1. N. Agmon, V. Sadov, G. A. Kaminka, and S. Kraus. The Impact of Adversarial Knowledge on Adversarial Planning in Perimeter Patrol. In AAMAS, Volume 1, pages 55-62, 2008.
2. R. Avenhaus, B. von Stengel, and S. Zamir. Inspection Games. In R. J. Aumann and S. Hart, editors, Handbook of Game Theory, Volume 3, chapter 51, pages 1947-1987. North-Holland, Amsterdam, 2002.
3. N. Basilico, N. Gatti, and F. Amigoni. Leader-follower strategies for robotic patrolling in environments with arbitrary topologies. In AAMAS, pages 500-503, 2009.
4. D. Bertsimas and J. N. Tsitsiklis. Introduction to Linear Optimization. Athena Scientific, 1994.
5. V. Conitzer and T. Sandholm. Computing the optimal strategy to commit to. In ACM EC-06, pages 82-90, 2006.
6. J. Harsanyi and R. Selten. A generalized nash solution for two-person bargaining games with incomplete information. In Management Science, Volume 18, pages 80-106, 1972.
7. M. Jain, E. Kardes, C. Kiekintveld, F. Ordonez, and M. Tambe. Security games with arbitrary schedules: A branch and price approach. In AAAI, pages 792-797, 2010.
8. M. Jain, J. Tsai, J. Pita, C. Kiekintveld, S. Rathi, M. Tambe, and F. Ordonez. Software Assistants for Randomized Patrol Planning for the LAX Airport Police and the Federal Air Marshals Service. Interfaces, 40:267-290, 2010.
9. C. Kiekintveld, M. Jain, J. Tsai, J. Pita, M. Tambe, and F. Ordonez. Computing optimal randomized resource allocations for massive security games. In AAMAS, pages 689-696, 2009.
10. C. Kiekintveld, J. Marecki, and M. Tambe. Approximation methods for infinite Bayesian Stackelberg games: Modeling distributional payoff uncertainty. In AAMAS, 2011-to appear.
11. M. Kodialam and T. Lakshman. Detecting network intrusions via sampling: A game theoretic approach. In INFOCOM, pages 1880-1889, 2003.
12. D. Korzhyk, V. Conitzer, and R. Parr. Complexity of computing optimal stackelberg strategies in security resource allocation games. In AAAI, pages 805-810, 2010.
13. G. Leitmann. On generalized Stackelberg strategies. Optimization Theory and Applications, 26(4):637-643, 1978.
14. J. Letchford, V. Conitzer, and K. Munagala. Learning and approximating the optimal strategy to commit to. In SAGT, pages 250-262, 2009.
15. 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 AAMAS-08, pages 895-902, 2008.
16. J. Tsai, S. Rathi, C. Kiekintveld, F. Ordonez, and M. Tambe. IRIS: a tool for strategic security allocation in transportation networks. In AAMAS (Industry Track), pages 37-44, 2009.
17. M. P. Wellman, D. M. Reeves, K. M. Lochner, S.-F. Cheng, and R. Suri. Approximate strategic reasoning through hierarchical reduction of large symmetric games. In AAAI, pages 502-508, 2005.