Positional Determinacy of Games with Infinitely Many Priorities

DOI10.2168/LMCS-2(4:6)2006MaRDI QIDQ5310671zbMATH OpenOpenAlexFDO

Authors Erich Grädel, Igor Walukiewicz

Publication date 11 October 2007

Published in Logical Methods in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.2168/lmcs-2(4:6)2006

Mathematics Subject Classification ID

2-person games (91A05) Games involving graphs (91A43)

Recommendations

• STACS 2004
• Computer Science Logic
• Half-Positional Determinacy of Infinite Games
• On the positional determinacy of edge-labeled games
• Omega-Regular Half-Positional Winning Conditions

Cited in

(16)

• Hybrid logic meets IF modal logic
• Memoryless determinacy of infinite parity games: another simple proof
• Game-theoretic semantics for \(\mathrm{ATL}^+\) with applications to model checking
• Characterizations of solutions for games with precedence constraints
• From winning strategy to Nash equilibrium
• The Descriptive Complexity of Parity Games
• Half-Positional Determinacy of Infinite Games
• Omega-Regular Half-Positional Winning Conditions
• Topological extension of parity automata
• Computer Science Logic
• STACS 2004
• Computer Science Logic
• Characterizing omega-regularity through finite-memory determinacy of games on infinite graphs
• Characterizing positionality in games of Infinite duration over infinite graphs
• Characterizing positionality in games of infinite duration over infinite graphs
• On the positional determinacy of edge-labeled games

This page was built for publication: Positional Determinacy of Games with Infinitely Many Priorities

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5310671)