A short proof of correctness of the quasi-polynomial time algorithm for parity games
Formal Languages and Automata Theory
2017-04-25 v4 Computer Science and Game Theory
Abstract
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.
Keywords
Cite
@article{arxiv.1702.01953,
title = {A short proof of correctness of the quasi-polynomial time algorithm for parity games},
author = {Hugo Gimbert and Rasmus Ibsen-Jensen},
journal= {arXiv preprint arXiv:1702.01953},
year = {2017}
}