A Convex Programming-based Algorithm for Mean Payoff Stochastic Games with Perfect Information

Endre Boros, Khaled Elbassioni, Vladimir Gurvich +1

We consider two-person zero-sum stochastic mean payoff games with perfect information, or BWR-games, given by a digraph $G=(V,E)$, with local rewards $r: E \to \ZZ$, and three t…