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.

翻译：我们提出一种由Schewe提出并经Luttenberger研究的用于求解奇偶博弈或均值收益博弈算法的变体。我们将其应用于能量博弈，称该变体为ESL算法（Energy-Schewe-Luttenberger）。研究发现，采用Gurvich、Karzanov与Khachiyan所引入的势能约化方法，可使该算法的表述简洁而优雅。该算法反复应用Khachiyan、Gurvich与Zhao提出的Dijkstra算法在双人博弈场景下的自然推广。