44 search results - page 4 / 9 » The Complexity of Winning Strategies in Infinite Games |
ENTCS
2010
13 years 6 months ago
2010
We present MLSolver, a tool for solving the satisfiability and validity problems for modal fixpoint logics. The underlying technique is based on characterisations of satisfiabilit...
STACS
2004
Springer
14 years 2 months ago
2004
Springer
An Active Context-Free Game is a game with two players (Romeo and Juliet) on strings over a finite alphabet. In each move, Juliet selects a position of the current word and Romeo ...
FSTTCS
2008
Springer
13 years 10 months ago
2008
Springer
We survey determinacy, definability, and complexity issues of Banach-Mazur games on finite and infinite graphs. Infinite games where two players take turns to move a token thro...
DIMACS
1996
13 years 10 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...
ACG
2003
Springer
14 years 2 months ago
2003
Springer
We define an infinite class of 2-pile subtraction games, where the amount that can be subtracted from both piles simultaneously, is a function f of the size of the piles. Wytho...