{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T03:44:07Z","timestamp":1740109447587,"version":"3.37.3"},"reference-count":9,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2017,12,22]],"date-time":"2017-12-22T00:00:00Z","timestamp":1513900800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001665","name":"Agence Nationale de la Recherche (FR)","doi-asserted-by":"publisher","award":["ANR-14-CE25-0006"],"award-info":[{"award-number":["ANR-14-CE25-0006"]}],"id":[{"id":"10.13039\/501100001665","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Int J Game Theory"],"published-print":{"date-parts":[[2018,5]]},"DOI":"10.1007\/s00182-017-0607-5","type":"journal-article","created":{"date-parts":[[2017,12,21]],"date-time":"2017-12-21T23:19:09Z","timestamp":1513898349000},"page":"487-508","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Ice sliding games"],"prefix":"10.1007","volume":"47","author":[{"given":"Paul","family":"Dorbec","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"\u00c9ric","family":"Duch\u00eane","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andr\u00e9","family":"Fabbri","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Julien","family":"Moncel","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Aline","family":"Parreau","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"\u00c9ric","family":"Sopena","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,12,22]]},"reference":[{"key":"607_CR1","unstructured":"Burke K (2012) CGT Blog. \n                        http:\/\/combinatorialgametheory.blogspot.fr\/search?updated-max=2012-10-05T10:28:00-07:00&max-results=7"},{"key":"607_CR2","unstructured":"Butko N, Lehmann KA, Ramenzoni V (2006) Ricochet robots\u2014a case study for human complex problem solving. Project thesis from the Complex System Summer School, Santa Fe Institute"},{"key":"607_CR3","doi-asserted-by":"crossref","unstructured":"Demaine E (2001) Playing games with algorithms: algorithmic combinatorial game theory. In: Proceedings of the 26th international symposium on mathematical foundations of computer science","DOI":"10.1007\/3-540-44683-4_3"},{"key":"607_CR4","unstructured":"Engels B, Kamphans T (2005) On the complexity of Randolph\u2019s Robot Game, Technical Report"},{"issue":"3","key":"607_CR5","doi-asserted-by":"crossref","first-page":"1443","DOI":"10.1137\/11082574","volume":"25","author":"D Gon\u00e7alves","year":"2011","unstructured":"Gon\u00e7alves D, Pinlou A, Rao M, Thomass\u00e9 S (2011) The domination number of grids. SIAM J Discrete Math 25(3):1443\u20131453","journal-title":"SIAM J Discrete Math"},{"issue":"3","key":"607_CR6","doi-asserted-by":"crossref","first-page":"543","DOI":"10.1137\/S003614450139517","volume":"45","author":"JR Hartline","year":"2003","unstructured":"Hartline JR, Libeskind-Hadas R (2003) The computational complexity of motion planning. SIAM Rev 45(3):543\u2013557","journal-title":"SIAM Rev"},{"key":"607_CR7","unstructured":"Hock M (2001) Exploring the complexity of the UFO puzzle. Undergraduate thesis, Carnegie Mellon University. \n                        http:\/\/www.cs.cmu.edu\/afs\/cs\/user\/mjs\/ftp\/thesis-02\/hock.ps"},{"key":"607_CR8","first-page":"35","volume":"9","author":"A Klobucar","year":"2004","unstructured":"Klobucar A (2004) Total domination numbers of cartesian products. Math Commun 9:35\u201344","journal-title":"Math Commun"},{"key":"607_CR9","unstructured":"TCS questions & answers Website (2012). \n                        http:\/\/cstheory.stackexchange.com\/questions\/10813\/what-is-the-known-complexity-of-this-game-similar-to-pushpush-1"}],"container-title":["International Journal of Game Theory"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00182-017-0607-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00182-017-0607-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00182-017-0607-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2018,8,10]],"date-time":"2018-08-10T10:56:06Z","timestamp":1533898566000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00182-017-0607-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,12,22]]},"references-count":9,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2018,5]]}},"alternative-id":["607"],"URL":"https:\/\/doi.org\/10.1007\/s00182-017-0607-5","relation":{},"ISSN":["0020-7276","1432-1270"],"issn-type":[{"type":"print","value":"0020-7276"},{"type":"electronic","value":"1432-1270"}],"subject":[],"published":{"date-parts":[[2017,12,22]]}}}