Positional Determinacy of Games with Infinitely Many Priorities

DOI10.2168/LMCS-2(4:6)2006zbMath1126.91012OpenAlexW3101910935MaRDI QIDQ5310671

Igor Walukiewicz, Erich Grädel

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)

Related Items (6)

From winning strategy to Nash equilibrium ⋮ Topological extension of parity automata ⋮ Memoryless determinacy of infinite parity games: another simple proof ⋮ The Descriptive Complexity of Parity Games ⋮ Game-theoretic semantics for \(\mathrm{ATL}^+\) with applications to model checking ⋮ Hybrid logic meets IF modal logic

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