Studying (non-planar) road networks through an algorithmic lens
Proceedings of the 16th ACM SIGSPATIAL international conference on Advances in geographic information systems
OpenStreetMap: User-Generated Street Maps
IEEE Pervasive Computing
Multi-step multi-sensor hider-seeker games
IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence
Stackelberg vs. Nash in security games: interchangeability, equivalence, and uniqueness
Proceedings of the 9th International Conference on Autonomous Agents and Multiagent Systems: volume 1 - Volume 1
A double oracle algorithm for zero-sum security games on graphs
The 10th International Conference on Autonomous Agents and Multiagent Systems - Volume 1
PROTECT: a deployed game theoretic system to protect the ports of the United States
Proceedings of the 11th International Conference on Autonomous Agents and Multiagent Systems - Volume 1
Solving non-zero sum multiagent network flow security games with attack costs
Proceedings of the 11th International Conference on Autonomous Agents and Multiagent Systems - Volume 2
Game-theoretic resource allocation for malicious packet detection in computer networks
Proceedings of the 11th International Conference on Autonomous Agents and Multiagent Systems - Volume 2
Designing better strategies against human adversaries in network security games
Proceedings of the 11th International Conference on Autonomous Agents and Multiagent Systems - Volume 3
Planning and learning in security games
ACM SIGecom Exchanges
Hi-index | 0.00 |
Network based security games, where a defender strategically places security measures on the edges of a graph to protect against an adversary, who chooses a path through a graph is an important research problem with potential for real-world impact. For example, police forces face the problem of placing checkpoints on roads to inspect vehicular traffic in their day-to-day operations, a security measure the Mumbai police have performed since the terrorist attacks in 2008. Algorithms for solving such network-based security problems have been proposed in the literature, but none of them scale up to solving problems of the size of real-world networks. In this paper, we present Snares, a novel algorithm that computes optimal solutions for both the defender and the attacker in such network security problems. Based on a double-oracle framework, Snares makes novel use of two approaches: warm starts and greedy responses. It makes the following contributions: (1) It defines and uses mincut-fanout, a novel method for efficient warm-starting of the computation; (2) It exploits the sub-modularity property of the defender optimization in a greedy heuristic, which is used to generate "better-responses"; Snares} also uses a better-response computation for the attacker. Furthermore, we evaluate the performance of Snares in real-world networks illustrating a significant advance: whereas state-of-the-art algorithms could handle just the southern tip of Mumbai, {\sc Snares} can compute optimal strategy for the entire urban road network of Mumbai.