Solving Streett and Emerson-Lei Games with Universal Trees

Daniel Hausmann, Marcin Jurdzinski, Nir Piterman

Nearly a decade ago, Calude et al. showed that parity games can be solved in quasi-polynomial time. This result is now understood in terms of universal trees. By reduction to parit…