An Ordered Approach to Solving Parity Games in Quasi Polynomial Time and Quasi Linear Space.



Fearnley, John, Jain, Sanjay, Schewe, Sven ORCID: 0000-0002-9093-9518, Stephan, Frank and Wojtczak, Dominik ORCID: 0000-0001-5560-0546
(2017) An Ordered Approach to Solving Parity Games in Quasi Polynomial Time and Quasi Linear Space. CoRR, abs/17.

[img] Text
CoRR.pdf - Submitted version

Download (346kB)

Abstract

Parity games play an important role in model checking and synthesis. In their paper, Calude et al. have shown that these games can be solved in quasi-polynomial time. We show that their algorithm can be implemented efficiently: we use their data structure as a progress measure, allowing for a backward implementation instead of a complete unravelling of the game. To achieve this, a number of changes have to be made to their techniques, where the main one is to add power to the antagonistic player that allows for determining her rational move without changing the outcome of the game. We provide a first implementation for a quasi-polynomial algorithm, test it on small examples, and provide a number of side results, including minor algorithmic improvements, a quasi bi-linear complexity in the number of states and edges for a fixed number of colours, and matching lower bounds for the algorithm of Calude et al.

Item Type: Article
Uncontrolled Keywords: cs.LO, cs.LO
Depositing User: Symplectic Admin
Date Deposited: 16 Aug 2018 08:27
Last Modified: 19 Jan 2023 01:30
Related URLs:
URI: https://livrepository.liverpool.ac.uk/id/eprint/3023722