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.
Research supported by the grants from the Swedish Scientific Council and the Foundation for International Cooperation in Research
and Higher Education.