Memoryless determinacy of parity and mea
β
Henrik BjΓΆrklund; Sven Sandberg; Sergei Vorobyov
π
Article
π
2004
π
Elsevier Science
π
English
β 287 KB
We give a simple, direct, and constructive proof of memoryless determinacy for parity and mean payo games. First, we prove by induction that the ΓΏnite duration versions of these games, played until some vertex is repeated, are determined and both players have memoryless winning strategies. In contra