@inproceedings{bb3bda4366b14c23b7aab7c3ba3b4f84,
title = "A faster deterministic exponential time algorithm for energy games and mean payoff games",
abstract = "We present an improved exponential time algorithm for Energy Games, and hence also for Mean Payoff Games. The running time of the new algorithm is O min mnW, mn2n/2 log W, where n is the number of vertices, m is the number of edges, and when the edge weights are integers of absolute value at most W. For small values of W, the algorithm matches the performance of the pseudopolynomial time algorithm of Brim et al. on which it is based. For W ≥ n2n/2, the new algorithm is faster than the algorithm of Brim et al. and is currently the fastest deterministic algorithm for Energy Games and Mean Payoff Games. The new algorithm is obtained by introducing a technique of forecasting repetitive actions performed by the algorithm of Brim et al., along with the use of an edge-weight scaling technique.",
keywords = "Energy Games, Mean Payoff Games, Scaling",
author = "Dani Dorfman and Haim Kaplan and Uri Zwick",
note = "Publisher Copyright: {\textcopyright} Dani Dorfman, Haim Kaplan, and Uri Zwick; licensed under Creative Commons License CC-BY; 46th International Colloquium on Automata, Languages, and Programming, ICALP 2019 ; Conference date: 09-07-2019 Through 12-07-2019",
year = "2019",
month = jul,
day = "1",
doi = "10.4230/LIPIcs.ICALP.2019.114",
language = "الإنجليزيّة",
series = "Leibniz International Proceedings in Informatics, LIPIcs",
publisher = "Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing",
editor = "Christel Baier and Ioannis Chatzigiannakis and Paola Flocchini and Stefano Leonardi",
booktitle = "46th International Colloquium on Automata, Languages, and Programming, ICALP 2019",
address = "ألمانيا",
}