20 search results - page 1 / 4 » Strategy Iteration using Non-Deterministic Strategies for So... |
CORR
2008
Springer
13 years 5 months ago
2008
Springer
Abstract. This article extends the idea of solving parity games by strategy iteration to non-deterministic strategies: In a non-deterministic strategy a player restricts himself to...
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...
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...
CORR
2010
Springer
13 years 5 months ago
2010
Springer
Concurrent reachability games is a class of games heavily studied by the computer science community, in particular by the formal methods community. Two standard algorithms for app...
CONCUR
2008
Springer
13 years 6 months ago
2008
Springer
We consider imperfect-information parity games in which strategies rely on observations that provide imperfect information about the history of a play. To solve such games, i.e., t...