DeepAI AI Chat
Log In Sign Up

On the ESL algorithm for solving energy games

10/14/2021
by   Antonio Casares, et al.
0

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.

READ FULL TEXT

page 1

page 2

page 3

page 4

03/13/2018

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...
04/20/2021

A Recursive Approach to Solving Parity Games in Quasipolynomial Time

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

Accelerating Energy Games Solvers on Modern Architectures

Quantitative games, where quantitative objectives are defined on weighte...
04/10/2019

The operator approach to entropy games

Entropy games and matrix multiplication games have been recently introdu...
10/09/2021

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

We study the algorithm of Gurvich, Khachyian and Karzanov (GKK algorithm...
09/10/2018

Quantitative Reductions and Vertex-Ranked Infinite Games

We introduce quantitative reductions, a novel technique for structuring ...
07/14/2019

Solving Mean-Payoff Games via Quasi Dominions

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