TY - GEN

T1 - A faster deterministic exponential time algorithm for energy games and mean payoff games

AU - Dorfman, Dani

AU - Kaplan, Haim

AU - Zwick, Uri

N1 - Publisher Copyright:
© Dani Dorfman, Haim Kaplan, and Uri Zwick; licensed under Creative Commons License CC-BY

PY - 2019/7/1

Y1 - 2019/7/1

N2 - 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.

AB - 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.

KW - Energy Games

KW - Mean Payoff Games

KW - Scaling

UR - http://www.scopus.com/inward/record.url?scp=85069175970&partnerID=8YFLogxK

U2 - 10.4230/LIPIcs.ICALP.2019.114

DO - 10.4230/LIPIcs.ICALP.2019.114

M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???

AN - SCOPUS:85069175970

T3 - Leibniz International Proceedings in Informatics, LIPIcs

BT - 46th International Colloquium on Automata, Languages, and Programming, ICALP 2019

A2 - Baier, Christel

A2 - Chatzigiannakis, Ioannis

A2 - Flocchini, Paola

A2 - Leonardi, Stefano

PB - Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing

T2 - 46th International Colloquium on Automata, Languages, and Programming, ICALP 2019

Y2 - 9 July 2019 through 12 July 2019

ER -