(Enter summary)
Abstract: We consider two-player infinite games played on graphs. The games
are concurrent, in that at each state the players choose their moves
simultaneously and independently, and stochastic, in that the moves
determine a probability distribution for the successor state. The value
of a game is the maximal probability with which a player can guarantee
the satisfaction of her objective. We show that the values of concurrent
games with #-regular objectives expressed as parity conditions can be... (Update)
Cited by: More
Two-player Nonzero-sum ω-regular Games - Chatterjee (2004)
(Correct)
Active bibliography (related documents): More All
0.7: On Nash Equilibria in Stochastic Games - Chatterjee, Jurdzinski, Majumdar (2003)
(Correct)
0.6: Algorithms for Stochastic Parity Games - Chatterjee, Henzinger (2005)
(Correct)
0.5: Games in System Design and Verification - Thomas Henzinger Epfl
(Correct)
Similar documents based on text:
0.0: Unknown -
(Correct)
BibTeX entry: (Update)
K. Chatterjee, L. de Alfaro, and T.A. Henzinger. The complexity of quantitative concurrent parity games. 2004. http://citeseer.ist.psu.edu/article/chatterjee04complexity.html More
@misc{ chatterjee04complexity,
author = "K. Chatterjee and L. de Alfaro and T. Henzinger",
title = "The complexity of quantitative concurrent parity games",
text = "K. Chatterjee, L. de Alfaro, and T.A. Henzinger. The complexity of quantitative
concurrent parity games. 2004.",
year = "2004",
url = "citeseer.ist.psu.edu/article/chatterjee04complexity.html" }
Citations (may not include all citations):
374
Automata on infinite objects (context) - Thomas - 1990
234
Supervisory control of a class of discrete-event processes (context) - Ramadge, Wonham - 1987
229
A Decision Method for Elementary Algebra and Geometry (context) - Tarski - 1951
131
and logic (context) - Thomas, automata - 1997
128
Automatic verification of probabilistic concurrent finitesta.. (context) - Vardi - 1985
110
the synthesis of a reactive module (context) - Pnueli, Rosner - 1989
100
mu-calculus and determinacy (context) - Emerson, Jutla - 1991
79
Stochastic games (context) - Shapley - 1953
78
the synthesis of strategies in infinite games
- Thomas - 1995
69
Classical Descriptive Set Theory (context) - Kechris - 1995
69
Competitive Markov Decision Processes (context) - Filar, Vrieze - 1997
52
Information and Computation (context) - Condon, of - 1992
49
Solving sequential conditions by finitestate strategies (context) - Buchi, Landweber - 1969
46
Infinite games played on finite graphs (context) - McNaughton - 1993
37
Module checking
- Kupferman, Vardi - 1996
34
Regular expressions for infinite trees and a standard form o.. (context) - Mostowski - 1984
15
The determinacy of Blackwell games (context) - Martin - 1998
13
Recursive games (context) - Everett - 1957
11
Playing large games using simple strategies
- Lipton, Markakis et al. - 2003
10
Quantitative solution of omega-regular games
- de Alfaro, Majumdar - 2001
9
Detecting errors before reaching them
- de Alfaro, Henzinger et al. - 2000
7
New results on quantifier elimination over real closed field..
- Basu - 1999
7
Concurrent omega-regular games
- de Alfaro, Henzinger - 2000
6
International Journal of Game Theory (context) - Mertens, Neyman - 1981
4
On nash equilibria in stochastic games
- Chatterjee, Majumdar et al. - 2004
4
Quantitative stochastic parity games
- Chatterjee, Jurdzinski et al. - 2004
3
ZOR --- Methods and Models of Operations Research (context) - Raghavan, Filar et al. - 1991
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