A short proof of correctness of the quasi-polynomial time algorithm for parity games

Hugo Gimbert (1) , Rasmus Ibsen-Jensen (2)

1 LaBRI - Laboratoire Bordelais de Recherche en Informatique
2 IST Austria - Institute of Science and Technology [Klosterneuburg, Austria]

Recently Cristian S. Calude, Sanjay Jain, Bakhadyr Khoussainov, Wei Li and Frank Stephan proposed a quasi-polynomial time algorithm for parity games. This paper proposes a short proof of correctness of their algorithm.

Mots clés: Parity games

Domaines: Théorie et langage formel [cs.FL]; Informatique et théorie des jeux [cs.GT]

Hugo Gimbert, Rasmus Ibsen-Jensen. A short proof of correctness of the quasi-polynomial time algorithm for parity games. 2017. ⟨hal-01457996v3⟩