On the positional determinacy of edge-labeled games

DOI10.1016/j.tcs.2005.10.046zbMath1138.91015OpenAlexW1993569943MaRDI QIDQ818128

Thomas Colcombet, Damian Niwinski

Publication date: 24 March 2006

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2005.10.046

zbMATH Keywords

parity gamespositional determinacywinning condition

Mathematics Subject Classification ID

Games involving graphs (91A43) Formal languages and automata (68Q45) Automata and formal grammars in connection with logical questions (03D05) Specification and verification (program logics, model checking, etc.) (68Q60)

Related Items (5)

Roulette games and depths of words over finite commutative rings ⋮ Continuous Positional Payoffs ⋮ Unnamed Item ⋮ Exploring the boundary of half-positionality ⋮ On Memoryless Quantitative Objectives

Cites Work

• Unnamed Item
• Positional strategies for mean payoff games
• Borel determinacy
• Infinite games on finitely coloured graphs with applications to automata on infinite trees
• Infinite games played on finite graphs
• Pushdown processes: Games and model-checking
• STACS 2004
• Stochastic Games

This page was built for publication: On the positional determinacy of edge-labeled games