A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is `application/pdf`

.

##
###
A combinatorial strongly subexponential strategy improvement algorithm for mean payoff games

2007
*
Discrete Applied Mathematics
*

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. The decision version

doi:10.1016/j.dam.2006.04.029
fatcat:6ecob37j55dz7mo4hn43fg6cse