44 search results - page 1 / 9 » The Complexity of Winning Strategies in Infinite Games |
DAGSTUHL
2010
12 years 11 months ago
2010
FSTTCS
1994
Springer
13 years 9 months ago
1994
Springer
Abstract. This paper surveys work on the synthesis of reactive programs which implement winning strategies in infinite two-person games. The representation of such games by Muller ...
DAM
2008
13 years 4 months ago
2008
We define an infinite class of 2-pile subtraction games, where the amount that can be subtracted from both piles simultaneously is an extended Boolean function f of the size of th...
LICS
1997
IEEE
13 years 8 months ago
1997
IEEE
We consider a class of infinite two-player games on finitely coloured graphs. Our main question is: given a winning condition, what is the inherent blow-up (additional memory) of ...
STOC
2001
ACM
14 years 5 months ago
2001
ACM
We consider two-player games played for an infinite number of rounds, with -regular winning conditions. The games may be concurrent, in that the players choose their moves simulta...