22 search results - page 1 / 5 » An Optimal Strategy Improvement Algorithm for Solving Parity... |
CSL
2008
Springer
13 years 6 months ago
2008
Springer
This paper presents a novel strategy improvement algorithm for parity and payoff games, which is guaranteed to select, in each improvement step, an optimal combination of local str...
LICS
2009
IEEE
13 years 11 months ago
2009
IEEE
This paper presents a new lower bound for the discrete strategy improvement algorithm for solving parity games due to V¨oge and Jurdzi´nski. First, we informally show which stru...
LICS
2005
IEEE
13 years 10 months ago
2005
IEEE
Games played on graphs may have qualitative objectives, such as the satisfaction of an ω-regular property, or quantitative objectives, such as the optimization of a realvalued re...
IPCO
2010
13 years 6 months ago
2010
Abstract. We consider two-person zero-sum stochastic mean payoff games with perfect information, or BWR-games, given by a digraph G = (V = VB VW VR, E), with local rewards r : E R...
CAV
2009
Springer
13 years 11 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...