{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T16:30:22Z","timestamp":1725899422587},"publisher-location":"Berlin, Heidelberg","reference-count":7,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642360442"},{"type":"electronic","value":"9783642360466"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-36046-6_11","type":"book-chapter","created":{"date-parts":[[2013,1,16]],"date-time":"2013-01-16T00:56:22Z","timestamp":1358297782000},"page":"106-117","source":"Crossref","is-referenced-by-count":0,"title":["Strategy Complexity of Finite-Horizon Markov Decision Processes and Simple Stochastic Games"],"prefix":"10.1007","author":[{"given":"Krishnendu","family":"Chatterjee","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rasmus","family":"Ibsen-Jensen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"11_CR1","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1016\/0890-5401(92)90048-K","volume":"96","author":"A. Condon","year":"1992","unstructured":"Condon, A.: The complexity of stochastic games. Information and Computation\u00a096, 203\u2013224 (1992)","journal-title":"Information and Computation"},{"key":"11_CR2","doi-asserted-by":"crossref","unstructured":"Everett, H.: Recursive games. In: Kuhn, H.W., Tucker, A.W. (eds.) Contributions to the Theory of Games Vol. III. Annals of Mathematical Studies, vol.\u00a039. Princeton University Press (1957)","DOI":"10.1515\/9781400882151-004"},{"key":"11_CR3","doi-asserted-by":"crossref","unstructured":"Filar, J., Vrieze, K.: Competitive Markov Decision Process, ch. 2.2, pp. 16\u201322. Springer (1997)","DOI":"10.1007\/978-1-4612-4054-9"},{"key":"11_CR4","unstructured":"Howard, R.A.: Dynamic Programming and Markov Processes. M.I.T. Press (1960)"},{"key":"11_CR5","doi-asserted-by":"crossref","unstructured":"Ibsen-Jensen, R., Miltersen, P.B.: Solving simple stochastic games with few coin toss positions. European Symposia on Algorithms (to appear, 2012)","DOI":"10.1007\/978-3-642-33090-2_55"},{"issue":"9","key":"11_CR6","doi-asserted-by":"publisher","first-page":"693","DOI":"10.2307\/2321853","volume":"87","author":"D.J. Newman","year":"1980","unstructured":"Newman, D.J.: Simple analytic proof of the prime number theorem. The American Mathematical Monthly\u00a087(9), 693\u2013696 (1980)","journal-title":"The American Mathematical Monthly"},{"key":"11_CR7","unstructured":"Puterman, M.L.: Markov Decision Processes, ch. 4, pp. 74\u2013118. John Wiley & Sons, Inc. (2008)"}],"container-title":["Lecture Notes in Computer Science","Mathematical and Engineering Methods in Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-36046-6_11.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,2,6]],"date-time":"2022-02-06T01:31:03Z","timestamp":1644111063000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-36046-6_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642360442","9783642360466"],"references-count":7,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-36046-6_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}