Priority Promotion with Parysian flair

We develop an algorithm that combines the advantages of Priority Promotion, that is one of the leading approaches to solving large parity games in practice, with the quasi-polynomial time guarantees offered by Parys' algorithm. Hybridising these algorithms sounds both natural and difficult, as...

Full description

Saved in:

Bibliographic Details
Published in:	Journal of computer and system sciences Vol. 147; p. 103580
Main Authors:	Benerecetti, Massimo, Dell'Erba, Daniele, Mogavero, Fabio, Schewe, Sven, Wojtczak, Dominik
Format:	Journal Article
Language:	English
Published:	Elsevier Inc 01.02.2025
Subjects:	Parity games Quasi dominion Quasi polynomial algorithms Parity games Quasi dominion Quasi polynomial algorithms
ISSN:	0022-0000
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Description
Summary:	We develop an algorithm that combines the advantages of Priority Promotion, that is one of the leading approaches to solving large parity games in practice, with the quasi-polynomial time guarantees offered by Parys' algorithm. Hybridising these algorithms sounds both natural and difficult, as they both generalise the classic recursive algorithm in different ways that appear to be irreconcilable: while the promotion transcends the call structure, the guarantees change on each level. We show that an interface that respects both is not only effective, but also efficient.
ISSN:	0022-0000
DOI:	10.1016/j.jcss.2024.103580