Omega-regular half-positional winning conditions

Authors:
Eryk Kopczyński
Affiliations:
Institute of Informatics, Warsaw University
Venue:
CSL'07/EACSL'07 Proceedings of the 21st international conference, and Proceedings of the 16th annuall conference on Computer Science Logic
Year:
2007

Citing 6
Cited 2

Tree automata, Mu-Calculus and determinacy

SFCS '91 Proceedings of the 32nd annual symposium on Foundations of computer science
Infinite games on finitely coloured graphs with applications to automata on infinite trees

Theoretical Computer Science
Automata logics, and infinite games: a guide to current research

Automata logics, and infinite games: a guide to current research
Games where you can play optimally without any memory

CONCUR 2005 - Concurrency Theory
On the positional determinacy of edge-labeled games

Theoretical Computer Science
Half-Positional determinacy of infinite games

ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part II

Exploring the boundary of half positionality

CLIMA'10 Proceedings of the 11th international conference on Computational logic in multi-agent systems
Exploring the boundary of half-positionality

Annals of Mathematics and Artificial Intelligence

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.