Sciweavers

1503 search results - page 4 / 301
» Generalized Parity Games
Sort
View
ENTCS
2002
110views more  ENTCS 2002»
13 years 8 months ago
Uniform Solution of Parity Games on Prefix-Recognizable Graphs
Walukiewicz gave in 1996 a solution for parity games on pushdown graphs: he proved the existence of pushdown strategies and determined the winner with an EXPTIME procedure. We giv...
Thierry Cachat
CALCO
2009
Springer
176views Mathematics» more  CALCO 2009»
14 years 3 months ago
Complementation of Coalgebra Automata
Abstract. Coalgebra automata, introduced by the second author, generalize the well-known automata that operate on infinite words/streams, trees, graphs or transition systems. This...
Christian Kissig, Yde Venema
AAAI
2012
11 years 11 months ago
HyperPlay: A Solution to General Game Playing with Imperfect Information
General Game Playing is the design of AI systems able to understand the rules of new games and to use such descriptions to play those games effectively. Games with imperfect infor...
Michael John Schofield, Timothy Joseph Cerexhe, Mi...
FM
2008
Springer
148views Formal Methods» more  FM 2008»
13 years 10 months ago
Precise Interval Analysis vs. Parity Games
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...
Thomas Gawlitza, Helmut Seidl
ISAAC
2009
Springer
169views Algorithms» more  ISAAC 2009»
14 years 3 months ago
The Complexity of Solving Stochastic Games on Graphs
We consider some well-known families of two-player zero-sum perfect-information stochastic games played on finite directed graphs. Generalizing and unifying results of Liggett and...
Daniel Andersson, Peter Bro Miltersen