{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,13]],"date-time":"2026-04-13T16:32:56Z","timestamp":1776097976963,"version":"3.50.1"},"publisher-location":"Cham","reference-count":17,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319687100","type":"print"},{"value":"9783319687117","type":"electronic"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017]]},"DOI":"10.1007\/978-3-319-68711-7_3","type":"book-chapter","created":{"date-parts":[[2017,10,4]],"date-time":"2017-10-04T04:23:40Z","timestamp":1507091020000},"page":"40-52","source":"Crossref","is-referenced-by-count":3,"title":["Adaptivity in Network Interdiction"],"prefix":"10.1007","author":[{"given":"Basti\u00e1n","family":"Bahamondes","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jos\u00e9","family":"Correa","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jannik","family":"Matuschke","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gianpaolo","family":"Oriolo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,10,4]]},"reference":[{"key":"3_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-642-40450-4_1","volume-title":"Algorithms \u2013 ESA 2013","author":"D Adjiashvili","year":"2013","unstructured":"Adjiashvili, D., Oriolo, G., Senatore, M.: The online replacement path problem. In: Bodlaender, H.L., Italiano, G.F. (eds.) ESA 2013. LNCS, vol. 8125, pp. 1\u201312. Springer, Heidelberg (2013). doi:\n10.1007\/978-3-642-40450-4_1"},{"key":"3_CR2","series-title":"Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering","doi-asserted-by":"publisher","first-page":"224","DOI":"10.1007\/978-3-642-35582-0_17","volume-title":"Game Theory for Networks","author":"R Bornd\u00f6rfer","year":"2012","unstructured":"Bornd\u00f6rfer, R., Omont, B., Sagnol, G., Swarat, E.: A Stackelberg game to optimize the distribution of controls in transportation networks. In: Krishnamurthy, V., Zhao, Q., Huang, M., Wen, Y. (eds.) GameNets 2012. LNICSSITE, vol. 105, pp. 224\u2013235. Springer, Heidelberg (2012). doi:\n10.1007\/978-3-642-35582-0_17"},{"issue":"4","key":"3_CR3","doi-asserted-by":"crossref","first-page":"345","DOI":"10.1287\/trsc.35.4.345.10433","volume":"35","author":"L Brotcorne","year":"2001","unstructured":"Brotcorne, L., Labb\u00e9, M., Marcotte, P., Savard, G.: A bilevel model for toll optimization on a multicommodity transportation network. Transp. Sci. 35(4), 345\u2013358 (2001)","journal-title":"Transp. Sci."},{"key":"3_CR4","unstructured":"Carstensen, P.J.: The complexity of some problems in parametric linear and combinatorial programming (1983)"},{"issue":"1","key":"3_CR5","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1287\/opre.2016.1560","volume":"65","author":"JR Correa","year":"2017","unstructured":"Correa, J.R., Harks, T., Kreuzen, V.J.C., Matuschke, J.: Fare evasion in transit networks. Oper. Res. 65(1), 165\u2013183 (2017)","journal-title":"Oper. Res."},{"key":"3_CR6","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"MR Garey","year":"2002","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman, New York (2002)"},{"key":"3_CR7","series-title":"Algorithms and Combinatorics","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-97881-4","volume-title":"Geometric Algorithms and Combinatorial Optimization","author":"M Gr\u00f6tschel","year":"1988","unstructured":"Gr\u00f6tschel, M., Lov\u00e1sz, L., Schrijver, A.: Geometric Algorithms and Combinatorial Optimization. Algorithms and Combinatorics, vol. 2. Springer, Heidelberg (1988)"},{"issue":"1","key":"3_CR8","doi-asserted-by":"crossref","first-page":"36","DOI":"10.1287\/moor.17.1.36","volume":"17","author":"R Hassin","year":"1992","unstructured":"Hassin, R.: Approximation schemes for the restricted shortest path problem. Math. Oper. Res. 17(1), 36\u201342 (1992)","journal-title":"Math. Oper. Res."},{"issue":"2","key":"3_CR9","first-page":"117","volume":"57","author":"G Joret","year":"2011","unstructured":"Joret, G.: Stackelberg network pricing is hard to approximate. Networks 57(2), 117\u2013120 (2011)","journal-title":"Networks"},{"issue":"5","key":"3_CR10","doi-asserted-by":"crossref","first-page":"213","DOI":"10.1016\/S0167-6377(01)00069-4","volume":"28","author":"DH Lorenz","year":"2001","unstructured":"Lorenz, D.H., Raz, D.: A simple efficient approximation scheme for the restricted shortest path problem. Oper. Res. Lett. 28(5), 213\u2013219 (2001)","journal-title":"Oper. Res. Lett."},{"issue":"1","key":"3_CR11","doi-asserted-by":"crossref","first-page":"98","DOI":"10.1016\/j.vaccine.2009.09.109","volume":"28","author":"P Manfredi","year":"2009","unstructured":"Manfredi, P., Posta, P.D., d\u2019Onofrio, A., Salinelli, E., Centrone, F., Meo, C., Poletti, P.: Optimal vaccination choice, vaccination games, and rational exemption: an appraisal. Vaccine 28(1), 98\u2013109 (2009)","journal-title":"Vaccine"},{"key":"3_CR12","unstructured":"Nikolova, E.V.: Strategic algorithms. Ph.D. thesis, Massachusetts Institute of Technology (2009)"},{"key":"3_CR13","unstructured":"Panda, S., Vorobeychik, Y.: Stackelberg games for vaccine design. In: Proceedings of the 2015 International Conference on Autonomous Agents and Multiagent Systems, pp. 1391\u20131399. International Foundation for Autonomous Agents and Multiagent Systems (2015)"},{"issue":"1","key":"3_CR14","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1002\/net.20074","volume":"46","author":"S Roch","year":"2005","unstructured":"Roch, S., Savard, G., Marcotte, P.: An approximation algorithm for Stackelberg network pricing. Networks 46(1), 57\u201367 (2005)","journal-title":"Networks"},{"issue":"2","key":"3_CR15","doi-asserted-by":"crossref","first-page":"163","DOI":"10.1016\/j.disopt.2013.02.002","volume":"10","author":"AS Schulz","year":"2013","unstructured":"Schulz, A.S., Uhan, N.A.: Approximating the least core value and least core of cooperative games with supermodular costs. Discrete Optim. 10(2), 163\u2013180 (2013)","journal-title":"Discrete Optim."},{"key":"3_CR16","volume-title":"Security and Game Theory: Algorithms, Deployed Systems, Lessons Learned","author":"M Tambe","year":"2012","unstructured":"Tambe, M.: Security and Game Theory: Algorithms, Deployed Systems, Lessons Learned. Cambridge University Press, Cambridge (2012)"},{"issue":"2","key":"3_CR17","doi-asserted-by":"crossref","first-page":"243","DOI":"10.1287\/opre.43.2.243","volume":"43","author":"A Washburn","year":"1995","unstructured":"Washburn, A., Wood, K.: Two-person zero-sum games for network interdiction. Oper. Res. 43(2), 243\u2013251 (1995)","journal-title":"Oper. Res."}],"container-title":["Lecture Notes in Computer Science","Decision and Game Theory for Security"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-68711-7_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,10,4]],"date-time":"2017-10-04T04:24:46Z","timestamp":1507091086000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-68711-7_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319687100","9783319687117"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-68711-7_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017]]}}}