9 citations · 9 across the 1 of their papers we have counts for
3 papers
Priority Promotion with Parysian Flair
Massimo Benerecetti, Daniele Dell'Erba, Fabio Mogavero +2
We develop an algorithm that combines the advantages of priority promotion - one of the leading approaches to solving large parity games in practice - with the quasi-polynomial tim…
Solving Mean-Payoff Games via Quasi Dominions
Massimo Benerecetti, Daniele Dell'Erba, Fabio Mogavero
We propose a novel algorithm for the solution of mean-payoff games that merges together two seemingly unrelated concepts introduced in the context of parity games, small progress m…
Robust Exponential Worst Cases for Divide-et-Impera Algorithms for Parity Games
Massimo Benerecetti, Daniele Dell'Erba, Fabio Mogavero
The McNaughton-Zielonka divide et impera algorithm is the simplest and most flexible approach available in the literature for determining the winner in a parity game. Despite its t…