{"date_published":"2006-02-14T00:00:00Z","conference":{"name":"STACS: Theoretical Aspects of Computer Science"},"extern":1,"citation":{"short":"K. Chatterjee, T.A. Henzinger, in:, Springer, 2006, pp. 512–523.","ista":"Chatterjee K, Henzinger TA. 2006. Strategy improvement and randomized subexponential algorithms for stochastic parity games. STACS: Theoretical Aspects of Computer Science, LNCS, vol. 3884, 512–523.","apa":"Chatterjee, K., &#38; Henzinger, T. A. (2006). Strategy improvement and randomized subexponential algorithms for stochastic parity games (Vol. 3884, pp. 512–523). Presented at the STACS: Theoretical Aspects of Computer Science, Springer. <a href=\"https://doi.org/10.1007/11672142_42\">https://doi.org/10.1007/11672142_42</a>","chicago":"Chatterjee, Krishnendu, and Thomas A Henzinger. “Strategy Improvement and Randomized Subexponential Algorithms for Stochastic Parity Games,” 3884:512–23. Springer, 2006. <a href=\"https://doi.org/10.1007/11672142_42\">https://doi.org/10.1007/11672142_42</a>.","ama":"Chatterjee K, Henzinger TA. Strategy improvement and randomized subexponential algorithms for stochastic parity games. In: Vol 3884. Springer; 2006:512-523. doi:<a href=\"https://doi.org/10.1007/11672142_42\">10.1007/11672142_42</a>","ieee":"K. Chatterjee and T. A. Henzinger, “Strategy improvement and randomized subexponential algorithms for stochastic parity games,” presented at the STACS: Theoretical Aspects of Computer Science, 2006, vol. 3884, pp. 512–523.","mla":"Chatterjee, Krishnendu, and Thomas A. Henzinger. <i>Strategy Improvement and Randomized Subexponential Algorithms for Stochastic Parity Games</i>. Vol. 3884, Springer, 2006, pp. 512–23, doi:<a href=\"https://doi.org/10.1007/11672142_42\">10.1007/11672142_42</a>."},"publication_status":"published","abstract":[{"lang":"eng","text":"A stochastic graph game is played by two players on a game graph with probabilistic transitions. We consider stochastic graph games with ω-regular winning conditions specified as parity objectives. These games lie in NP ∩ coNP. We present a strategy improvement algorithm for stochastic parity games; this is the first non-brute-force algorithm for solving these games. From the strategy improvement algorithm we obtain a randomized subexponential-time algorithm to solve such games."}],"_id":"4538","day":"14","author":[{"last_name":"Chatterjee","first_name":"Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","full_name":"Krishnendu Chatterjee","orcid":"0000-0002-4561-241X"},{"id":"40876CD8-F248-11E8-B48F-1D18A9856A87","full_name":"Thomas Henzinger","first_name":"Thomas A","last_name":"Henzinger","orcid":"0000−0002−2985−7724"}],"doi":"10.1007/11672142_42","page":"512 - 523","type":"conference","date_updated":"2021-01-12T07:59:32Z","month":"02","status":"public","title":"Strategy improvement and randomized subexponential algorithms for stochastic parity games","quality_controlled":0,"alternative_title":["LNCS"],"volume":3884,"publist_id":"184","date_created":"2018-12-11T12:09:22Z","intvolume":"      3884","year":"2006","publisher":"Springer"}