2021
DOI: 10.48550/arxiv.2108.13338
|View full text |Cite
Preprint
|
Sign up to set email alerts
|

Beyond Value Iteration for Parity Games: Strategy Iteration with Universal Trees

Abstract: Parity games have witnessed several new quasi-polynomial algorithms since the breakthrough result of Calude et al. (2017). The central combinatorial object underlying these approaches is a universal tree, as identified by Czerwiński et al. (2019). By providing a quasi-polynomial lower bound on the size of universal trees, they have highlighted a barrier that must be overcome by all existing approaches to attain polynomial runtime. This is due to the existence of worst case instances which force these algorithm… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...

Citation Types

0
0
0

Publication Types

Select...

Relationship

0
0

Authors

Journals

citations
Cited by 0 publications
references
References 29 publications
0
0
0
Order By: Relevance

No citations

Set email alert for when this publication receives citations?