Skip to Main content Skip to Navigation
Conference papers

Combinatorial Simplex Algorithms Can Solve Mean Payoff Games

Abstract : A combinatorial simplex algorithm is an instance of the simplex method in which the pivoting depends on combinatorial data only. We show that any algorithm of this kind admits a tropical analogue which can be used to solve mean payoff games. Moreover, any combinatorial simplex algorithm with a strongly polynomial complexity (the existence of such an algorithm is open) would provide in this way a strongly polynomial algorithm solving mean payoff games (all the arithmetic operations being performed on data polynomially bounded in the size of the input, in particular). Mean payoff games are known to be in NP and co-NP; whether they can be solved in polynomial time is an open problem. Our algorithm relies on a tropical implementation of the simplex method over a real closed field of Hahn series. One of the key ingredients is a new scheme for symbolic perturbation which allows us to lift an arbitrary mean payoff game instance into a non-degenerate linear program over Hahn series.
Complete list of metadata
Contributor : Pascal Benchimol Connect in order to contact the contributor
Submitted on : Sunday, December 21, 2014 - 4:43:01 PM
Last modification on : Wednesday, February 2, 2022 - 3:58:10 PM


  • HAL Id : hal-01097727, version 1



Xavier Allamigeon, Pascal Benchimol, Stephane Gaubert, Michael Joswig. Combinatorial Simplex Algorithms Can Solve Mean Payoff Games. The 21st International Symposium on Mathematical Theory of Networks and Systems (MTNS 2014), Jul 2014, Groningen, Netherlands. ⟨hal-01097727⟩



Record views