Exploring the boundary of half-positionality

DOI10.1007/s10472-011-9250-1zbMath1235.05093OpenAlexW2152165272MaRDI QIDQ656821

Marco Faella, Aniello Murano, Fabio Mogavero, Alessandro Bianco

Publication date: 13 January 2012

Published in: Annals of Mathematics and Artificial Intelligence (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10472-011-9250-1

zbMATH Keywords

games on graphsmemorysynthesis of controllerscondition for half positionalityefficient controllerspositional winning strategies

Mathematics Subject Classification ID

2-person games (91A05) Games involving graphs (91A43) Games on graphs (graph-theoretic aspects) (05C57)

Related Items (3)

Unnamed Item ⋮ Unnamed Item ⋮ First-cycle games

Cites Work

• Unnamed Item
• Unnamed Item
• On the positional determinacy of edge-labeled games
• Infinite games on finitely coloured graphs with applications to automata on infinite trees
• Infinite games played on finite graphs
• Module checking
• Half-Positional Determinacy of Infinite Games
• Omega-Regular Half-Positional Winning Conditions
• On the synthesis of strategies in infinite games
• CONCUR 2005 – Concurrency Theory

This page was built for publication: Exploring the boundary of half-positionality