2018/03/01 by Stéphane Le Roux, Stephane Le Roux, Roux, Stephane Le
Computer Science · #Computer Science and Game Theory (cs.GT) #FOS: Computer and information sciences #Formal Methods in Verification #Logic in Computer Science (cs.LO) #Logic, programming, and type systems #Polynomial and algebraic computation #cs.GT #cs.LO
paper · pdf · doi:10.48550/arxiv.1803.00655
10 pages, 6 figures
openalex publication_date 2018/03/01 · openalex created_date 2018/03/29 · arxiv created 2018/11/21 · arxiv updated 2018/11/26 · openalex updated_date 2026/07/28
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. This article adapts Haddad's technique for infinite parity games. Two proofs are given, a shorter one and a more constructive one. None of them uses Zielonka's traps and attractors.