{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,11]],"date-time":"2026-05-11T10:26:55Z","timestamp":1778495215834,"version":"3.51.4"},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642106309","type":"print"},{"value":"9783642106316","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-10631-6_13","type":"book-chapter","created":{"date-parts":[[2009,12,4]],"date-time":"2009-12-04T07:03:43Z","timestamp":1259910223000},"page":"112-121","source":"Crossref","is-referenced-by-count":40,"title":["The Complexity of Solving Stochastic Games on Graphs"],"prefix":"10.1007","author":[{"given":"Daniel","family":"Andersson","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Peter Bro","family":"Miltersen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"13_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-540-69407-6_1","volume-title":"Logic and Theory of Algorithms","author":"D. Andersson","year":"2008","unstructured":"Andersson, D., Hansen, K.A., Miltersen, P.B., S\u00f8rensen, T.B.: Deterministic graphical games revisited. In: Beckmann, A., Dimitracopoulos, C., L\u00f6we, B. (eds.) CiE 2008. LNCS, vol.\u00a05028, pp. 1\u201310. Springer, Heidelberg (2008)"},{"issue":"1","key":"13_CR2","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.ipl.2007.08.035","volume":"106","author":"K. Chatterjee","year":"2008","unstructured":"Chatterjee, K., Henzinger, T.A.: Reduction of stochastic parity to stochastic mean-payoff games. Inf. Process. Lett.\u00a0106(1), 1\u20137 (2008)","journal-title":"Inf. Process. Lett."},{"key":"13_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"100","DOI":"10.1007\/978-3-540-45220-1_11","volume-title":"Computer Science Logic","author":"K. Chatterjee","year":"2003","unstructured":"Chatterjee, K., Jurdzi\u0144ski, M., Henzinger, T.: Simple stochastic parity games. In: Baaz, M., Makowsky, J.A. (eds.) CSL 2003. LNCS, vol.\u00a02803, pp. 100\u2013113. Springer, Heidelberg (2003)"},{"key":"13_CR4","unstructured":"Chatterjee, K., Jurdzi\u0144ski, M., Henzinger, T.A.: Quantitative stochastic parity games. In: SODA 2004: Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms, pp. 121\u2013130 (2004)"},{"key":"13_CR5","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"},{"issue":"1-2","key":"13_CR6","doi-asserted-by":"publisher","first-page":"491","DOI":"10.1016\/S0304-3975(00)00034-7","volume":"258","author":"E.A. Emerson","year":"2001","unstructured":"Emerson, E.A., Jutla, C.S., Sistla, A.P.: On model checking for the mu-calculus and its fragments. Theoretical Computer Science\u00a0258(1-2), 491\u2013522 (2001)","journal-title":"Theoretical Computer Science"},{"key":"13_CR7","series-title":"Annals of Math. Studies","first-page":"179","volume-title":"Contributions to the Theory of Games III","author":"D. Gillette","year":"1957","unstructured":"Gillette, D.: Stochastic games with zero stop probabilities. In: Contributions to the Theory of Games III. Annals of Math. Studies, vol.\u00a039, pp. 179\u2013187. Princeton University Press, Princeton (1957)"},{"key":"13_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1007\/978-3-540-78499-9_2","volume-title":"Foundations of Software Science and Computational Structures","author":"H. Gimbert","year":"2008","unstructured":"Gimbert, H., Horn, F.: Simple Stochastic Games with Few Random Vertices are Easy to Solve. In: Amadio, R.M. (ed.) FOSSACS 2008. LNCS, vol.\u00a04962, pp. 5\u201319. Springer, Heidelberg (2008)"},{"key":"13_CR9","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1016\/0041-5553(88)90012-2","volume":"28","author":"V. Gurvich","year":"1988","unstructured":"Gurvich, V., Karzanov, A., Khachiyan, L.: Cyclic games and an algorithm to find minimax cycle means in directed graphs. USSR Computational Mathematics and Mathematical Physics\u00a028, 85\u201391 (1988)","journal-title":"USSR Computational Mathematics and Mathematical Physics"},{"key":"13_CR10","unstructured":"Gurvich, V., Miltersen, P.B.: On the computational complexity of solving stochastic mean-payoff games. arXiv:0812.0486v1 [cs.GT] (2008)"},{"issue":"1","key":"13_CR11","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 discounted payoff games are all LP-type problems. Algorithmica\u00a049(1), 37\u201350 (2007)","journal-title":"Algorithmica"},{"key":"13_CR12","volume-title":"Dynamic Programming and Markov Processes","author":"R.A. Howard","year":"1960","unstructured":"Howard, R.A.: Dynamic Programming and Markov Processes. MIT Press, Cambridge (1960)"},{"issue":"4","key":"13_CR13","doi-asserted-by":"publisher","first-page":"604","DOI":"10.1137\/1011093","volume":"11","author":"T.M. Liggett","year":"1969","unstructured":"Liggett, T.M., Lippman, S.A.: Stochastic games with perfect information and time average payoff. SIAM Review\u00a011(4), 604\u2013607 (1969)","journal-title":"SIAM Review"},{"key":"13_CR14","unstructured":"Littman, M.L.: Algorithms for sequential decision making. PhD thesis, Brown University, Department of Computer Science (1996)"},{"key":"13_CR15","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1016\/0168-0072(93)90036-D","volume":"65","author":"R. McNaughton","year":"1993","unstructured":"McNaughton, R.: Infinite games played on finite graphs. An. Pure and Applied Logic\u00a065, 149\u2013184 (1993)","journal-title":"An. Pure and Applied Logic"},{"key":"13_CR16","doi-asserted-by":"publisher","first-page":"1095","DOI":"10.1073\/pnas.39.10.1095","volume":"39","author":"L. Shapley","year":"1953","unstructured":"Shapley, L.: Stochastic games. Proc. Nat. Acad. Science\u00a039, 1095\u20131100 (1953)","journal-title":"Proc. Nat. Acad. Science"},{"issue":"1-2","key":"13_CR17","doi-asserted-by":"publisher","first-page":"343","DOI":"10.1016\/0304-3975(95)00188-3","volume":"158","author":"U. Zwick","year":"1996","unstructured":"Zwick, U., Paterson, M.: The complexity of mean payoff games on graphs. Theor. Comput. Sci.\u00a0158(1-2), 343\u2013359 (1996)","journal-title":"Theor. Comput. Sci."}],"container-title":["Lecture Notes in Computer Science","Algorithms and Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-10631-6_13.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,30]],"date-time":"2021-04-30T11:36:47Z","timestamp":1619782607000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-10631-6_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642106309","9783642106316"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-10631-6_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009]]}}}