Krishnendu Chatterjee, Marcin Jurdzinski, Thomas A. Henzinger  Home/Search
Context Related
| berkeley.edu/techrepor...CSD031280.ps Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: berkeley.edu/access...CSD031280 (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: We study perfect-information stochastic parity games. These are two-player nonterminating games which are played on a graph with turn-based probabilistic transitions. A play results in an in nite path and the conicting goals of the two players are !-regular path properties, formalized as parity winning conditions. The qualitative solution of such a game amounts to computing the set of vertices from which a player has a strategy to win with probability 1 (or with positive probability). (Update)
Cited by: More
On Nash Equilibria in Stochastic Games - Chatterjee, Jurdzinski, Majumdar (2003) (Correct)
The Complexity of Stochastic Rabin and Streett Games - Chatterjee, de Alfaro.. (2004) (Correct)
The Complexity of Quantitative Concurrent Parity Games - Chatterjee, Henzinger (2004) (Correct)
Active bibliography (related documents): More All
2.4: Quantitative Stochastic Parity Games - Chatterjee, Jurdzinski, Henzinger (2004) (Correct)
0.7: Simple Stochastic Parity Games - Chatterjee, Jurdzinski, Henzinger (2003) (Correct)
0.5: Positional Determinacy Of Games With Infinitely Many - Priorities Erich Gr (Correct)
Similar documents based on text:
3.0: Unknown - (Correct)
Related documents from co-citation: More All
4: Competitive Markov Decision Processes (context) - Filar, Vrieze - 1996
4: Information and Computation (context) - Condon, of - 1992
3: and logic (context) - Thomas, automata
BibTeX entry: (Update)
K. Chatterjee, M. Jurdzinski, and T.A. Henzinger. Quantitative stochastic parity games. In SODA'04, pages 114--123. SIAM, 2004. http://citeseer.ist.psu.edu/chatterjee03quantitative.html More
@misc{ chatterjee04quantitative,
author = "K. Chatterjee and M. Jurdzinski and T. Henzinger",
title = "Quantitative stochastic parity games",
text = "K. Chatterjee, M. Jurdzinski, and T.A. Henzinger. Quantitative stochastic
parity games. In SODA'04, pages 114--123. SIAM, 2004.",
year = "2004",
url = "citeseer.ist.psu.edu/chatterjee03quantitative.html" }
Citations (may not include all citations):291 Markov Decision Processes: Discrete Stochastic Dynamic Progr.. (context) - Puterman - 1994
229 A Decision Method for Elementary Algebra and Geometry (context) - Tarski - 1951
182 Theory of Games and Economic Behavior (context) - von Neumann, Morgenstern - 1953
131 and logic (context) - Thomas, automata - 1997
79 Stochastic games (context) - Shapley - 1953
69 Competitive Markov Decision Processes (context) - Filar, Vrieze - 1997
59 the complexity of solving Markov decision problems - Littman, Dean et al. - 1995
52 Information and Computation (context) - Condon, of - 1992
42 and games (context) - Gurevich, Harrington et al. - 1982
39 On model-checking for fragments of -calculus - Emerson, Jutla et al. - 1993
33 calculus and determinacy (context) - Emerson, Jutla - 1991
31 Markov decision processes and regular events (context) - Courcoubetis, Yannakakis - 1990
25 Theory of Hybrid Systems and Discrete Event Systems (context) - Puri - 1995
19 Algorithms for stochastic games | a survey (context) - Raghavan, Filar - 1991
15 The determinacy of Blackwell games (context) - Martin - 1998
13 Recursive games (context) - Everett - 1957
12 calculus alternation hierarchy is strict (context) - eld, modal - 1998
12 Concurrent reachability games - de Alfaro, Henzinger et al. - 1998
12 Small progress measures for solving parity games (context) - Jurdzi - 2000
10 volume 146 of Studies in Logic and the Foundations of Mathem.. (context) - Arnold, Niwi et al. - 2001
10 Quantitative solution of omega-regular games - de Alfaro, Majumdar - 2001
9 The complexity of mean payo games on graphs (context) - Zwick, Paterson - 1996
9 Deciding the winner in parity games is in UP \ co-UP (context) - Jurdzi - 1998
8 regular games (context) - de Alfaro, Henzinger - 2000
5 A discrete strategy improvement algorithm for solving parity.. (context) - oge, Jurdzi - 2000
4 Simple stochastic parity games - Chatterjee, Jurdzi et al. - 2003
3 Games for synthesis of controllers with partial observation (context) - Arnold, Vincent et al. - 2003
3 On complexity of parity word automata - King, Kupferman et al. - 2001
2 A Guide to Current Research (context) - Gr, Thomas et al. - 2002
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC