Linear programming polytope and algorithm for mean payoff games

Authors:
Ola Svensson;Sergei Vorobyov
Affiliations:
IDSIA, Istituto Dalle Molle di Studi sull'Intelligenza Artificiale, Lugano, Switzerland;Information Technology Department, Uppsala University, Sweden
Venue:
AAIM'06 Proceedings of the Second international conference on Algorithmic Aspects in Information and Management
Year:
2006

Citing 6
Cited 1

Theory of linear and integer programming

Theory of linear and integer programming
Cyclic games and an algorithm to find minimax cycle means in directed graphs

USSR Computational Mathematics and Mathematical Physics
The complexity of mean payoff games on graphs

Theoretical Computer Science
Mean Cost Cyclical Game

Mathematics of Operations Research
Combinatorial structure and randomized subexponential algorithms for infinite games

Theoretical Computer Science
A combinatorial strongly subexponential strategy improvement algorithm for mean payoff games

Discrete Applied Mathematics

Cyclic games and linear programming

Discrete Applied Mathematics

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.