# Potential theory for mean payo games

@inproceedings{Lifshits2007PotentialTF, title={Potential theory for mean payo games}, author={Yury Lifshits and Dmitri Pavlov}, year={2007} }

- Published 2007

We present an O(mn2n logZ) deterministic algorithm for solving the mean payo game problem, m and n being respectively the number of arcs and vertices in the game graph and Z being the maximum weight (we assume that the weights are integer numbers). The theoretical basis for the algorithm is the potential theory for mean payo games. This theory allows to restate the problem in terms of solving systems of algebraic equations with minima and maxima. Also we use arc reweighting technique to solve… CONTINUE READING