{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T17:05:53Z","timestamp":1725555953309},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642130724"},{"type":"electronic","value":"9783642130731"}],"license":[{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"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":[[2010]]},"DOI":"10.1007\/978-3-642-13073-1_22","type":"book-chapter","created":{"date-parts":[[2010,5,10]],"date-time":"2010-05-10T04:09:58Z","timestamp":1273464598000},"page":"240-251","source":"Crossref","is-referenced-by-count":1,"title":["On Strategy Improvement Algorithms for Simple Stochastic Games"],"prefix":"10.1007","author":[{"given":"Rahul","family":"Tripathi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Elena","family":"Valkanova","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"V. S. Anil","family":"Kumar","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"22_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":"22_CR2","series-title":"DIMACS series in DM&TCS","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1090\/dimacs\/013\/04","volume-title":"Advances in Computational Complexity Theory","author":"A. Condon","year":"1993","unstructured":"Condon, A.: On algorithms for simple stochastic games. In: Cai, J. (ed.) Advances in Computational Complexity Theory. DIMACS series in DM&TCS, vol.\u00a013, pp. 51\u201373. American Mathematical Society, Providence (1993)"},{"key":"22_CR3","volume-title":"Mathematics in Science and Engineering","author":"C. Derman","year":"1970","unstructured":"Derman, C.: Finite State Markovian Decision Processes. In: Mathematics in Science and Engineering, vol.\u00a067. Academic Press, New York (1970)"},{"key":"22_CR4","volume-title":"Proceedings of the 24th IEEE Symposium on LICS","author":"O. Friedmann","year":"2009","unstructured":"Friedmann, O.: An exponential lower bound for the parity game strategy improvement algorithm as we know it. In: Proceedings of the 24th IEEE Symposium on LICS. IEEE Computer Society, Los Alamitos (2009) (to appear)"},{"key":"22_CR5","doi-asserted-by":"crossref","unstructured":"Gimbert, H., Horn, F.: Solving simple stochastic games with few random vertices. In: Foundations of Software Science and Comput. Structures (2009)","DOI":"10.2168\/LMCS-5(2:9)2009"},{"issue":"1","key":"22_CR6","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1007\/s00453-007-0175-3","volume":"49","author":"N. Halman","year":"2007","unstructured":"Halman, N.: Simple stochastic games, parity games, mean payoff games and DPGs are all LP-type problems. Algorithmica\u00a049(1), 37\u201350 (2007)","journal-title":"Algorithmica"},{"key":"22_CR7","doi-asserted-by":"publisher","first-page":"359","DOI":"10.1287\/mnsc.12.5.359","volume":"12","author":"A. Hoffman","year":"1966","unstructured":"Hoffman, A., Karp, R.: On nonterminating stochastic games. Management Science\u00a012, 359\u2013370 (1966)","journal-title":"Management Science"},{"key":"22_CR8","volume-title":"Dynamic Programming and Markov Processes","author":"R. Howard","year":"1960","unstructured":"Howard, R.: Dynamic Programming and Markov Processes. MIT Press, Cambridge (1960)"},{"key":"22_CR9","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-04650-0","volume-title":"Extremal Combinatorics","author":"S. Jukna","year":"2001","unstructured":"Jukna, S.: Extremal Combinatorics. Springer, Heidelberg (2001)"},{"issue":"1","key":"22_CR10","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1006\/inco.1995.1035","volume":"117","author":"W. Ludwig","year":"1995","unstructured":"Ludwig, W.: A subexponential randomized algorithm for the simple stochastic game problem. Information and Computation\u00a0117(1), 151\u2013155 (1995)","journal-title":"Information and Computation"},{"issue":"2","key":"22_CR11","doi-asserted-by":"publisher","first-page":"188","DOI":"10.1287\/ijoc.6.2.188","volume":"6","author":"M. Melekopoglou","year":"1994","unstructured":"Melekopoglou, M., Condon, A.: On the complexity of the policy improvement algorithm for Markov decision processes. ORSA Journal of Computing\u00a06(2), 188\u2013192 (1994)","journal-title":"ORSA Journal of Computing"},{"key":"22_CR12","unstructured":"Mansour, Y., Singh, S.: On the complexity of Policy Iteration. In: Proceedings of the 15th Conference on UAI, July 1999, pp. 401\u2013408 (1999)"},{"key":"22_CR13","doi-asserted-by":"crossref","unstructured":"Shapley, L.: Stochastic games. In: Proceedings of National Academy of Sciences (USA), vol.\u00a039, pp. 1095\u20131100 (1953)","DOI":"10.1073\/pnas.39.10.1095"},{"issue":"1","key":"22_CR14","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1016\/j.entcs.2004.07.008","volume":"119","author":"R. Somla","year":"2005","unstructured":"Somla, R.: New algorithms for solving simple stochastic games. Electronic Notes in Theoretical Computer Science\u00a0119(1), 51\u201365 (2005)","journal-title":"Electronic Notes in Theoretical Computer Science"},{"key":"22_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"202","DOI":"10.1007\/10722167_18","volume-title":"Computer Aided Verification","author":"J. V\u00f6ge","year":"2000","unstructured":"V\u00f6ge, J., Jurdzi\u0144ski, M.: A discrete strategy improvement algorithm for solving parity games. In: Emerson, E.A., Sistla, A.P. (eds.) CAV 2000. LNCS, vol.\u00a01855, pp. 202\u2013215. Springer, Heidelberg (2000)"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Complexity"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-13073-1_22","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,28]],"date-time":"2019-05-28T22:45:14Z","timestamp":1559083514000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-13073-1_22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642130724","9783642130731"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-13073-1_22","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}