Solving Mean-Payoff Games on the GPU

2016 ◽  
pp. 262-267 ◽  
Author(s):  
Philipp J. Meyer ◽  
Michael Luttenberger
Keyword(s):  
Mean Payoff Games ◽  
Mean Payoff

USING STRATEGY IMPROVEMENT TO STAY ALIVE

2012 ◽  
Vol 23 (03) ◽  
pp. 585-608 ◽  
Author(s):  
LUBOŠ BRIM ◽  
JAKUB CHALOUPKA
Keyword(s):  
Experimental Study ◽  
Energy Level ◽  
Initial Energy ◽  
Minimum Amount ◽  
Usual Sense ◽  
Mean Payoff Games ◽  
Mean Payoff ◽  
Novel Algorithm

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.

scholarly journals Potential theory for mean payoff games

2007 ◽  
Vol 145 (3) ◽  
pp. 4967-4974 ◽  
Author(s):  
Y. M. Lifshits ◽  
D. S. Pavlov
Keyword(s):  
Potential Theory ◽  
Mean Payoff Games ◽  
Mean Payoff

The complexity of mean payoff games

1995 ◽  
pp. 1-10 ◽  
Author(s):  
Uri Zwick ◽  
Michael S. Paterson
Keyword(s):  
Mean Payoff Games ◽  
Mean Payoff

scholarly journals Mean-payoff games with partial observation

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

scholarly journals Combinatorial Simplex Algorithms Can Solve Mean Payoff Games

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

Positional strategies for mean payoff games

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

scholarly journals Solving Mean-Payoff Games via Quasi Dominions

2020 ◽  
pp. 289-306
Author(s):  
Massimo Benerecetti ◽  
Daniele Dell’Erba ◽  
Fabio Mogavero
Keyword(s):  
Solution Algorithm ◽  
Problem Solution ◽  
Worst Case ◽  
Case Complexity ◽  
Worst Case Complexity ◽  
Mean Payoff Games ◽  
Parity Games ◽  
Mean Payoff ◽  
Novel Algorithm ◽  
Better Than

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.

scholarly journals Reduction of stochastic parity to stochastic mean-payoff games

2008 ◽  
Vol 106 (1) ◽  
pp. 1-7 ◽  
Author(s):  
Krishnendu Chatterjee ◽  
Thomas A. Henzinger
Keyword(s):  
Mean Payoff Games ◽  
Mean Payoff
Sign in / Sign up

Export Citation Format

Share Document