Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

25

DAGSTUHL
2010

favoriteEmaildiscussreport

92views Software Engineering» more DAGSTUHL 2010»

The Complexity of Winning Strategies in Infinite Games

13 years 5 months ago

The Complexity of Winning Strategies in Infinite Games

Download www-i7.informatik.rwth-aachen.de

Michael Holtmann

Real-time Traffic

DAGSTUHL 2010 | Software Engineering |

claim paper

Related Content

» FiniteState Strategies in Regular Infinite Games

» Games played by Boole and Galois

» How Much Memory is Needed to Win Infinite Games

» Quantitative solution of omegaregular games

» Positional Determinacy of Games with Infinitely Many Priorities

» Permissive strategies from parity games to safety games

» On the Complexity of Computing Winning Strategies for Finite Poset Games

» Parametrized Regular Infinite Games and HigherOrder Pushdown Strategies

» Degrees of Lookahead in Regular Infinite Games

Post Info
More Details (n/a)

Added	14 May 2011
Updated	14 May 2011
Type	Journal
Year	2010
Where	DAGSTUHL
Authors	Michael Holtmann

Comments (0)