Abstraction Methods for Solving Graph-Based Security Games
暂无分享,去创建一个
Anjon Basak | Christopher Kiekintveld | Fei Fang | Thanh Hong Nguyen | Fei Fang | Christopher Kiekintveld | T. Nguyen | Anjon Basak
[1] Milind Tambe,et al. Addressing Scalability and Robustness in Security Games with Multiple Boundedly Rational Adversaries , 2014, GameSec.
[2] Georges Dionne,et al. Lottery Decisions and Probability Weighting Function , 2001 .
[3] Manish Jain,et al. Security applications: lessons of real-world deployment , 2009, SECO.
[4] A. Tversky,et al. Prospect theory: an analysis of decision under risk — Source link , 2007 .
[5] Tuomas Sandholm,et al. A Texas Hold'em poker player based on automated abstraction and real-time equilibrium computation , 2006, AAMAS '06.
[6] Milind Tambe,et al. Urban security: game-theoretic resource allocation in networked physical domains , 2010, AAAI 2010.
[7] Alan Washburn,et al. Two-Person Zero-Sum Games for Network Interdiction , 1995, Oper. Res..
[8] Vincent Conitzer,et al. Solving Zero-Sum Security Games in Discretized Spatio-Temporal Domains , 2014, AAAI.
[9] Troels Bjerre Lund,et al. A heads-up no-limit Texas Hold'em poker player: discretized betting models and automatically generated equilibrium-finding programs , 2008, AAMAS.
[10] Troels Bjerre Lund,et al. Potential-Aware Automated Abstraction of Sequential Games, and Holistic Equilibrium Analysis of Texas Hold'em Poker , 2007, AAAI.
[11] Nicole D. Sintov,et al. Human Adversaries in Opportunistic Crime Security Games: Evaluating Competing Bounded Rationality Models , 2015 .
[12] Alexander Schrijver,et al. Theory of linear and integer programming , 1986, Wiley-Interscience series in discrete mathematics and optimization.
[13] Noa Agmon,et al. Making the Most of Our Regrets: Regret-Based Solutions to Handle Payoff Uncertainty and Elicitation in Green Security Games , 2015, GameSec.
[14] Bo An,et al. PROTECT: a deployed game theoretic system to protect the ports of the United States , 2012, AAMAS.
[15] Gábor Lugosi,et al. Prediction, learning, and games , 2006 .
[16] Bo An,et al. Security Games with Limited Surveillance , 2012, AAAI.
[17] J. Ragle,et al. IUCN Red List of Threatened Species , 2010 .
[18] Bhaskar Krishnamachari,et al. Combinatorial Network Optimization With Unknown Variables: Multi-Armed Bandits With Linear Rewards and Individual Observations , 2010, IEEE/ACM Transactions on Networking.
[19] Milind Tambe,et al. Security and Game Theory: IRIS – A Tool for Strategic Security Allocation in Transportation Networks , 2011, AAMAS 2011.
[20] G. Leitmann. On generalized Stackelberg strategies , 1978 .
[21] Todd Sandler,et al. Counterterrorism , 2005 .
[22] Milind Tambe,et al. "A Game of Thrones": When Human Behavior Models Compete in Repeated Stackelberg Security Games , 2015, AAMAS.
[23] Milind Tambe,et al. Beware the Soothsayer: From Attack Prediction Accuracy to Predictive Reliability in Security Games , 2015, GameSec.
[24] Peter Sanders,et al. Exact Routing in Large Road Networks Using Contraction Hierarchies , 2012, Transp. Sci..
[25] Rong Yang,et al. Adaptive resource allocation for wildlife protection against illegal poachers , 2014, AAMAS.
[26] Sarit Kraus,et al. Playing games for security: an efficient exact algorithm for solving Bayesian Stackelberg games , 2008, AAMAS.
[27] Yevgeniy Vorobeychik,et al. Computing Stackelberg Equilibria in Discounted Stochastic Games , 2012, AAAI.
[28] Sabine Storandt,et al. Route Planning for Bicycles - Exact Constrained Shortest Paths Made Practical via Contraction Hierarchy , 2012, ICAPS.
[29] Neil Burch,et al. Heads-up limit hold’em poker is solved , 2015, Science.
[30] Sarit Kraus,et al. Robust solutions to Stackelberg games: Addressing bounded rationality and limited observations in human cognition , 2010, Artif. Intell..
[31] Tuomas Sandholm,et al. A Competitive Texas Hold'em Poker Player via Automated Abstraction and Real-Time Equilibrium Computation , 2006, AAAI.
[32] Milind Tambe,et al. TRUSTS: Scheduling Randomized Patrols for Fare Inspection in Transit Systems , 2012, IAAI.
[33] Michael H. Bowling,et al. Regret Minimization in Games with Incomplete Information , 2007, NIPS.
[34] Gergely Neu,et al. Importance Weighting Without Importance Weights: An Efficient Algorithm for Combinatorial Semi-Bandits , 2015, J. Mach. Learn. Res..
[35] Peter Sanders,et al. Contraction Hierarchies: Faster and Simpler Hierarchical Routing in Road Networks , 2008, WEA.
[36] Milind Tambe,et al. Approximation methods for infinite Bayesian Stackelberg games: modeling distributional payoff uncertainty , 2011, AAMAS.
[37] Milind Tambe,et al. Robust Protection of Fisheries with COmPASS , 2014, AAAI.
[38] Gergely Neu,et al. An Efficient Algorithm for Learning with Semi-bandit Feedback , 2013, ALT.
[39] Viliam Lisý,et al. Combining Online Learning and Equilibrium Computation in Security Games , 2015, GameSec.
[40] Jonathan Schaeffer,et al. Approximating Game-Theoretic Optimal Strategies for Full-scale Poker , 2003, IJCAI.
[41] M. Dufwenberg. Game theory. , 2011, Wiley interdisciplinary reviews. Cognitive science.
[42] Tuomas Sandholm,et al. Lossless abstraction of imperfect information games , 2007, JACM.
[43] C. Field,et al. The Distribution of the Larger Herbivores in the Queen Elizabeth National Park, Uganda , 1970 .
[44] Milind Tambe,et al. When Security Games Go Green: Designing Defender Strategies to Prevent Poaching and Illegal Fishing , 2015, IJCAI.
[45] B. Stengel,et al. Leadership with commitment to mixed strategies , 2004 .
[46] Oladele A. Ogunseitan,et al. in Transportation Science , 2009 .
[47] Benedikt Nordhoff,et al. Dijkstra’s Algorithm , 2013 .
[48] Steven Skiena,et al. Implementing discrete mathematics - combinatorics and graph theory with Mathematica , 1990 .
[49] Wtt Wtt. Tight Regret Bounds for Stochastic Combinatorial Semi-Bandits , 2015 .
[50] Richard Gonzalez,et al. On the Shape of the Probability Weighting Function , 1999, Cognitive Psychology.
[51] Santosh S. Vempala,et al. Efficient algorithms for online decision problems , 2005, J. Comput. Syst. Sci..
[52] Tuomas Sandholm,et al. Better automated abstraction techniques for imperfect information games, with application to Texas Hold'em poker , 2007, AAMAS '07.
[53] Milind Tambe,et al. Security and Game Theory - Algorithms, Deployed Systems, Lessons Learned , 2011 .
[54] Vincent Conitzer,et al. Complexity of Computing Optimal Stackelberg Strategies in Security Resource Allocation Games , 2010, AAAI.
[55] Tuomas Sandholm,et al. Hierarchical Abstraction, Distributed Equilibrium Computation, and Post-Processing, with Application to a Champion No-Limit Texas Hold'em Agent , 2015, AAAI Workshop: Computer Poker and Imperfect Information.
[56] Bo An,et al. Deploying PAWS: Field Optimization of the Protection Assistant for Wildlife Security , 2016, AAAI.
[57] Tuomas Sandholm,et al. Potential-Aware Imperfect-Recall Abstraction with Earth Mover's Distance in Imperfect-Information Games , 2014, AAAI.
[58] Nicolò Cesa-Bianchi,et al. Combinatorial Bandits , 2012, COLT.
[59] D. Prelec. The Probability Weighting Function , 1998 .
[60] Peter Sanders,et al. Time-Dependent Contraction Hierarchies and Approximation , 2010, SEA.
[61] Manish Jain,et al. Security Games with Arbitrary Schedules: A Branch and Price Approach , 2010, AAAI.
[62] H. Zank,et al. Separating curvature and elevation: A parametric probability weighting function , 2010 .
[63] A. Haurie,et al. Sequential Stackelberg equilibria in two-person games , 1985 .
[64] Ariel D. Procaccia,et al. Learning Optimal Commitment to Overcome Insecurity , 2014, NIPS.
[65] Maria-Florina Balcan,et al. Commitment Without Regrets: Online Learning in Stackelberg Security Games , 2015, EC.
[66] Rong Yang,et al. Scaling-up Security Games with Boundedly Rational Adversaries: A Cutting-plane Approach , 2013, IJCAI.
[67] Viliam Lisý,et al. Online Learning Methods for Border Patrol Resource Allocation , 2014, GameSec.
[68] Manish Jain,et al. Software Assistants for Randomized Patrol Planning for the LAX Airport Police and the Federal Air Marshal Service , 2010, Interfaces.
[69] Milind Tambe,et al. PAWS: Game Theory Based Protection Assistant for Wildlife Security , 2017 .
[70] D. McFadden. Quantal Choice Analysis: A Survey , 1976 .
[71] Sarit Kraus,et al. Deployed ARMOR protection: the application of a game theoretic model for security at the Los Angeles International Airport , 2008, AAMAS.
[72] Manish Jain,et al. Computing optimal randomized resource allocations for massive security games , 2009, AAMAS.
[73] Tuomas Sandholm,et al. Lossy stochastic game abstraction with bounds , 2012, EC '12.
[74] Vincent Conitzer,et al. Computing the optimal strategy to commit to , 2006, EC '06.
[75] Tuomas Sandholm,et al. Extensive-form game abstraction with bounds , 2014, EC.
[76] Moshe Tennenholtz,et al. Program equilibrium , 2004, Games Econ. Behav..
[77] Amos Azaria,et al. Analyzing the Effectiveness of Adversary Modeling in Security Games , 2013, AAAI.
[78] T. Sandler,et al. Terrorism & Game Theory , 2003 .