Tropical linear-fractional programming and parametric mean payoff games
Preprint
Abstract
Tropical polyhedra have been recently used to represent disjunctive invariants in static analysis. To handle larger instances, tropical analogues of classical linear programming results need to be developed. This motivation leads us to study the tropical analogue of the classical linear-fractional programming problem. We construct an associated parametric mean payoff game problem, and show that the optimality of a given point, or the unboundedness of the problem, can be certified by exhibiting a strategy for one of the players having certain infinitesimal properties (involving the value of the game and its derivative) that we characterize combinatorially. We use this idea to design a Newton-like algorithm to solve tropical linear-fractional programming problems, by reduction to a sequence of auxiliary mean payoff game problems.Keywords
All Related Versions
This publication has 21 references indexed in Scilit:
- The level set method for the two-sided max-plus eigenproblemDiscrete Event Dynamic Systems, 2012
- The number of extreme points of tropical polyhedraJournal of Combinatorial Theory, Series A, 2011
- Max-linear Systems: Theory and Algorithms2010
- Hard problems in max-algebra, control theory, hypergraphs and other areasInformation Processing Letters, 2010
- The tropical analogue of polar conesLinear Algebra and its Applications, 2009
- A combinatorial strongly subexponential strategy improvement algorithm for mean payoff gamesDiscrete Applied Mathematics, 2007
- Duality and separation theorems in idempotent semimodulesLinear Algebra and its Applications, 2004
- The complexity of mean payoff games on graphsTheoretical Computer Science, 1996
- Cyclic games and an algorithm to find minimax cycle means in directed graphsUSSR Computational Mathematics and Mathematical Physics, 1988
- Positional strategies for mean payoff gamesInternational Journal of Game Theory, 1979