𝔖 Bobbio Scriptorium
✦   LIBER   ✦

From Parity Games to Circular Proofs

✍ Scribed by Luigi Santocanale

Publisher
Elsevier Science
Year
2002
Tongue
English
Weight
300 KB
Volume
65
Category
Article
ISSN
1571-0661

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Memoryless determinacy of parity and mea
Memoryless determinacy of parity and mean payoff games: a simple proof
✍ 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