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

Authors:
Jason Tsai;Zhengyu Yin;Jun-young Kwak;David Kempe;Christopher Kiekintveld;Milind Tambe
Affiliations:
University of Southern California, Los Angeles, CA;University of Southern California, Los Angeles, CA;University of Southern California, Los Angeles, CA;University of Southern California, Los Angeles, CA;University of Southern California, Los Angeles, CA;University of Southern California, Los Angeles, CA
Venue:
Proceedings of the 9th International Conference on Autonomous Agents and Multiagent Systems: volume 1 - Volume 1
Year:
2010

Citing 8
Cited 1

Stochastic Network Interdiction

Operations Research
Computing the optimal strategy to commit to

EC '06 Proceedings of the 7th ACM conference on Electronic commerce
A Network Game with Attackers and a Defender

Algorithmica
Playing games for security: an efficient exact algorithm for solving Bayesian Stackelberg games

Proceedings of the 7th international joint conference on Autonomous agents and multiagent systems - Volume 2
Leader-follower strategies for robotic patrolling in environments with arbitrary topologies

Proceedings of The 8th International Conference on Autonomous Agents and Multiagent Systems - Volume 1
Computing optimal randomized resource allocations for massive security games

Proceedings of The 8th International Conference on Autonomous Agents and Multiagent Systems - Volume 1
Game Theoretical Insights in Strategic Patrolling: Model and Algorithm in Normal-Form

Proceedings of the 2008 conference on ECAI 2008: 18th European Conference on Artificial Intelligence
Multi-step multi-sensor hider-seeker games

IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence

Patrolling security games: Definition and algorithms for solving large instances with single patroller and single intruder

Artificial Intelligence

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.