{"type":"ScholarlyArticle","title":"Optimal Escape Interdiction on Transportation Networks","authors":[{"name":"Youzhi Zhang","slug":"youzhi-zhang","given":"Youzhi","family":"Zhang","affiliation":"School of Computer Science and Engineering , Nanyang Technological University , Singapore"},{"name":"Bo An","slug":"bo-an","given":"Bo","family":"An","affiliation":"School of Computer Science and Engineering , Nanyang Technological University , Singapore"},{"name":"Long Tran-Thanh","slug":"long-tran-thanh","given":"Long","family":"Tran-Thanh","affiliation":"Department of Electronics and Computer Science , University of Southampton , UK"},{"name":"Zhen Wang","slug":"zhen-wang","given":"Zhen","family":"Wang","affiliation":"School of Cyberspace , Hangzhou Dianzi University , China"},{"name":"Jiarui Gan","slug":"jiarui-gan","given":"Jiarui","family":"Gan","affiliation":"Department of Computer Science , University of Oxford , UK"},{"name":"Nicholas R. Jennings","slug":"nicholas-r-jennings","given":"Nicholas R.","family":"Jennings","affiliation":"Departments of Computing and Electrical and Electronic Engineering , Imperial College , UK"}],"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.","doi":"10.24963/ijcai.2017/550","url":"https://ijcai.org/proceedings/2017/550","pdf":"https://ijcai.org/proceedings/2017/0550.pdf","markdown":"https://ijcai.org/proceedings/2017/550.md","bibtex":"https://ijcai.org/proceedings/2017/bibtex/550","volume":{"slug":"2017","title":"Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence","short_title":"IJCAI 2017","url":"https://ijcai.org/proceedings/2017/","year":2017,"location":"Melbourne, Australia","dates":"19-25 August 2017","editors":"Carles Sierra","isbn":"978-0-9992411-0-3","publisher":"International Joint Conferences on Artificial Intelligence Organization","doi_prefix":"10.24963/ijcai.2017"},"section":"Multidisciplinary Topics and Applications","track":"Main track","number":550,"pages":{"first":3936,"last":3944},"keywords":["Multidisciplinary Topics and Applications: AI&Security and Privacy","Multidisciplinary Topics and Applications: Multidisciplinary Topics and Applications"],"videos":[],"references":[{"position":1,"raw":"[Aboudolas et al., 2009] Konstantinos Aboudolas, Markos Papageorgiou, and Elias B. Kosmatopoulos. Store-and- forward based methods for the signal control problem in large-scale congested urban road networks. Transporta- tion Research Part C: Emerging Technologies, 17(2):163 -174, 2009.","title":"Kosmatopoulos. Store-andforward based methods for the signal control problem in large-scale congested urban road networks","authors":"Konstantinos Aboudolas, Markos Papageorgiou, Elias B","year":"2009","venue":"Transportation Research Part C: Emerging Technologies","doi":null,"url":null,"internal_url":null},{"position":2,"raw":"[Adler et al., 2002] Micah Adler, Harald Räcke, Naveen Sivadasan, Christian Sohler, and Berthold Vöcking. Ran- domized pursuit-evasion in graphs. In ICALP, pages 901- 912, 2002.","title":"Randomized pursuit-evasion in graphs","authors":"Adler","year":"2002","venue":"ICALP","doi":null,"url":null,"internal_url":null},{"position":3,"raw":"[Basilico et al., 2009] Nicola Basilico, Nicola Gatti, and Francesco Amigoni. Leader-follower strategies for robot- ic patrolling in environments with arbitrary topologies. In AAMAS, pages 57-64, 2009.","title":"Leader-follower strategies for robotic patrolling in environments with arbitrary topologies","authors":"Nicola Basilico, Nicola Gatti, Francesco Amigoni","year":"2009","venue":"AAMAS","doi":null,"url":null,"internal_url":null},{"position":4,"raw":"[Blum et al., 2014] Avrim Blum, Nika Haghtalab, and Ariel D Procaccia. Learning optimal commitment to over- come insecurity. In NIPS, pages 1826-1834, 2014.","title":"Learning optimal commitment to overcome insecurity","authors":"Avrim Blum, Nika Haghtalab, Ariel D Procaccia","year":"2014","venue":"NIPS","doi":null,"url":null,"internal_url":null},{"position":5,"raw":"[Coogan and Arcak, 2015] S. Coogan and M. Arcak. A com- partmental model for traffic networks and its dynami- cal behavior. IEEE Transactions on Automatic Control, 60(10):2698-2703, 2015.","title":"A compartmental model for traffic networks and its dynamical behavior","authors":"S Coogan, M Arcak","year":"2015","venue":"IEEE Transactions on Automatic Control","doi":null,"url":null,"internal_url":null},{"position":6,"raw":"[Daganzo, 1994] Carlos F. Daganzo. The cell transmission model: A dynamic representation of highway traffic con- sistent with the hydrodynamic theory. Transportation Re- search Part B: Methodological, 28(4):269 -287, 1994.","title":"The cell transmission model: A dynamic representation of highway traffic consistent with the hydrodynamic theory","authors":"Carlos F Daganzo","year":"1994","venue":"Transportation Research Part B: Methodological","doi":null,"url":null,"internal_url":null},{"position":7,"raw":"[Daganzo, 1995] Carlos F. Daganzo. The cell transmission model, part II: Network traffic. Transportation Research Part B: Methodological, 29(2):79 -93, 1995.","title":"The cell transmission model, part II: Network traffic","authors":"Carlos F Daganzo","year":"1995","venue":"Transportation Research Part B: Methodological","doi":null,"url":null,"internal_url":null},{"position":8,"raw":"[Fang et al., 2016] Fei Fang, Thanh Hong Nguyen, Rob Pickles, Wai Y Lam, Gopalasamy R Clements, Bo An, Amandeep Singh, Milind Tambe, and Andrew Lemieux. Deploying PAWS: Field optimization of the protection as- sistant for wildlife security. In IAAI, pages 3966-3973, 2016.","title":"Deploying PAWS: Field optimization of the protection assistant for wildlife security","authors":"Fei Fang, Thanh Hong Nguyen, Rob Pickles, Wai Y Lam, Gopalasamy R Clements, Bo An, Amandeep Singh, Milind Tambe, Andrew Lemieux","year":"2016","venue":"IAAI","doi":null,"url":null,"internal_url":null},{"position":9,"raw":"[Guo et al., 2016] Qingyu Guo, Bo An, Yair Zick, and Chun- yan Miao. Optimal interdiction of illegal network flow. In IJCAI, pages 2507-2513, 2016.","title":"Optimal interdiction of illegal network flow","authors":"Qingyu Guo, Bo An, Yair Zick, Chunyan Miao","year":"2016","venue":"IJCAI","doi":null,"url":null,"internal_url":"/proceedings/2016/357"},{"position":10,"raw":"[Iwashita et al., 2016] Hiroaki Iwashita, Kotaro Ohori, Hi- rokazu Anai, and Atsushi Iwasaki. Simplifying urban net- work security games with cut-based graph contraction. In AAMAS, pages 205-213, 2016.","title":"Simplifying urban network security games with cut-based graph contraction","authors":"Hiroaki Iwashita, Kotaro Ohori, Hirokazu Anai, Atsushi Iwasaki","year":"2016","venue":"AAMAS","doi":null,"url":null,"internal_url":null},{"position":11,"raw":"[Jain et al., 2011] Manish Jain, Dmytro Korzhyk, Ondřej Vaněk, Vincent Conitzer, Michal Pěchouček, and Milind Tambe. A double oracle algorithm for zero-sum security games on graphs. In AAMAS, pages 327-334, 2011.","title":"A double oracle algorithm for zero-sum security games on graphs","authors":"Manish Jain, Dmytro Korzhyk, Ondřej Vaněk, Vincent Conitzer, Michal Pěchouček, Milind Tambe","year":"2011","venue":"AAMAS","doi":null,"url":null,"internal_url":null},{"position":12,"raw":"[Jain et al., 2012] Manish Jain, Kevin Leyton-Brown, and Milind Tambe. The deployment-to-saturation ratio in se- curity games. In AAAI, pages 1362-1370, 2012.","title":"The deployment-to-saturation ratio in security games","authors":"Manish Jain, Kevin Leyton-Brown, Milind Tambe","year":"2012","venue":"AAAI","doi":null,"url":null,"internal_url":null},{"position":13,"raw":"[Jain et al., 2013] Manish Jain, Vincent Conitzer, and Milind Tambe. Security scheduling for real-world networks. In AAMAS, pages 215-222, 2013.","title":"Security scheduling for real-world networks","authors":"Manish Jain, Vincent Conitzer, Milind Tambe","year":"2013","venue":"AAMAS","doi":null,"url":null,"internal_url":null},{"position":14,"raw":"[Lebacque, 2005] Jean-Patrick Lebacque. Intersection mod- eling, application to macroscopic network traffic flow models and traffic management. In Traffic and Granular Flow'03, pages 261-278. 2005.","title":"Intersection modeling, application to macroscopic network traffic flow models and traffic management","authors":"Jean-Patrick Lebacque","year":"2005","venue":"Traffic and Granular Flow'03","doi":null,"url":null,"internal_url":null},{"position":15,"raw":"[Letchford and Conitzer, 2013] Joshua Letchford and Vin- cent Conitzer. Solving security games on graphs via marginal probabilities. In AAAI, pages 591-597, 2013.","title":"Joshua Letchford and Vincent Conitzer. Solving security games on graphs via marginal probabilities","authors":"Conitzer Letchford","year":"2013","venue":"AAAI","doi":null,"url":null,"internal_url":null},{"position":16,"raw":"[Manual, 1964] Traffic Assignment Manual. Bureau of pub- lic roads. US Department of Commerce, 1964.","title":"Traffic Assignment Manual","authors":null,"year":"1964","venue":null,"doi":null,"url":null,"internal_url":null},{"position":17,"raw":"[Nowakowski and Winkler, 1983] Richard Nowakowski and Peter Winkler. Vertex-to-vertex pursuit in a graph. Dis- crete Mathematics, 43(2):235 -239, 1983.","title":"Vertex-to-vertex pursuit in a graph","authors":"Winkler Nowakowski, Richard Nowakowski, Peter Winkler","year":"1983","venue":"Discrete Mathematics","doi":null,"url":null,"internal_url":null},{"position":18,"raw":"[Peng et al., 2014] Wei Peng, Guohua Dong, Kun Yang, and Jinshu Su. A random road network model and its effect- s on topological characteristics of mobile delay-tolerant networks. IEEE Transactions on Mobile Computing, 13(12):2706-2718, 2014.","title":"A random road network model and its effects on topological characteristics of mobile delay-tolerant networks","authors":"Wei Peng, Guohua Dong, Kun Yang, Jinshu Su","year":"2014","venue":"IEEE Transactions on Mobile Computing","doi":null,"url":null,"internal_url":null},{"position":19,"raw":"[Shieh et al., 2012] Eric Shieh, Bo An, Rong Yang, Milind Tambe, Ben Maule, and Garrett Meyer. PROTECT: An application of computational game theory for the security of the ports of the United States. In AAAI, pages 2173- 2179, 2012.","title":"PROTECT: An application of computational game theory for the security of the ports of the United States","authors":"Eric Shieh, Bo An, Rong Yang, Milind Tambe, Ben Maule, Garrett Meyer","year":"2012","venue":"AAAI","doi":null,"url":null,"internal_url":null},{"position":20,"raw":"[Skabardonis and Dowling, 1997] Alexander Skabardonis and Richard Dowling. Improved speed-flow relationships for planning applications. Transportation Research Record: Journal of the Transportation Research Board, 1572:18-23, 1997.","title":"Improved speed-flow relationships for planning applications","authors":"Alexander Skabardonis, Richard Dowling","year":"1997","venue":"Transportation Research Record: Journal of the Transportation Research Board","doi":null,"url":null,"internal_url":null},{"position":21,"raw":"[Tambe, 2011] Milind Tambe. Security and Game Theory: Algorithms, Deployed Systems, Lessons Learned. Cam- bridge University Press, 2011.","title":"Security and Game Theory: Algorithms, Deployed Systems, Lessons Learned","authors":"Milind Tambe","year":"2011","venue":null,"doi":null,"url":null,"internal_url":null},{"position":22,"raw":"[Tsai et al., 2010] Jason Tsai, Zhengyu Yin, Jun-young K- wak, David Kempe, Christopher Kiekintveld, and Milind Tambe. Urban security: Game-theoretic resource alloca- tion in networked physical domains. In AAAI, pages 881- 886, 2010.","title":"Urban security: Game-theoretic resource allocation in networked physical domains","authors":"Jason Tsai, Zhengyu Yin, Jun-Young Kwak, David Kempe, Christopher Kiekintveld, Milind Tambe","year":"2010","venue":"AAAI","doi":null,"url":null,"internal_url":null},{"position":23,"raw":"[Vorobeychik et al., 2014] Yevgeniy Vorobeychik, Bo An, Milind Tambe, and Satinder P. Singh. Computing solu- tions in infinite-horizon discounted adversarial patrolling games. In ICAPS, pages 314-322, 2014.","title":"Computing solutions in infinite-horizon discounted adversarial patrolling games","authors":"Yevgeniy Vorobeychik, Bo An, Milind Tambe, Satinder P Singh","year":"2014","venue":"ICAPS","doi":null,"url":null,"internal_url":null},{"position":24,"raw":"[Wang et al., 2016] Zhen Wang, Yue Yin, and Bo An. Com- puting optimal monitoring strategy for detecting terrorist plots. In AAAI, pages 637-643, 2016.","title":"Computing optimal monitoring strategy for detecting terrorist plots","authors":"Zhen Wang, Yue Yin, Bo An","year":"2016","venue":"AAAI","doi":null,"url":null,"internal_url":null},{"position":25,"raw":"[Washburn and Wood, 1995] Alan Washburn and Kevin Wood. Two-person zero-sum games for network interdic- tion. Operations Research, 43(2):243-251, 1995.","title":"Two-person zero-sum games for network interdiction","authors":"Wood ; Washburn, Alan Washburn, Kevin Wood","year":"1995","venue":"Operations Research","doi":null,"url":null,"internal_url":null},{"position":26,"raw":"[Yin et al., 2014] Yue Yin, Bo An, and Manish Jain. Game- theoretic resource allocation for protecting large public events. In AAAI, pages 826-834, 2014.","title":"Gametheoretic resource allocation for protecting large public events","authors":"Bo Yue Yin, Manish An, Jain","year":"2014","venue":"AAAI","doi":null,"url":null,"internal_url":null},{"position":27,"raw":"[Yin et al., 2015] Yue Yin, Haifeng Xu, Jiarui Gan, Bo An, and Albert Xin Jiang. Computing optimal mixed strategies for security games with dynamic payoffs. In IJCAI, pages 681-687, 2015.","title":"Computing optimal mixed strategies for security games with dynamic payoffs","authors":"Haifeng Yue Yin, Jiarui Xu, Bo Gan, Albert Xin An, Jiang","year":"2015","venue":"IJCAI","doi":null,"url":null,"internal_url":"/proceedings/2015/102"},{"position":28,"raw":"[Zhao et al., 2016] Mengchen Zhao, Bo An, and Christo- pher Kiekintveld. Optimizing personalized email filtering thresholds to mitigate sequential spear phishing attacks. In AAAI, pages 658-665, 2016.","title":"Optimizing personalized email filtering thresholds to mitigate sequential spear phishing attacks","authors":"Zhao","year":"2016","venue":"AAAI","doi":null,"url":null,"internal_url":null}],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}