• Corpus ID: 238582920

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

  title={The GKK Algorithm is the Fastest over Simple Mean-Payoff Games},
  author={Pierre Ohlmann},
We study the algorithm of Gurvich, Karzanov and Khachyian (GKK algorithm) when it is ran over mean-payoff games with no simple cycle of weight zero. We propose a new symmetric analysis, lowering the O(n2N) upper-bound of Pisaruk on the number of iterations down to N+E+ +E−+1 ≤ nN + 1, where n is the number of vertices, N is the largest absolute value of a weight, and E+ and E− are respectively the largest finite energy and dual-energy values of the game. Since each iteration is computed in O(m… 

Figures from this paper


Value Iteration Using Universal Graphs and the Complexity of Mean Payoff Games
It is shown that the linear dependence in the exponent in the number k of weights implies that universal graphs do not yield a quasipolynomial time algorithm for solving mean payoff games, implying that tight bounds on the complexity of algorithms formean payoff games using universal graphs are proved.
A Faster Deterministic Exponential Time 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, and is currently the fastest deterministic algorithm for Energy Games and Mean Payoff Games.
Deciding parity games in quasipolynomial time
It is shown that the parity game can be solved in quasipolynomial time and it is proven that coloured Muller games with n nodes and m colours can be decided in time O((mm · n)5); it is also shown that this bound cannot be improved to O((2m · n), for any c, unless FPT = W[1].
Faster algorithms for mean-payoff games
A new pseudopolynomial algorithm is presented for solving two-player games played on a weighted graph with mean-payoff objective and with energy constraints, improving the best known worst-case complexity for pseudopoly Nominal mean- payoff algorithms.
Improved Pseudo-polynomial Bound for the Value Problem and Optimal Strategy Synthesis in Mean Payoff Games
This work offers an O(|V|^2 |E|\, W) pseudo-polynomial time deterministic algorithm for solving the Value Problem and Optimal Strategy Synthesis in Mean Payoff Games and a description of optimal positional strategies in terms of reweighted Energy Games and Small Energy-Progress Measures.
Infinite Runs in Weighted Timed Automata with Energy Constraints
This work considers automata equipped with positive and negative weights on transitions and locations, corresponding to the production and consumption of some resource, and asks the question whether there exists an infinite path for which the accumulated weight for any finite prefix satisfies certain constraints.
Tree automata, mu-calculus and determinacy
  • E. Emerson, C. Jutla
  • Mathematics, Computer Science
    [1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science
  • 1991
It is shown that the propositional mu-calculus is equivalent in expressive power to finite automata on infinite trees, which provides a radically simplified, alternative proof of M.O. Rabin's (1989) complementation lemma for tree automata, which is the heart of one of the deepest decidability results.