{"issue":"1-3","publication":"Theoretical Computer Science","publication_status":"published","abstract":[{"lang":"eng","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 (proceed for an infinite number of rounds). The analysis of concurrent stochastic games can be classified into: quantitative analysis, analyzing the optimum value of the game and epsilon-optimal strategies that ensure values within epsilon of the optimum value; and qualitative analysis, analyzing the set of states with optimum value 1 and epsilon-optimal strategies for the 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 is strictly richer than that of 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. The positive limit-one property states that 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 the player for the objective Phi. We also show that the optimum values of zero-sum (strictly conflicting objectives) games with tail objectives can be related to equilibrium values of nonzerosum (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 subclass of one-player stochastic games (Markov decision processes). "}],"author":[{"orcid":"0000-0002-4561-241X","first_name":"Krishnendu","full_name":"Krishnendu Chatterjee","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","last_name":"Chatterjee"}],"doi":"10.1016/j.tcs.2007.07.047","_id":"3882","title":"Concurrent games with tail objectives","quality_controlled":0,"intvolume":"       388","volume":388,"publist_id":"2290","date_updated":"2021-01-12T07:52:56Z","type":"journal_article","extern":1,"date_published":"2007-12-05T00:00:00Z","page":"181 - 198","publisher":"Elsevier","year":"2007","status":"public","day":"05","citation":{"ieee":"K. Chatterjee, “Concurrent games with tail objectives,” <i>Theoretical Computer Science</i>, vol. 388, no. 1–3. Elsevier, pp. 181–198, 2007.","short":"K. Chatterjee, Theoretical Computer Science 388 (2007) 181–198.","mla":"Chatterjee, Krishnendu. “Concurrent Games with Tail Objectives.” <i>Theoretical Computer Science</i>, vol. 388, no. 1–3, Elsevier, 2007, pp. 181–98, doi:<a href=\"https://doi.org/10.1016/j.tcs.2007.07.047\">10.1016/j.tcs.2007.07.047</a>.","ama":"Chatterjee K. Concurrent games with tail objectives. <i>Theoretical Computer Science</i>. 2007;388(1-3):181-198. doi:<a href=\"https://doi.org/10.1016/j.tcs.2007.07.047\">10.1016/j.tcs.2007.07.047</a>","apa":"Chatterjee, K. (2007). Concurrent games with tail objectives. <i>Theoretical Computer Science</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.tcs.2007.07.047\">https://doi.org/10.1016/j.tcs.2007.07.047</a>","chicago":"Chatterjee, Krishnendu. “Concurrent Games with Tail Objectives.” <i>Theoretical Computer Science</i>. Elsevier, 2007. <a href=\"https://doi.org/10.1016/j.tcs.2007.07.047\">https://doi.org/10.1016/j.tcs.2007.07.047</a>.","ista":"Chatterjee K. 2007. Concurrent games with tail objectives. Theoretical Computer Science. 388(1–3), 181–198."},"date_created":"2018-12-11T12:05:41Z","month":"12","acknowledgement":"A preliminary version of the paper appeared in Computer Science Logic (CSL) 2006."}