Potential theory for mean payoff games
The paper presents an O(mn2nlog Z) deterministic algorithm for solving the mean payoff game problem, m and n being the numbers of arcs and vertices, respectively, in the game graph, and Z being the maximum weight (the weights are assumed to be integers). The theoretical basis for the algorithm is the potential theory for mean payoff games. This theory allows one to restate the problem in terms of solving systems of algebraic equations with minima and maxima. Also, in order to solve the mean payoff game problem, the arc reweighting technique is used. To this end, simple modifications, which do not change the set of winning strategies, are applied to the game graph; in the end, a trivial instance of the problem is obtained. It is shown that any game graph can be simplified by n reweightings. Bibliography: 16 titles.
Unable to display preview. Download preview PDF.
- 2.H. Björklund, S. Sandberg, and S. Vorobyov, “A combinatorial strongly subexponential strategy improvement algorithm for mean payoff games,” DIMACS Tech. Rep., No. 5 (2004).Google Scholar
- 9.M. Jurdziński, “Small progress measures for solving parity games,” in: Proceedings of the 17th Annual Symposium on Theoretical Aspects of Computer Science, H. Reichel and S. Tison, eds. (Lect. Notes Comp. Sci., 1770), Springer-Verlag, 2000, pp. 290–301.Google Scholar
- 10.M. Jurdziński, M. Paterson, and U. Zwick, “A deterministic subexponential algorithm for solving parity games,” in: Proceedings of the ACM-SIAM Symposium on Discrete Algorithms (2006), pp. 117–123.Google Scholar
- 11.H. Klauck, “Algorithms for parity games,” in: Automata, Logics, and Infinite Games, E. Grädel et al., eds. (Lect. Notes Comp. Sci., 2500), Springer-Verlag, 2002, pp. 107–129.Google Scholar