Using strategy improvement to stay alive

Investor logo
Investor logo

Warning

This publication doesn't include Faculty of Arts. It includes Faculty of Informatics. Official publication website can be found on muni.cz.
Authors

BRIM Luboš CHALOUPKA Jakub

Year of publication 2012
Type Article in Periodical
Magazine / Source International Journal of Foundations of Computer Science
MU Faculty or unit

Faculty of Informatics

Citation
Web http://dx.doi.org/10.1142/S0129054112400291
Doi http://dx.doi.org/10.1142/S0129054112400291
Field Informatics
Keywords Mean-payoff games; strategy improvement; experimental evaluation.
Description 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.
Related projects:

You are running an old browser version. We recommend updating your browser to its latest version.