University of Leicester
1-s2.0-S0890540115000723-main.pdf (609.19 kB)

The Rabin Index of Parity Games: Its Complexity and Approximation

Download (609.19 kB)
journal contribution
posted on 2015-05-07, 10:39 authored by M. Huth, J. H-P. Kuo, Nir Piterman
We study the descriptive complexity of parity games by taking into account the coloring of their game graphs whilst ignoring their ownership structure. Colorings of game graphs are identified if they determine the same winning regions and strategies, for all ownership structures of nodes. The Rabin index of a parity game is the minimum of the maximal color taken over all equivalent coloring functions. We show that deciding whether the Rabin index is at least k is in P for k = 1 but NP-hard for all fixed k>=2. We present an EXPTIME algorithm that computes the Rabin index by simplifying its input coloring function. When replacing simple cycle with cycle detection in that algorithm, its output over-approximates the Rabin index in polynomial time. We evaluate this efficient algorithm as a preprocessor of solvers in detailed experiments: for Zielonka’s solver [17] on random and structured parity games and for the partial solver psolB [11] on random games.



Information and Computation Volume 245, December 2015, Pages 36–53

Author affiliation

/Organisation/COLLEGE OF SCIENCE AND ENGINEERING/Department of Computer Science

Published in

Information and Computation Volume 245


Elsevier for Academic Press



Available date


Publisher version