Tropicalizing Semialgebraic Pivoting Rules, Or How to Solve Mean Payoff Games in Polynomial Time on Average

Minisymposia "Complexity Issues in Control Computation and Max-Plus Methods"International audienceWe introduce an algorithm which solves mean payoff games in polynomial time on average, assuming the distribution of the games satisfies a flip invariance property on the set of actions associated with every state. The algorithm is a tropical analogue of the shadow-vertex simplex algorithm, which solves mean payoff games via linear feasibility problems over the tropical semiring. The proof relies on the observation that certain semi-algebraic pivoting rules can be tropicalized