800 search results - page 11 / 160 » On the Complexity of Parity Games |
ENTCS
2002
13 years 9 months ago
2002
ICALP
2007
Springer
14 years 4 months ago
2007
Springer
We introduce stochastic priority games — a new class of perfect information stochastic games. These games can take two different, but equivalent, forms. In stopping priority ga...
MFCS
2009
Springer
14 years 4 months ago
2009
Springer
Abstract. The synthesis of a reactive system with respect to an ωregular specification requires the solution of a graph game. Such games have been extended in two natural ways. F...
CAV
2009
Springer
14 years 4 months ago
2009
Springer
In this paper we consider two-player zero-sum payoff games on finite graphs, both in the deterministic as well as in the stochastic setting. In the deterministic setting, we consi...
ISCAS
2005
IEEE
14 years 3 months ago
2005
IEEE