mean payoff games
Recently Published Documents


TOTAL DOCUMENTS

52
(FIVE YEARS 1)

H-INDEX

11
(FIVE YEARS 0)



Author(s):  
Massimo Benerecetti ◽  
Daniele Dell’Erba ◽  
Fabio Mogavero

Abstract We propose a novel algorithm for the solution of mean-payoff games that merges together two seemingly unrelated concepts introduced in the context of parity games, small progress measures and quasi dominions. We show that the integration of the two notions can be highly beneficial and significantly speeds up convergence to the problem solution. Experiments show that the resulting algorithm performs orders of magnitude better than the asymptotically-best solution algorithm currently known, without sacrificing on the worst-case complexity.



2018 ◽  
Vol 35 (05) ◽  
pp. 1850035
Author(s):  
S. K. Neogy ◽  
Prasenjit Mondal ◽  
Abhijit Gupta ◽  
Debasish Ghorui

Two classical pivoting algorithms, due to Lemke and Cottle–Dantzig, are studied on linear complementarity problems (LCPs) and their generalizations that arise from infinite duration two-person mean payoff games (MPGs) under zero-mean partition problem. Lemke’s algorithm was studied in solving MPGs via reduction to discounted payoff games or to simple stochastic games. We provide an alternative and efficient approach for studying the LCPs arising from the MPGs without any reduction. A binary MPG can easily be formulated as an LCP which has always terminated in a complementary solution in numerical experiments, but has not yet been proven either the processability of MPG’s by Lemke’s algorithm or a counter example that it will not terminate with a solution. Till now, the processability of MPG’s by Lemke’s algorithm remains open. A general MPG (with arbitrary outgoing arcs) naturally reduces to a generalized linear complementarity problem (GLCP) involving a rectangular matrix where the vertices are represented by the columns and the outgoing arcs from each vertex are represented by rows in a particular block. The noteworthy result in this paper is that the GLCP obtained from an MPG is processable by Cottle–Dantzig principal pivoting algorithm which terminates with a solution. Several properties of the matrix which arise in this context are also discussed.



2018 ◽  
Vol 735 ◽  
pp. 82-110 ◽  
Author(s):  
Paul Hunter ◽  
Arno Pauly ◽  
Guillermo A. Pérez ◽  
Jean-François Raskin




10.29007/jcrz ◽  
2018 ◽  
Author(s):  
Stephane Gaubert ◽  
Ricardo Katz ◽  
Sergei Sergeev

Tropical polyhedra have been recently used to represent disjunctive invariants in static analysis. To handle larger instances, the tropical analogues of classical linear programming results need to be developed. This motivation leads us to study a general tropical linear 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. In other words, strategies play in tropical linear programming the role of Lagrange multipliers in classical linear programming. We use this idea to design a Newton-like algorithm to solve tropical linear programming problems, by reduction to a sequence of auxiliary mean payoff game problems.



Algorithmica ◽  
2017 ◽  
Vol 80 (11) ◽  
pp. 3132-3157
Author(s):  
Endre Boros ◽  
Khaled Elbassioni ◽  
Mahmoud Fouz ◽  
Vladimir Gurvich ◽  
Kazuhisa Makino ◽  
...  




2017 ◽  
Vol 675 ◽  
pp. 101-104
Author(s):  
Marcello Mamino


Sign in / Sign up

Export Citation Format

Share Document