DeepAI AI Chat
Log In Sign Up

On the ESL algorithm for solving energy games

by   Antonio Casares, et al.

We propose a variant of an algorithm introduced by Schewe and also studied by Luttenberger for solving parity or mean-payoff games. We present it over energy games and call our variant the ESL algorithm (for Energy-Schewe-Luttenberger). We find that using potential reductions as introduced by Gurvich, Karzanov and Khachiyan allows for a simple and elegant presentation of the algorithm, which repeatedly applies a natural generalisation of Dijkstra's algorithm to the two-player setting due to Khachiyan, Gurvich and Zhao.


page 1

page 2

page 3

page 4


A pseudo-quasi-polynomial algorithm for solving mean-payoff parity games

In a mean-payoff parity game, one of the two players aims both to achiev...

A Recursive Approach to Solving Parity Games in Quasipolynomial Time

Zielonka's classic recursive algorithm for solving parity games is perha...

Accelerating Energy Games Solvers on Modern Architectures

Quantitative games, where quantitative objectives are defined on weighte...

The operator approach to entropy games

Entropy games and matrix multiplication games have been recently introdu...

The GKK Algorithm is the Fastest over Simple Mean-Payoff Games

We study the algorithm of Gurvich, Khachyian and Karzanov (GKK algorithm...

Quantitative Reductions and Vertex-Ranked Infinite Games

We introduce quantitative reductions, a novel technique for structuring ...

Solving Mean-Payoff Games via Quasi Dominions

We propose a novel algorithm for the solution of mean-payoff games that ...