Memoryless Determinacy of Infinite Parity Games: Another Simple Proof

21 Nov 2018 Roux Stephane Le

In 1998 Zielonka simplified the proofs of memoryless determinacy of infinite parity games. In 2018 Haddad simplified some proofs of memoryless determinacy of finite parity games... (read more)

PDF Abstract
No code implementations yet. Submit your code now

Categories


  • COMPUTER SCIENCE AND GAME THEORY
  • LOGIC IN COMPUTER SCIENCE

Datasets


  Add Datasets introduced or used in this paper