{"month":"09","date_created":"2018-12-11T12:05:44Z","citation":{"ama":"Chatterjee K. Two-player nonzero-sum ω-regular games. In: Vol 3653. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2005:413-427. doi:<a href=\"https://doi.org/10.1007/11539452_32\">10.1007/11539452_32</a>","mla":"Chatterjee, Krishnendu. <i>Two-Player Nonzero-Sum ω-Regular Games</i>. Vol. 3653, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2005, pp. 413–27, doi:<a href=\"https://doi.org/10.1007/11539452_32\">10.1007/11539452_32</a>.","short":"K. Chatterjee, in:, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2005, pp. 413–427.","ieee":"K. Chatterjee, “Two-player nonzero-sum ω-regular games,” presented at the CONCUR: Concurrency Theory, 2005, vol. 3653, pp. 413–427.","chicago":"Chatterjee, Krishnendu. “Two-Player Nonzero-Sum ω-Regular Games,” 3653:413–27. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2005. <a href=\"https://doi.org/10.1007/11539452_32\">https://doi.org/10.1007/11539452_32</a>.","ista":"Chatterjee K. 2005. Two-player nonzero-sum ω-regular games. CONCUR: Concurrency Theory, LNCS , vol. 3653, 413–427.","apa":"Chatterjee, K. (2005). Two-player nonzero-sum ω-regular games (Vol. 3653, pp. 413–427). Presented at the CONCUR: Concurrency Theory, Schloss Dagstuhl - Leibniz-Zentrum für Informatik. <a href=\"https://doi.org/10.1007/11539452_32\">https://doi.org/10.1007/11539452_32</a>"},"day":"05","year":"2005","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","status":"public","page":"413 - 427","date_published":"2005-09-05T00:00:00Z","extern":1,"type":"conference","publist_id":"2267","date_updated":"2021-01-12T07:53:00Z","volume":3653,"intvolume":"      3653","quality_controlled":0,"title":"Two-player nonzero-sum ω-regular games","alternative_title":["LNCS "],"_id":"3893","author":[{"orcid":"0000-0002-4561-241X","full_name":"Krishnendu Chatterjee","first_name":"Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","last_name":"Chatterjee"}],"conference":{"name":"CONCUR: Concurrency Theory"},"doi":"10.1007/11539452_32","abstract":[{"lang":"eng","text":"We study infinite stochastic games played by two-players on a finite graph with goals specified by sets of infinite traces. The games are concurrent (each player simultaneously and independently chooses an action at each round), stochastic (the next state is determined by a probability distribution depending on the current state and the chosen actions), infinite (the game continues for an infinite number of rounds), nonzero-sum (the players' goals are not necessarily conflicting), and undiscounted. We show that if each player has an W-regular objective expressed as a paxity objective, then there exists an epsilon-Nash equilibrium, for every epsilon &gt; 0. However, exact Nash equilibria need not exist. We study the complexity of finding values (payoff profile) of an epsilon-Nash equilibrium. We show that the values of an epsilon-Nash equilibrium in nonzero-sum concurrent parity games can be computed by solving the following two simpler problems: computing the values of zero-sum (the goals of the players axe strictly conflicting) concurrent parity games and computing epsilon-Nash equilibrium values of nonzero-sum concurrent games with reachability objectives. As a consequence we establish that values of an epsilon-Nash equilibrium can be computed in TFNP (total functional NP), and hence in EXPTIME."}],"publication_status":"published"}