Authors
Eryk Kopczyński
Publication date
2007
Conference
Computer Science Logic: 21st International Workshop, CSL 2007, 16th Annual Conference of the EACSL, Lausanne, Switzerland, September 11-15, 2007. Proceedings 21
Pages
41-53
Publisher
Springer Berlin Heidelberg
Description
We study infinite games where one of the players always has a positional (memory-less) winning strategy, while the other player may use a history-dependent strategy. We investigate winning conditions which guarantee such a property for all arenas, or all finite arenas. Our main result is that this property is decidable in single exponential time for a given prefix independent ω-regular winning condition. We also exhibit a big class of winning conditions (XPS) which has this property.
Total citations
2008200920102011201220132014201520162017201820192020202120222023202412121223
Scholar articles
E Kopczyński - Computer Science Logic: 21st International Workshop …, 2007