Memoryless Determinacy of Parity Games
From MaRDI portal
Publication:4412829
DOI10.1007/3-540-36387-4_6zbMath1021.91501OpenAlexW1505720487MaRDI QIDQ4412829
Publication date: 16 July 2003
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/3-540-36387-4_6
2-person games (91A05) Games involving graphs (91A43) Formal languages and automata (68Q45) Determinacy principles (03E60)
Related Items (6)
Optimal constructions for active diagnosis ⋮ Parameterized Algorithms for Parity Games ⋮ The maker-breaker largest connected subgraph game ⋮ Refinement modal logic ⋮ Study of a combinatorial game in graphs through linear programming ⋮ Polynomial-Time Under-Approximation of Winning Regions in Parity Games
This page was built for publication: Memoryless Determinacy of Parity Games
