Scaling-Up Stackelberg Security Games Applications Using Approximations
暂无分享,去创建一个
Milind Tambe | Arunesh Sinha | Aaron Schlenker | Donnabell Dmello | Milind Tambe | Arunesh Sinha | Aaron Schlenker | Donnabell Dmello
[1] Vincent Conitzer,et al. Solving Security Games on Graphs via Marginal Probabilities , 2013, AAAI.
[2] Paul R. Milgrom,et al. Designing Random Allocation Mechanisms: Theory and Applications , 2013 .
[3] Giorgio Gambosi,et al. Complexity and Approximation , 1999, Springer Berlin Heidelberg.
[4] Giorgio Gambosi,et al. Complexity and approximation: combinatorial optimization problems and their approximability properties , 1999 .
[5] Branislav Bosanský,et al. Combining Compact Representation and Incremental Generation in Large Games with Sequential Strategies , 2015, AAAI.
[6] Aravind Srinivasan,et al. Solving Packing Integer Programs via Randomized Rounding with Alterations , 2012, Theory Comput..
[7] Milind Tambe,et al. One Size Does Not Fit All: A Game-Theoretic Approach for Dynamically and Effectively Screening for Threats , 2016, AAAI.
[8] Bo An,et al. Coalitional Security Games , 2016, AAMAS.
[9] Manish Jain,et al. Security Games with Arbitrary Schedules: A Branch and Price Approach , 2010, AAAI.
[10] Tuomas Sandholm,et al. Safe and Nested Subgame Solving for Imperfect-Information Games , 2017, NIPS.
[11] Fernando Ordóñez,et al. Building Real Stackelberg Security Games for Border Patrols , 2017, GameSec.
[12] Juliane Hahn,et al. Security And Game Theory Algorithms Deployed Systems Lessons Learned , 2016 .
[13] Milind Tambe,et al. Urban security: game-theoretic resource allocation in networked physical domains , 2010, AAAI 2010.
[14] Haifeng Xu,et al. The Mysteries of Security Games: Equilibrium Computation Becomes Combinatorial Algorithm Design , 2016, EC.
[15] Kevin Waugh,et al. DeepStack: Expert-level artificial intelligence in heads-up no-limit poker , 2017, Science.
[16] Vincent Conitzer,et al. Complexity of Computing Optimal Stackelberg Strategies in Security Resource Allocation Games , 2010, AAAI.
[17] Kevin Waugh,et al. DeepStack: Expert-Level Artificial Intelligence in No-Limit Poker , 2017, ArXiv.
[18] Milind Tambe,et al. Get Me to My GATE on Time: Efficiently Solving General-Sum Bayesian Threat Screening Games , 2016, ECAI.
[19] Prabhakar Raghavan,et al. Randomized rounding: A technique for provably good algorithms and algorithmic proofs , 1985, Comb..
[20] Manish Jain,et al. Computing optimal randomized resource allocations for massive security games , 2009, AAMAS 2009.
[21] John C. Harsanyi,et al. Games with Incomplete Information Played by "Bayesian" Players, I-III: Part I. The Basic Model& , 2004, Manag. Sci..
[22] Chandra Chekuri,et al. Dependent Randomized Rounding for Matroid Polytopes and Applications , 2009, 0909.4348.
[23] Rajiv Gandhi,et al. Dependent rounding and its applications to approximation algorithms , 2006, JACM.