activity
20162024
most citedRobust Exponential Worst Cases for Divide-et-Impera Algorithms for Parity Games

9 citations · 26 across the 9 of their papers we have counts for

collaborators
Showing cs.DSShow all

5 papers · 1 filter

cs.DS2024

An Objective Improvement Approach to Solving Discounted Payoff Games

Daniele Dell'Erba, Arthur Dumas, Sven Schewe

While discounted payoff games and classic games that reduce to them, like parity and mean-payoff games, are symmetric, their solutions are not. We have taken a fresh view on the pr…

cs.DS2023★ 1 cited

Errata to: "Faster Deterministic Exponential Time Algorithm for Energy Games and Mean Payoff Games"

Peter Austin, Daniele Dell'Erba

An improved exponential time algorithm for Energy Games and Mean Payoff Games has been recently proposed in ICALP 19. The new algorithm prevents some of the repetitive operations p…

cs.DS2023★ 1 cited

An Objective Improvement Approach to Solving Discounted Payoff Games

Daniele Dell'Erba, Arthur Dumas, Sven Schewe

While discounted payoff games and classic games that reduce to them, like parity and mean-payoff games, are symmetric, their solutions are not. We have taken a fresh view on the co…

cs.DS2022★ 5 cited

Smaller Progress Measures and Separating Automata for Parity Games

Daniele Dell'Erba, Sven Schewe

Calude et al. have recently shown that parity games can be solved in quasi-polynomial time, a landmark result that has led to a number of approaches with quasi-polynomial complexit…

cs.DS2021

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…