Thwarting Adversaries with Unpredictability: Massive-scale Game-Theoretic Algorithms for Real-world Security Deployments
暂无分享,去创建一个
[1] Milind Tambe,et al. A unified method for handling discrete and continuous uncertainty in Bayesian Stackelberg games , 2012, AAMAS.
[2] Manish Jain,et al. Software Assistants for Randomized Patrol Planning for the LAX Airport Police and the Federal Air Marshal Service , 2010, Interfaces.
[3] Physics Department,et al. Adaptive Competition, Market Efficiency, Phase Transitions and Spin-Glasses , 1997 .
[4] Peter C. Cheeseman,et al. Where the Really Hard Problems Are , 1991, IJCAI.
[5] Hector J. Levesque,et al. Hard and Easy Distributions of SAT Problems , 1992, AAAI.
[6] M. L. Fisher,et al. An analysis of approximations for maximizing submodular set functions—I , 1978, Math. Program..
[7] Micah Adler,et al. Randomized Pursuit-Evasion in Graphs , 2002, Combinatorics, Probability and Computing.
[8] Francesco Amigoni,et al. A Game-Theoretic Approach to Determining Efficient Patrolling Strategies for Mobile Robots , 2008, 2008 IEEE/WIC/ACM International Conference on Web Intelligence and Intelligent Agent Technology.
[9] C. Drury,et al. Optimal Placement of Suicide Bomber Detectors , 2007 .
[10] Nicola Basilico,et al. Leader-follower strategies for robotic patrolling in environments with arbitrary topologies , 2009, AAMAS.
[11] H. Stackelberg,et al. Marktform und Gleichgewicht , 1935 .
[12] Bo An,et al. GUARDS and PROTECT: next generation applications of security games , 2011, SECO.
[13] John N. Tsitsiklis,et al. Introduction to linear optimization , 1997, Athena scientific optimization and computation series.
[14] Manish Jain,et al. Quality-bounded solutions for finite Bayesian Stackelberg games: scaling up , 2011, AAMAS.
[15] Vincent Conitzer,et al. A double oracle algorithm for zero-sum security games on graphs , 2011, AAMAS.
[16] Daphne Koller,et al. Multi-Agent Influence Diagrams for Representing and Solving Games , 2001, IJCAI.
[17] Sui Ruan,et al. Patrolling in a Stochastic Environment , 2005 .
[18] Kevin Leyton-Brown,et al. A Polynomial-Time Algorithm for Action Graph Games , 2006, AAAI.
[19] David Eppstein,et al. Studying (non-planar) road networks through an algorithmic lens , 2008, GIS '08.
[20] Manish Jain,et al. Security Games with Arbitrary Schedules: A Branch and Price Approach , 2010, AAAI.
[21] Martin W. P. Savelsbergh,et al. Branch-and-Price: Column Generation for Solving Huge Integer Programs , 1998, Oper. Res..
[22] Glen Price. Transportation Security Administration | U.S. Department of Homeland Security , 2002 .
[23] Ely Porat,et al. Path disruption games , 2010, AAMAS.
[24] Vincent Conitzer,et al. Learning and Approximating the Optimal Strategy to Commit To , 2009, SAGT.
[25] Branislav Bosanský,et al. Iterative game-theoretic route selection for hostile area transit and patrolling , 2011, AAMAS.
[26] Sarit Kraus,et al. A graph-theoretic approach to protect static and moving targets from adversaries , 2010, AAMAS.
[27] Milind Tambe,et al. GUARDS: game theoretic security allocation on a national scale , 2011, AAMAS.
[28] V. Bier,et al. SECRECY AND DECEPTION AT EQUILIBRIUM, WITH APPLICATIONS TO ANTI‐TERRORISM RESOURCE ALLOCATION , 2011 .
[29] Li Lin,et al. Passenger grouping under constant threat probability in an airport security system , 2006, Eur. J. Oper. Res..
[30] Gerald G. Brown,et al. A Two-Sided Optimization for Theater Ballistic Missile Defense , 2005, Oper. Res..
[31] Mikel Buesa,et al. The Economic Cost of March 11: Measuring the Direct Economic Cost of the Terrorist Attack on March 11, 2004 in Madrid , 2007 .
[32] Vincent Conitzer,et al. Computing the optimal strategy to commit to , 2006, EC '06.
[33] Ariel Rubinstein,et al. A Course in Game Theory , 1995 .
[34] Manish Jain,et al. Risk-Averse Strategies for Security Games with Execution and Observational Uncertainty , 2011, AAAI.
[35] E. Friedgut,et al. Sharp thresholds of graph properties, and the -sat problem , 1999 .
[36] Milind Tambe,et al. The Deployment-to-Saturation Ratio in Security Games , 2012, AAAI.
[37] Toby Walsh,et al. Phase Transitions from Real Computational Problems , 1995 .
[38] P. Hudson. Search Games , 1982 .
[39] Manish Jain,et al. Computing optimal randomized resource allocations for massive security games , 2009, AAMAS 2009.
[40] Patrick Weber,et al. OpenStreetMap: User-Generated Street Maps , 2008, IEEE Pervasive Computing.
[41] Christopher Archibald,et al. Modeling billiards games , 2009, AAMAS.
[42] Gerald G. Brown,et al. Defending Critical Infrastructure , 2006, Interfaces.
[43] M. M. Flood. THE HIDE AND SEEK GAME OF VON NEUMANN , 1972 .
[44] Richard Mesic,et al. Implementing Security Improvement Options at Los Angeles International Airport , 2006 .
[45] Rong Yang,et al. Improved computational models of human behavior in security games , 2011, AAMAS.
[46] R. A. Leibler,et al. On Information and Sufficiency , 1951 .
[47] Yevgeniy Vorobeychik,et al. Computing Randomized Security Strategies in Networked Domains , 2011, Applied Adversarial Reasoning and Risk Modeling.
[48] V. Georgiev. Using Game Theory to Analyze Wireless Ad Hoc Networks . ” , 2008 .
[49] Sarit Kraus,et al. The impact of adversarial knowledge on adversarial planning in perimeter patrol , 2008, AAMAS.
[50] Milind Tambe,et al. Approximation methods for infinite Bayesian Stackelberg games: modeling distributional payoff uncertainty , 2011, AAMAS.
[51] Makoto Yokoo,et al. DCOPs meet the realworld: exploring unknown reward matrices with applications to mobile sensor networks , 2009, IJCAI 2009.
[52] Michael P. Wellman,et al. Approximate Strategic Reasoning through Hierarchical Reduction of Large Symmetric Games , 2005, AAAI.
[53] Milind Tambe,et al. Urban security: game-theoretic resource allocation in networked physical domains , 2010, AAAI 2010.
[54] Alan Washburn,et al. Two-Person Zero-Sum Games for Network Interdiction , 1995, Oper. Res..
[55] RICHARD C. LARSON,et al. A hypercube queuing model for facility location and redistricting in urban emergency services , 1974, Comput. Oper. Res..
[56] R. Selten,et al. A Generalized Nash Solution for Two-Person Bargaining Games with Incomplete Information , 1972 .
[57] Lawrence M. Wein,et al. OR Forum - Homeland Security: From Mathematical Models to Policy Implementation: The 2008 Philip McCord Morse Lecture , 2009, Oper. Res..
[58] Milind Tambe,et al. Security and Game Theory - Algorithms, Deployed Systems, Lessons Learned , 2011 .
[59] Vincent Conitzer,et al. Complexity of Computing Optimal Stackelberg Strategies in Security Resource Allocation Games , 2010, AAAI.
[60] G. Leitmann. On generalized Stackelberg strategies , 1978 .
[61] S. Alpern. Infiltration games on arbitrary graphs , 1992 .
[62] S Kirkpatrick,et al. Critical Behavior in the Satisfiability of Random Boolean Expressions , 1994, Science.
[63] Jeremy Frank,et al. Asymptotic and Finite Size Parameters for Phase Transitions: Hamiltonian Circuit as a Case Study , 1998, Inf. Process. Lett..
[64] Branislav Bosanský,et al. Computing time-dependent policies for patrolling games with mobile targets , 2011, AAMAS.
[65] Toby Walsh,et al. The TSP Phase Transition , 1996, Artif. Intell..
[66] Kevin Chlebik. Terrorism and Game Theory: From the Terrorists’ Point of View , 2010 .
[67] C. Hauert,et al. Game theory and physics , 2005 .
[68] William H. Ruckle,et al. Ambushing Random Walks I: Finite Models , 1976, Oper. Res..
[69] Vincent Conitzer,et al. Multi-Step Multi-Sensor Hider-Seeker Games , 2009, IJCAI.
[70] Vincent Conitzer,et al. Stackelberg vs. Nash in security games: interchangeability, equivalence, and uniqueness , 2010, AAMAS 2010.
[71] R. Looney. Economic Costs to the United States Stemming From the 9-11 Attacks; Strategic Insights: v.1, issue 6 (August 2002) , 2002 .
[72] Jeannette M. Wing,et al. Game strategies in network security , 2005, International Journal of Information Security.
[73] A. Haurie,et al. Sequential Stackelberg equilibria in two-person games , 1985 .
[74] Makoto Yokoo,et al. When should there be a "Me" in "Team"?: distributed multi-agent optimization under uncertainty , 2010, AAMAS.
[75] Avrim Blum,et al. Planning in the Presence of Cost Functions Controlled by an Adversary , 2003, ICML.
[76] Nicola Gatti,et al. Game Theoretical Insights in Strategic Patrolling: Model and Algorithm in Normal-Form , 2008, ECAI.
[77] Milind Tambe,et al. Effective solutions for real-world Stackelberg games: when agents must deal with human uncertainties , 2009, AAMAS 2009.
[78] T. Başar,et al. Dynamic Noncooperative Game Theory , 1982 .
[79] Sarit Kraus,et al. Deployed ARMOR protection: the application of a game theoretic model for security at the Los Angeles International Airport , 2008, AAMAS 2008.
[80] Johannes O. Royset,et al. On the Complexity of Delaying an Adversary’s Project , 2005 .
[81] Sarit Kraus,et al. Security in multiagent systems by policy randomization , 2006, AAMAS '06.
[82] Bo An,et al. PROTECT: An Application of Computational Game Theory for the Security of the Ports of the United States , 2012, AAAI.
[83] Sarit Kraus,et al. Robust solutions to Stackelberg games: Addressing bounded rationality and limited observations in human cognition , 2010, Artif. Intell..
[84] Milind Tambe,et al. TRUSTS: Scheduling Randomized Patrols for Fare Inspection in Transit Systems , 2012, IAAI.
[85] Moshe Tennenholtz,et al. Mechanism Design with Execution Uncertainty , 2002, UAI.
[86] Vincent Conitzer,et al. Security scheduling for real-world networks , 2013, AAMAS.
[87] Sarit Kraus,et al. Playing games for security: an efficient exact algorithm for solving Bayesian Stackelberg games , 2008, AAMAS.
[88] E.E.C. van Damme,et al. Games with imperfectly observable commitment , 1997 .
[89] B. Stengel,et al. Leadership with commitment to mixed strategies , 2004 .