{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T18:13:48Z","timestamp":1725732828255},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642387081"},{"type":"electronic","value":"9783642387098"}],"license":[{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-662-44602-7_4","type":"book-chapter","created":{"date-parts":[[2014,8,23]],"date-time":"2014-08-23T01:18:40Z","timestamp":1408756720000},"page":"39-53","source":"Crossref","is-referenced-by-count":0,"title":["The Shortest Path Game: Complexity and Algorithms"],"prefix":"10.1007","author":[{"given":"Andreas","family":"Darmann","sequence":"first","affiliation":[]},{"given":"Ulrich","family":"Pferschy","sequence":"additional","affiliation":[]},{"given":"Joachim","family":"Schauer","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"1","key":"4_CR1","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1016\/0304-3975(93)90357-Y","volume":"110","author":"H. Bodlaender","year":"1993","unstructured":"Bodlaender, H.: Complexity of path-forming games. Theoretical Computer Science\u00a0110(1), 215\u2013245 (1993)","journal-title":"Theoretical Computer Science"},{"key":"4_CR2","doi-asserted-by":"crossref","unstructured":"Darmann, A., Klamler, C., Pferschy, U.: Sharing the cost of a path. Technical report (2013), \n                    \n                      http:\/\/ssrn.com\/abstract=2287875\n                    \n                    \n                   (submitted)","DOI":"10.2139\/ssrn.2287875"},{"key":"4_CR3","doi-asserted-by":"publisher","first-page":"539","DOI":"10.1016\/j.ejor.2013.08.047","volume":"233","author":"A. Darmann","year":"2014","unstructured":"Darmann, A., Nicosia, G., Pferschy, U., Schauer, J.: The subset sum game. European Journal on Operational Research\u00a0233, 539\u2013549 (2014)","journal-title":"European Journal on Operational Research"},{"issue":"1","key":"4_CR4","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1016\/0097-3165(87)90074-4","volume":"46","author":"A.S. Fraenkel","year":"1987","unstructured":"Fraenkel, A.S., Goldschmidt, E.: PSPACE-hardness of some combinatorial games. Journal of Combinatorial Theory\u00a046(1), 21\u201338 (1987)","journal-title":"Journal of Combinatorial Theory"},{"issue":"2","key":"4_CR5","doi-asserted-by":"publisher","first-page":"371","DOI":"10.1016\/0304-3975(93)90026-P","volume":"112","author":"A.S. Fraenkel","year":"1993","unstructured":"Fraenkel, A.S., Scheinerman, E.R., Ullman, D.: Undirected edge geography. Theoretical Computer Science\u00a0112(2), 371\u2013381 (1993)","journal-title":"Theoretical Computer Science"},{"issue":"1","key":"4_CR6","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1016\/0304-3975(93)90356-X","volume":"110","author":"A.S. Fraenkel","year":"1993","unstructured":"Fraenkel, A.S., Simonson, S.: Geography. Theoretical Computer Science\u00a0110(1), 197\u2013214 (1993)","journal-title":"Theoretical Computer Science"},{"issue":"2","key":"4_CR7","doi-asserted-by":"publisher","first-page":"393","DOI":"10.1145\/322186.322201","volume":"27","author":"D. Lichtenstein","year":"1980","unstructured":"Lichtenstein, D., Sipser, M.: Go is polynomial-space hard. Journal of the ACM\u00a027(2), 393\u2013401 (1980)","journal-title":"Journal of the ACM"},{"key":"4_CR8","unstructured":"Osborne, M.J.: An Introduction to Game Theory. Oxford Univ. Press (2004)"},{"issue":"2","key":"4_CR9","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1016\/0022-0000(78)90045-4","volume":"16","author":"T.J. Schaefer","year":"1978","unstructured":"Schaefer, T.J.: On the complexity of some two-person perfect-information games. Journal of Computer and System Sciences\u00a016(2), 185\u2013225 (1978)","journal-title":"Journal of Computer and System Sciences"},{"key":"4_CR10","doi-asserted-by":"crossref","unstructured":"Stockmeyer, L.J., Meyer, A.R.: Word problems requiring exponential time. In: Proc. of the 5th Symp. on Theory of Computing, STOC 1973, pp. 1\u20139 (1973)","DOI":"10.1145\/800125.804029"}],"container-title":["Lecture Notes in Computer Science","Advanced Information Systems Engineering"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-44602-7_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,27]],"date-time":"2019-05-27T17:06:47Z","timestamp":1558976807000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-44602-7_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783642387081","9783642387098"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-44602-7_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}