23 search results - page 1 / 5 » On the Complexity of Computing Winning Strategies for Finite... |
MST
2011
12 years 12 months ago
2011
This paper is concerned with the complexity of computing winning strategies for poset games. While it is reasonably clear that such strategies can be computed in PSPACE, we give a ...
ITA
2002
13 years 4 months ago
2002
It is proposed to compare strategies in a parity game by comparing the sets of behaviours they allow. For such a game, there may be no winning strategy that encompasses all the be...
DIMACS
1996
13 years 6 months ago
1996
in Structure'95. 14] R. Fagin. Easier ways to win logical games. In Proc. DIMACS Workshop on Descriptive Complexity and Finite Models, AMS 1997. 15] R. Fagin, L. Stockmeyer, M...
ACL
2011
12 years 8 months ago
2011
This paper presents a novel approach for leveraging automatically extracted textual knowledge to improve the performance of control applications such as games. Our ultimate goal i...
CORR
2008
Springer
13 years 5 months ago
2008
Springer
We consider games played on finite graphs, whose goal is to obtain a trace belonging to a given set of winning traces. We focus on those states from which Player 1 cannot force a w...