论文信息 - How to protect a city: strategic security placement in graph-based domains - 字舞流文

How to protect a city: strategic security placement in graph-based domains

We apply game-theoretic techniques to urban security deployment and propose new algorithms to efficiently solve real-world domains that are intractable with existing algorithms.

Milind Tambe | Christopher Kiekintveld | David Kempe | Jun-young Kwak | Zhengyu Yin | Jason Tsai

[1] Manish Jain,et al. Computing optimal randomized resource allocations for massive security games , 2009, AAMAS 2009.

[2] Sarit Kraus,et al. Playing games for security: an efficient exact algorithm for solving Bayesian Stackelberg games , 2008, AAMAS.

[3] 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.

[4] Vincent Conitzer,et al. Multi-Step Multi-Sensor Hider-Seeker Games , 2009, IJCAI.

[5] R. Kevin Wood,et al. Shortest‐path network interdiction , 2002, Networks.

[6] Alan Washburn,et al. Two-Person Zero-Sum Games for Network Interdiction , 1995, Oper. Res..

[7] Nicola Basilico,et al. Leader-follower strategies for robotic patrolling in environments with arbitrary topologies , 2009, AAMAS.

[8] Paul G. Spirakis,et al. A Network Game with Attackers and a Defender , 2008, Algorithmica.

[9] Nicola Gatti,et al. Game Theoretical Insights in Strategic Patrolling: Model and Algorithm in Normal-Form , 2008, ECAI.

[10] Vincent Conitzer,et al. Computing the optimal strategy to commit to , 2006, EC '06.

[11] Milind Tambe,et al. Security and Game Theory: IRIS – A Tool for Strategic Security Allocation in Transportation Networks , 2011, AAMAS 2011.

[12] David P. Morton,et al. Stochastic Network Interdiction , 1998, Oper. Res..