暂无分享,去创建一个
[1] Ariel D. Procaccia,et al. Learning Optimal Commitment to Overcome Insecurity , 2014, NIPS.
[2] Vincent Conitzer,et al. Solving Security Games on Graphs via Marginal Probabilities , 2013, AAAI.
[3] Nicolas Christin,et al. Audit Games , 2013, IJCAI.
[4] Kevin Waugh,et al. DeepStack: Expert-level artificial intelligence in heads-up no-limit poker , 2017, Science.
[5] Milind Tambe,et al. Security and Game Theory - Algorithms, Deployed Systems, Lessons Learned , 2011 .
[6] Vincent Conitzer,et al. Complexity of Computing Optimal Stackelberg Strategies in Security Resource Allocation Games , 2010, AAAI.
[7] Nicola Basilico,et al. Leader-follower strategies for robotic patrolling in environments with arbitrary topologies , 2009, AAMAS.
[8] Manish Jain,et al. Security Games with Arbitrary Schedules: A Branch and Price Approach , 2010, AAAI.
[9] Maxim Sviridenko,et al. Pipage Rounding: A New Method of Constructing Algorithms with Proven Performance Guarantee , 2004, J. Comb. Optim..
[10] Milind Tambe,et al. One Size Does Not Fit All: A Game-Theoretic Approach for Dynamically and Effectively Screening for Threats , 2016, AAAI.
[11] Prabhakar Raghavan,et al. Randomized rounding: A technique for provably good algorithms and algorithmic proofs , 1985, Comb..
[12] Milind Tambe,et al. Urban security: game-theoretic resource allocation in networked physical domains , 2010, AAAI 2010.
[13] Bo An,et al. Security Games with Protection Externalities , 2015, AAAI.
[14] Tuomas Sandholm,et al. Safe and Nested Subgame Solving for Imperfect-Information Games , 2017, NIPS.
[15] Paul R. Milgrom,et al. Designing Random Allocation Mechanisms: Theory and Applications , 2013 .
[16] Branislav Bosanský,et al. Combining Compact Representation and Incremental Generation in Large Games with Sequential Strategies , 2015, AAAI.
[17] Aravind Srinivasan,et al. Solving Packing Integer Programs via Randomized Rounding with Alterations , 2012, Theory Comput..
[18] Manish Jain,et al. Computing optimal randomized resource allocations for massive security games , 2009, AAMAS.
[19] Rajiv Gandhi,et al. Dependent rounding and its applications to approximation algorithms , 2006, JACM.
[20] Chandra Chekuri,et al. Dependent Randomized Rounding for Matroid Polytopes and Applications , 2009, 0909.4348.
[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] Nicholas R. Jennings,et al. Introducing alarms in adversarial patrolling games: extended abstract , 2013, AAMAS.
[23] Michael P. Wellman,et al. Gradient methods for stackelberg security games , 2016, UAI 2016.
[24] Haifeng Xu,et al. The Mysteries of Security Games: Equilibrium Computation Becomes Combinatorial Algorithm Design , 2016, EC.
[25] Bo An,et al. Coalitional Security Games , 2016, AAMAS.
[26] Giorgio Gambosi,et al. Complexity and approximation: combinatorial optimization problems and their approximability properties , 1999 .
[27] Milind Tambe,et al. Defender (Mis)coordination in Security Games , 2013, IJCAI.