Strategy derivation for small progress measures

M.W. Gazda, T.A.C. Willemse

Research output: Book/ReportReportAcademic

50 Downloads (Pure)


Small Progress Measures is one of the most efficient parity game solving algorithms. The original algorithm provides the full solution (winning regions and strategies) in $O(dm \cdot (n/ \lceil d/2 \rceil)^{\lceil d/2 \rceil} )$ time, and requires a re-run of the algorithm on one of the winning regions. We provide a novel operational interpretation of progress measures, and modify the algorithm so that it derives the winning strategies for both players in one pass. This reduces the upper bound on strategy derivation for SPM to $O(dm \cdot (n/ \lceil d/2 \rceil)^{\lceil d/2 \rceil} )$.
Original languageEnglish
Number of pages33
Publication statusPublished - 2014

Publication series

Volume1407.2149 [cs.LO]


Dive into the research topics of 'Strategy derivation for small progress measures'. Together they form a unique fingerprint.

Cite this