75 search results - page 5 / 15 » Mean-Payoff Parity Games |
FOSSACS
2006
Springer
15 years 1 months ago
2006
Springer
We consider parity games played on special pushdown graphs, namely those generated by one-counter processes. For parity games on pushdown graphs, it is known from [22] that decidin...
FM
2008
Springer
14 years 11 months ago
2008
Springer
In [?], a practical algorithm for precise interval analysis is provided for which, however, no non-trivial upper complexity bound is known. Here, we present a lower bound by showin...
64
Voted
SODA
2004
ACM
14 years 11 months ago
2004
ACM
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 resul...
TACAS
2009
Springer
15 years 4 months ago
2009
Springer
Alpaga is a solver for parity games with imperfect information. Given the description of a game, it determines whether the first player can ensure to win and, if so, it constructs...
FSTTCS
2008
Springer
14 years 10 months ago
2008
Springer
We present a polynomial-time reduction from parity games with imperfect information to safety games with imperfect information. Similar reductions for games with perfect informatio...