7 search results - page 1 / 2 » Memory Reduction for Strategies in Infinite Games |
WIA
2007
Springer
13 years 11 months ago
2007
Springer
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 ...
CORR
2006
Springer
13 years 4 months ago
2006
Springer
We study two-player games of infinite duration that are played on finite or infinite game graphs. A winning strategy for such a game is positional if it only depends on the current...
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...
FSTTCS
2008
Springer
13 years 5 months ago
2008
Springer
We consider an extension of Church’s synthesis problem to ordinals by adding limit transitions to graph games. We consider game arenas where these limit transitions are defined...