Linear Programming Polytope and Algorithm for Mean Payoff Games

We investigate LP-polytopes generated by mean payoff games and their properties, including the existence of tight feasible solutions of bounded size. We suggest a new associated algorithm solving a linear program and transforming its solution into a solution of the game.

• Type: Conference
• Year: 2006
• Where: AAIM
• Authors: Ola Svensson, Sergei G. Vorobyov
• Keywords: AAIM 2006, Algorithms, Mean Payoff Games, Tight Feasible Solutions