Memoryless Determinacy of Finite Parity Games: Another Simple Proof - Archive ouverte HAL Access content directly
Journal Articles Information Processing Letters Year : 2018

Memoryless Determinacy of Finite Parity Games: Another Simple Proof

(1, 2, 3)
1
2
3

Abstract

Memoryless determinacy of (infinite) parity games is an important result with numerous applications. It was first independently established by Emerson and Jutla [1] and Mostowski [2] but their proofs involve elaborate developments. The elegant and simpler proof of Zielonka [3] still requires a nested induction on the finite number of priorities and on ordinals for sets of vertices. There are other proofs for finite games like the one of Björklund, Sandberg and Vorobyovin [4] that relies on relating infinite and finite duration games. We present here another simple proof that finite parity games are determined with memoryless strategies using induction on the number of relevant states. The closest proof that relies on induction over non absorbing states is the one of Grädel [5]. However instead of focusing on a single appropriate vertex for induction as we do here, he considers two reduced games per vertex, for all the vertices of the game. The idea of reasoning about a single state has been inspired to me by the analysis of finite stochastic priority games by Karelovic and Zielonka [6].
Fichier principal
Vignette du fichier
main.pdf (248.34 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-01541508 , version 1 (19-06-2017)

Identifiers

  • HAL Id : hal-01541508 , version 1

Cite

Serge Haddad. Memoryless Determinacy of Finite Parity Games: Another Simple Proof. Information Processing Letters, 2018, 132, pp.3. ⟨hal-01541508⟩
262 View
309 Download

Share

Gmail Facebook Twitter LinkedIn More