A longstanding open problem in computer science has been to show that parity games can be solved in polynomial time. In this talk, I will be presenting a quasipolynomial time algorithm due to Parys (2019) which is a modification of Zielonka's recursive algorithm (1998).
