A Combinatorial Strongly Subexponential Strategy Improvement Algorithm for Mean Payoff Games

@article{Bjrklund2004ACS,
  title={A Combinatorial Strongly Subexponential Strategy Improvement Algorithm for Mean Payoff Games},
  author={Henrik Bj{\"o}rklund and Sven Sandberg and Sergei G. Vorobyov},
  journal={Discrete Applied Mathematics},
  year={2004},
  volume={155},
  pages={210-229}
}
We suggest the first strongly subexponential and purely combinatorial algorithm for solving the mean payoff games problem. It is based on iteratively improving the longest shortest distances to a sink in a possibly cyclic directed graph. We identify a new “controlled” version of the shortest paths problem. By selecting exactly one outgoing edge in each of the controlled vertices we want to make the shortest distances from all vertices to the unique sink as long as possible. Under reasonable… CONTINUE READING
Highly Influential
This paper has highly influenced a number of papers. REVIEW HIGHLY INFLUENTIAL CITATIONS