Name
Abstract | ||
|---|---|---|
Preventing crimes or terrorist attacks in urban areas is challenging. Law enforcement officers need to respond quickly to catch the attacker on his escape route, which is subject to time-dependent traffic conditions on transportation networks. The attacker can strategically choose his escape path and driving speed to avoid being captured. Existing work on security resource allocation has not considered such scenarios with time-dependent strategies for both players. Therefore, in this paper, we study the problem of efficiently scheduling security resources for interdicting the escaping attacker. We propose: 1) a new defender-attacker security game model for escape interdiction on transportation networks; and 2) an efficient double oracle algorithm to compute the optimal defender strategy, which combines mixed-integer linear programming formulations for best response problems and effective approximation algorithms for improving the scalability of the algorithms. Experimental evaluation shows that our approach significantly outperforms baselines in solution quality and scales up to realistic-sized transportation networks with hundreds of intersections. |
Year | DOI | Venue |
|---|---|---|
2017 | 10.24963/ijcai.2017/550 | IJCAI |
Field | DocType | Citations |
Approximation algorithm,Scheduling (computing),Computer security,Computer science,Best response,Oracle,Interdiction,Resource allocation,Linear programming,Artificial intelligence,Machine learning,Scalability | Conference | 2 |
PageRank | References | Authors |
0.39 | 8 | 6 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Youzhi Zhang | 1 | 4 | 3.79 |
| Bo An | 2 | 892 | 106.05 |
| Long Tran-Thanh | 3 | 309 | 37.69 |
| Zhen Wang | 4 | 13 | 2.71 |
| Jiarui Gan | 5 | 39 | 9.05 |
| Nicholas R. Jennings | 6 | 19348 | 1564.35 |