Tropicalizing Semialgebraic Pivoting Rules, Or How to Solve Mean Payoff Games in Polynomial Time on Average - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2015

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

Abstract

We 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.
No file

Dates and versions

hal-01263357 , version 1 (27-01-2016)

Identifiers

  • HAL Id : hal-01263357 , version 1

Cite

Xavier Allamigeon, Pascal Benchimol, Stephane Gaubert. Tropicalizing Semialgebraic Pivoting Rules, Or How to Solve Mean Payoff Games in Polynomial Time on Average. SIAM Conference on Control and its Applications (SIAM CT’15), Jul 2015, Paris, France. ⟨hal-01263357⟩
296 View
0 Download

Share

Gmail Facebook X LinkedIn More