scholarly journals Solving Mean-Payoff Games via Quasi Dominions

Author(s):  
Daniele Dell'Erba
2012 ◽  
Vol 23 (03) ◽  
pp. 585-608 ◽  
Author(s):  
LUBOŠ BRIM ◽  
JAKUB CHALOUPKA

We design a novel algorithm for solving Mean-Payoff Games (MPGs). Besides solving an MPG in the usual sense, our algorithm computes more information about the game, information that is important with respect to applications. The weights of the edges of an MPG can be thought of as a gained/consumed energy – depending on the sign. For each vertex, our algorithm computes the minimum amount of initial energy that is sufficient for player Max to ensure that in a play starting from the vertex, the energy level never goes below zero. Our algorithm is not the first algorithm that computes the minimum sufficient initial energies, but according to our experimental study it is the fastest algorithm that computes them. The reason is that it utilizes the strategy improvement technique which is very efficient in practice.


2007 ◽  
Vol 145 (3) ◽  
pp. 4967-4974 ◽  
Author(s):  
Y. M. Lifshits ◽  
D. S. Pavlov

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

2014 ◽  
Vol 24 (4) ◽  
pp. 2096-2117 ◽  
Author(s):  
Xavier Allamigeon ◽  
Pascal Benchimol ◽  
Stéphane Gaubert ◽  
Michael Joswig

1979 ◽  
Vol 8 (2) ◽  
pp. 109-113 ◽  
Author(s):  
A. Ehrenfeucht ◽  
J. Mycielski

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.


2008 ◽  
Vol 106 (1) ◽  
pp. 1-7 ◽  
Author(s):  
Krishnendu Chatterjee ◽  
Thomas A. Henzinger

Sign in / Sign up

Export Citation Format

Share Document