Memoryless Determinacy of Infinite Parity Games: Another Simple Proof
Computer Science and Game Theory
2018-11-26 v2 Logic in Computer Science
Abstract
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.
Cite
@article{arxiv.1803.00655,
title = {Memoryless Determinacy of Infinite Parity Games: Another Simple Proof},
author = {Stephane Le Roux},
journal= {arXiv preprint arXiv:1803.00655},
year = {2018}
}
Comments
10 pages, 6 figures