We prove the existence of a pseudo-polynomial time algorithm for the Value Problem and Optimal Strategy Synthesis in Mean Payoff Games. This improves by a factor the best previously known pseudo-polynomial upper bound due to Brim et al. (2011). The improvement hinges on a suitable characterization of values and optimal strategies in terms of reweightings.
Download link: manuscript.