800 search results - page 13 / 160 » On the Complexity of Parity Games |
LICS
2008
IEEE
14 years 4 months ago
2008
IEEE
In this paper we consider parity games defined by higher-order pushdown automata. These automata generalise pushdown automata by the use of higher-order stacks, which are nested ...
MFCS
2004
Springer
14 years 3 months ago
2004
Springer
We consider infinite antagonistic games over finite graphs. We present conditions that, whenever satisfied by the payoff mapping, assure for both players positional (memoryless...
SAGT
2010
Springer
13 years 8 months ago
2010
Springer
SOFSEM
2012
Springer
12 years 5 months ago
2012
Springer
In automated synthesis, we transform a specification into a system that is guaranteed to satisfy the specification against all environments. While modelchecking theory has led to...
COCOON
2008
Springer
13 years 11 months ago
2008
Springer
We analyze the complexity of equilibria problems for a class of strategic zero-sum games, called Angel-Daemon games. Those games were introduced to asses the goodness of a web or g...