{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T08:30:33Z","timestamp":1725697833936},"reference-count":13,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2012,1,26]],"date-time":"2012-01-26T00:00:00Z","timestamp":1327536000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Int J Game Theory"],"published-print":{"date-parts":[[2013,11]]},"DOI":"10.1007\/s00182-012-0319-9","type":"journal-article","created":{"date-parts":[[2012,1,25]],"date-time":"2012-01-25T20:46:48Z","timestamp":1327524408000},"page":"777-788","source":"Crossref","is-referenced-by-count":1,"title":["Algorithms for lattice games"],"prefix":"10.1007","volume":"42","author":[{"given":"Alan","family":"Guo","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ezra","family":"Miller","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2012,1,26]]},"reference":[{"key":"319_CR1","unstructured":"Barvinok A (2006) The complexity of generating functions for integer points in polyhedra and beyond. International Congress of Mathematicians, vol III. European Mathematical Society, Zurich, pp 763\u2013787"},{"issue":"4","key":"319_CR2","doi-asserted-by":"crossref","first-page":"957","DOI":"10.1090\/S0894-0347-03-00428-4","volume":"16","author":"A Barvinok","year":"2003","unstructured":"Barvinok A, Woods K (2003) Short rational generating functions for lattice point problems. J Am Math Soc 16(4): 957\u2013979 (electronic)","journal-title":"J Am Math Soc"},{"key":"319_CR3","doi-asserted-by":"crossref","unstructured":"Bouton CL (1901\/02) Nim, a game with a complete mathematical theory. Ann Math (2) 3(1\u20134):35\u201339","DOI":"10.2307\/1967631"},{"key":"319_CR4","unstructured":"Dawson T (1934) Fairy chess supplement. The problemist: British Chess Problem Society 2(9), 94, problem no. 1603"},{"issue":"2","key":"319_CR5","doi-asserted-by":"crossref","first-page":"450","DOI":"10.1016\/j.jcta.2011.10.005","volume":"119","author":"A Fink","year":"2011","unstructured":"Fink A (2011) Lattice games without rational strategies. J Comb Theory Ser A 119(2): 450\u2013459","journal-title":"J Comb Theory Ser A"},{"key":"319_CR6","doi-asserted-by":"crossref","unstructured":"Guo A, Miller E (2010) Lattice point methods for combinatorial games. Adv Appl Math 46: 363\u2013378. doi: 10.1016\/j.aam.2010.10.004 (arXiv:math.CO\/0908.3473; Erratum: preprint, 2011)","DOI":"10.1016\/j.aam.2010.10.004"},{"key":"319_CR7","unstructured":"Guo A, Miller E, Weimerskirch M (2009) Potential applications of commutative algebra to combinatorial game theory. In: Kommutative Algebra, abstracts from the April 19\u201325, 2009 workshop, organized by W. Bruns, H. Flenner, and C. Huneke, Oberwolfach Rep 22:23\u201326"},{"key":"319_CR8","doi-asserted-by":"crossref","first-page":"514","DOI":"10.1017\/S0305004100031509","volume":"52","author":"RK Guy","year":"1956","unstructured":"Guy RK, Smith CAB (1956) The G-values of various games. Proc Camb Philos Soc 52: 514\u2013526","journal-title":"Proc Camb Philos Soc"},{"key":"319_CR9","unstructured":"Miller E (2010) Affine stratifications from finite mis\u00e8re quotients (preprint, 2010. arXiv:math. CO\/1009. 2199v1)"},{"key":"319_CR10","volume-title":"Combinatorial commutative algebra. Graduate texts in mathematics, vol 227","author":"E Miller","year":"2005","unstructured":"Miller E, Sturmfels B (2005) Combinatorial commutative algebra. Graduate texts in mathematics, vol 227. Springer\u2013Verlag, New York"},{"key":"319_CR11","unstructured":"Plambeck TE (2005) Taming the wild in impartial combinatorial games. Integers 5(1), G5, p 36 (electronic)"},{"key":"319_CR12","doi-asserted-by":"crossref","unstructured":"Plambeck TE, Siegel AN (2008) Mis\u00e8re quotients for impartial games. J Combin Theory Ser A 115(4): 593\u2013622 (arXiv:math.CO\/0609825v5)","DOI":"10.1016\/j.jcta.2007.07.008"},{"key":"319_CR13","unstructured":"Weimerskirch M (2009) An algorithm for computing indistinguishability quotients in mis\u00e8re impartial combinatorial games (preprint)"}],"container-title":["International Journal of Game Theory"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00182-012-0319-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00182-012-0319-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00182-012-0319-9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,22]],"date-time":"2019-06-22T22:59:51Z","timestamp":1561244391000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00182-012-0319-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,1,26]]},"references-count":13,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2013,11]]}},"alternative-id":["319"],"URL":"https:\/\/doi.org\/10.1007\/s00182-012-0319-9","relation":{},"ISSN":["0020-7276","1432-1270"],"issn-type":[{"value":"0020-7276","type":"print"},{"value":"1432-1270","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,1,26]]}}}