{"month":"01","date_updated":"2021-01-12T07:59:39Z","type":"conference","author":[{"orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","full_name":"Krishnendu Chatterjee","first_name":"Krishnendu","last_name":"Chatterjee"},{"full_name":"de Alfaro, Luca","last_name":"De Alfaro","first_name":"Luca"},{"full_name":"Thomas Henzinger","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","last_name":"Henzinger","first_name":"Thomas A","orcid":"0000−0002−2985−7724"}],"day":"01","page":"291 - 300","doi":"10.1109/QEST.2006.48","_id":"4552","abstract":[{"text":"A concurrent reachability game is a two-player game played on a graph: at each state, the players simultaneously and independently select moves; the two moves determine jointly a probability distribution over the successor states. The objective for player 1 consists in reaching a set of target states; the objective for player 2 is to prevent this, so that the game is zero-sum. Our contributions are two-fold. First, we present a simple proof of the fact that in concurrent reachability games, for all epsilon &gt; 0, memoryless epsilon-optimal strategies exist. A memoryless strategy is independent of the history of plays, and an epsilon-optimal strategy achieves the objective with probability within epsilon of the value of the game. In contrast to previous proofs of this fact, which rely on the limit behavior of discounted games using advanced Puisieux series analysis, our proof is elementary and combinatorial. Second, we present a strategy-improvement (a.k.a. policy-iteration) algorithm for concurrent games with reachability objectives.","lang":"eng"}],"publication_status":"published","date_published":"2006-01-01T00:00:00Z","citation":{"ama":"Chatterjee K, De Alfaro L, Henzinger TA. Strategy improvement for concurrent reachability games. In: IEEE; 2006:291-300. doi:<a href=\"https://doi.org/10.1109/QEST.2006.48\">10.1109/QEST.2006.48</a>","chicago":"Chatterjee, Krishnendu, Luca De Alfaro, and Thomas A Henzinger. “Strategy Improvement for Concurrent Reachability Games,” 291–300. IEEE, 2006. <a href=\"https://doi.org/10.1109/QEST.2006.48\">https://doi.org/10.1109/QEST.2006.48</a>.","ista":"Chatterjee K, De Alfaro L, Henzinger TA. 2006. Strategy improvement for concurrent reachability games. QEST: Quantitative Evaluation of Systems, 291–300.","apa":"Chatterjee, K., De Alfaro, L., &#38; Henzinger, T. A. (2006). Strategy improvement for concurrent reachability games (pp. 291–300). Presented at the QEST: Quantitative Evaluation of Systems, IEEE. <a href=\"https://doi.org/10.1109/QEST.2006.48\">https://doi.org/10.1109/QEST.2006.48</a>","short":"K. Chatterjee, L. De Alfaro, T.A. Henzinger, in:, IEEE, 2006, pp. 291–300.","mla":"Chatterjee, Krishnendu, et al. <i>Strategy Improvement for Concurrent Reachability Games</i>. IEEE, 2006, pp. 291–300, doi:<a href=\"https://doi.org/10.1109/QEST.2006.48\">10.1109/QEST.2006.48</a>.","ieee":"K. Chatterjee, L. De Alfaro, and T. A. Henzinger, “Strategy improvement for concurrent reachability games,” presented at the QEST: Quantitative Evaluation of Systems, 2006, pp. 291–300."},"conference":{"name":"QEST: Quantitative Evaluation of Systems"},"extern":1,"year":"2006","publisher":"IEEE","date_created":"2018-12-11T12:09:26Z","publist_id":"162","title":"Strategy improvement for concurrent reachability games","quality_controlled":0,"status":"public"}