Potential theory for mean payo games

@inproceedings{Lifshits2007PotentialTF,
  title={Potential theory for mean payo games},
  author={Yury Lifshits and Dmitri Pavlov},
  year={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

Citations

Publications citing this paper.
Showing 1-10 of 13 extracted citations

References

Publications referenced by this paper.
Showing 1-10 of 17 references

Combinatorial Optimization: Polyhedra and E ciency,

  • Alexander Schrijver
  • 2003
1 Excerpt

nski, \Small progress measures for solving parity games,

  • Marcin Jurdzi
  • Proceedings of 17th Annual Symposium on…
  • 2000
1 Excerpt

Cyclic games and an algorithm to nd minimax cycle means in directed graphs,

  • V. A. Gurvich, A. V. Karzanov, L. G. Khachiyan
  • USSR Computational Mathematics and Mathematical…
  • 1988
1 Excerpt

Similar Papers

Loading similar papers…