Other formats:
BibTeX
LaTeX
RIS
@inproceedings{895330,
author = {Brim, Luboš and Chaloupka, Jakub},
address = {Neuveden},
booktitle = {Games, Automata, Logics and Formal Verification (GandALF) 2010},
keywords = {mean-payoff games; strategy improvement; experimental evaluation},
language = {eng},
location = {Neuveden},
pages = {40-54},
publisher = {Electronic Proceedings in Theoretical Computer Science (EPTCS)},
title = {Using Strategy Improvement to Stay Alive},
url = {http://arxiv.org/abs/1006.1405},
year = {2010}
}
TY - JOUR
ID - 895330
AU - Brim, Luboš - Chaloupka, Jakub
PY - 2010
TI - Using Strategy Improvement to Stay Alive
PB - Electronic Proceedings in Theoretical Computer Science (EPTCS)
CY - Neuveden
KW - mean-payoff games
KW - strategy improvement
KW - experimental evaluation
UR - http://arxiv.org/abs/1006.1405
N2 - 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.
ER -
BRIM, Luboš and Jakub CHALOUPKA. Using Strategy Improvement to Stay Alive. In \textit{Games, Automata, Logics and Formal Verification (GandALF) 2010}. Neuveden: Electronic Proceedings in Theoretical Computer Science (EPTCS), 2010, p.~40-54. ISSN~2075-2180.
|
