Tropical linear-fractional programming and parametric mean payoff games

From MaRDI portal
Publication:435971

DOI10.1016/J.JSC.2011.12.049zbMATH Open1270.90081arXiv1101.3431OpenAlexW2088418904MaRDI QIDQ435971FDOQ435971


Authors: Stéphane Gaubert, Ricardo D. Katz, Sergey M. Sergeev Edit this on Wikidata


Publication date: 13 July 2012

Published in: Journal of Symbolic Computation (Search for Journal in Brave)

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.


Full work available at URL: https://arxiv.org/abs/1101.3431




Recommendations




Cites Work


Cited In (27)





This page was built for publication: Tropical linear-fractional programming and parametric mean payoff games

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q435971)