{"day":"28","year":"2006","publisher":"Springer","status":"public","page":"256 - 270","date_published":"2006-09-28T00:00:00Z","month":"09","date_created":"2018-12-11T12:05:44Z","citation":{"ama":"Chatterjee K. Concurrent games with tail objectives. In: Vol 4207. Springer; 2006:256-270. doi:<a href=\"https://doi.org/10.1007/11874683_17\">10.1007/11874683_17</a>","mla":"Chatterjee, Krishnendu. <i>Concurrent Games with Tail Objectives</i>. Vol. 4207, Springer, 2006, pp. 256–70, doi:<a href=\"https://doi.org/10.1007/11874683_17\">10.1007/11874683_17</a>.","short":"K. Chatterjee, in:, Springer, 2006, pp. 256–270.","ieee":"K. Chatterjee, “Concurrent games with tail objectives,” presented at the CSL: Computer Science Logic, 2006, vol. 4207, pp. 256–270.","chicago":"Chatterjee, Krishnendu. “Concurrent Games with Tail Objectives,” 4207:256–70. Springer, 2006. <a href=\"https://doi.org/10.1007/11874683_17\">https://doi.org/10.1007/11874683_17</a>.","ista":"Chatterjee K. 2006. Concurrent games with tail objectives. CSL: Computer Science Logic, LNCS , vol. 4207, 256–270.","apa":"Chatterjee, K. (2006). Concurrent games with tail objectives (Vol. 4207, pp. 256–270). Presented at the CSL: Computer Science Logic, Springer. <a href=\"https://doi.org/10.1007/11874683_17\">https://doi.org/10.1007/11874683_17</a>"},"quality_controlled":0,"title":"Concurrent games with tail objectives","alternative_title":["LNCS "],"_id":"3891","author":[{"last_name":"Chatterjee","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","full_name":"Krishnendu Chatterjee","first_name":"Krishnendu","orcid":"0000-0002-4561-241X"}],"conference":{"name":"CSL: Computer Science Logic"},"doi":"10.1007/11874683_17","abstract":[{"text":"We study infinite stochastic games played by two-players over a finite state space, with objectives specified by sets of infinite traces. The games are concurrent (players make moves simultaneously and independently), stochastic (the next state is determined by a probability distribution that depends on the current state and chosen moves of the players) and infinite (proceeds for infinite number of rounds). The analysis of concurrent stochastic games can be classified into: quantitative analysis, analyzing the optimum value of the game; and qualitative analysis, analyzing the set of states with optimum value 1. We consider concurrent games with tail objectives, i.e., objectives that are independent of the finite-prefix of traces, and show that the class of tail objectives are strictly richer than the omega-regular objectives. We develop new proof techniques to extend several properties of concurrent games with omega-regular objectives to concurrent games with tail objectives. We prove the positive limit-one property for tail objectives, that states for all concurrent games if the optimum value for a player is positive for a tail objective Phi at some state, then there is a state where the optimum value is 1 for Phi, for the player. We also show that the optimum values of zero-sum (strictly conflicting objectives) games with tail objectives can be related to equilibrium values of nonzero-sum (not strictly conflicting objectives) games with simpler reachability objectives. A consequence of our analysis presents a polynomial time reduction of the quantitative analysis of tail objectives to the qualitative analysis for the sub-class of one-player stochastic games (Markov decision processes).","lang":"eng"}],"publication_status":"published","extern":1,"type":"conference","publist_id":"2272","date_updated":"2021-01-12T07:53:00Z","volume":4207,"intvolume":"      4207"}