{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T18:08:18Z","timestamp":1725905298542},"publisher-location":"Cham","reference-count":5,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319557014"},{"type":"electronic","value":"9783319557021"}],"license":[{"start":{"date-parts":[[2017,7,21]],"date-time":"2017-07-21T00:00:00Z","timestamp":1500595200000},"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":[[2018]]},"DOI":"10.1007\/978-3-319-55702-1_30","type":"book-chapter","created":{"date-parts":[[2017,7,20]],"date-time":"2017-07-20T10:21:16Z","timestamp":1500546076000},"page":"217-223","source":"Crossref","is-referenced-by-count":0,"title":["Designing Inspector Rosters with Optimal Strategies"],"prefix":"10.1007","author":[{"given":"Stephan","family":"Schwartz","sequence":"first","affiliation":[]},{"given":"Thomas","family":"Schlechte","sequence":"additional","affiliation":[]},{"given":"Elmar","family":"Swarat","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,7,21]]},"reference":[{"key":"30_CR1","doi-asserted-by":"crossref","first-page":"312","DOI":"10.1002\/net.21596","volume":"65","author":"R Bornd\u00f6rfer","year":"2015","unstructured":"Bornd\u00f6rfer, R., Buwaya, J., Sagnol, G., Swarat, E.: Network spot-checking games: theory and application to toll enforcing in transportation networks. Networks 65, 312\u2013328 (2015)","journal-title":"Networks"},{"key":"30_CR2","doi-asserted-by":"crossref","unstructured":"Conitzer, V., Sandholm, T.: Computing the optimal strategy to commit to. In: Proceedings of the ACM Conference on Electronic Commerce (ACM-EC), pp. 82\u201390 (2006)","DOI":"10.1145\/1134707.1134717"},{"key":"30_CR3","unstructured":"Correa, J., Harks, T., Kreuzen, V., Matuschke, J.: Fare Evasion in Transit Networks (2014). \narXiv:1405.2826"},{"key":"30_CR4","doi-asserted-by":"crossref","unstructured":"Nguyen, T., Kar, D., Brown, M., Sinha, A., Jiang, A., Tambe, M.: Towards a science of security games. In: Toni, B. (ed.) New Frontiers of Multidisciplinary Research in STEAM-H (2016)","DOI":"10.1007\/978-3-319-31323-8_16"},{"key":"30_CR5","doi-asserted-by":"crossref","first-page":"712","DOI":"10.1287\/mnsc.17.11.712","volume":"17","author":"J Yen","year":"1971","unstructured":"Yen, J.: Finding the k shortest loopless paths in a network. Manage. Sci. 17, 712\u2013716 (1971)","journal-title":"Manage. Sci."}],"container-title":["Operations Research Proceedings","Operations Research Proceedings 2016"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-55702-1_30","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,7,20]],"date-time":"2017-07-20T10:26:39Z","timestamp":1500546399000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-55702-1_30"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,7,21]]},"ISBN":["9783319557014","9783319557021"],"references-count":5,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-55702-1_30","relation":{},"ISSN":["0721-5924","2197-9294"],"issn-type":[{"type":"print","value":"0721-5924"},{"type":"electronic","value":"2197-9294"}],"subject":[],"published":{"date-parts":[[2017,7,21]]}}}