Memoryless Determinacy of Parity Games

DOI10.1007/3-540-36387-4_6MaRDI QIDQ4412829zbMATH OpenOpenAlexFDO

Authors Ralf Küsters

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

Mathematics Subject Classification ID

Determinacy principles (03E60) Formal languages and automata (68Q45) 2-person games (91A05) Games involving graphs (91A43)

Recommendations

• Memoryless determinacy of parity and mean payoff games: a simple proof
• Memoryless determinacy of infinite parity games: another simple proof
• Memoryless determinacy of finite parity games: another simple proof
• Infinite Games
• Algorithms for Parity Games

Cited in

(15)

• Memoryless determinacy of finite parity games: another simple proof
• Memoryless determinacy of infinite parity games: another simple proof
• Memoryless determinacy of parity and mean payoff games: a simple proof
• Study of a combinatorial game in graphs through linear programming
• The maker-breaker largest connected subgraph game
• Parameterized Algorithms for Parity Games
• Optimal constructions for active diagnosis
• Derandomized parallel repetition theorems for free games
• Infinite Games
• Refinement modal logic
• Fatal Attractors in Parity Games
• Polynomial-time under-approximation of winning regions in parity games
• Foundations of Software Science and Computation Structures
• Solving odd-fair parity games
• Positional Determinacy of Parity Games

This page was built for publication: Memoryless Determinacy of Parity Games

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