New Deterministic Algorithms for Solving Parity Games – University of Copenhagen

New Deterministic Algorithms for Solving Parity Games

Title: New Deterministic Algorithms for Solving Parity Games

Abstract: We study parity games in which one of the two players controls only a small number k of nodes and the other player controls the n − k other nodes of the game. Our main result is a fixed-parameter algorithm that solves bipartite parity games in time k^{O(\sqrt{k})} * O(n^3) and general parity games in time (p+k)^{O(\sqrt{k})} * O(pmn), where p denotes the number of distinct priorities and m denotes the number of edges. For all games with k = o(n) this improves the previously fastest algorithm by Jurdzinski, Paterson, and Zwick (SICOMP  2008). We also obtain novel kernelization results and an improved deterministic  algorithm for graphs with small average degree.

About the speaker:
Matthias Mnich's research interests include:

Combinatorial optimization
Scheduling
Social choice theory
Parameterized complexity
Discrete mathematics and
Phylogenetic networks