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...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Journal of computer and system sciences Ročník 147; s. 103580
Hlavní autoři: Benerecetti, Massimo, Dell'Erba, Daniele, Mogavero, Fabio, Schewe, Sven, Wojtczak, Dominik
Médium: Journal Article
Jazyk:angličtina
Vydáno: Elsevier Inc 01.02.2025
Témata:
Parity games
Quasi dominion
Quasi polynomial algorithms
Parity games
Quasi dominion
Quasi polynomial algorithms
ISSN:0022-0000
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí: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