An Improved Pseudo-Polynomial Upper Bound for the Value Problem and Optimal Strategy Synthesis in Mean Payoff Games
Data Structures and Algorithms
2016-04-26 v7 Computational Complexity
Computer Science and Game Theory
Abstract
In this work we offer an pseudo-polynomial time deterministic algorithm for solving the Value Problem and Optimal Strategy Synthesis in Mean Payoff Games. This improves by a factor the best previously known pseudo-polynomial time upper bound due to Brim,~\etal The improvement hinges on a suitable characterization of values, and a description of optimal positional strategies, in terms of reweighted Energy Games and Small Energy-Progress Measures.
Keywords
Cite
@article{arxiv.1503.04426,
title = {An Improved Pseudo-Polynomial Upper Bound for the Value Problem and Optimal Strategy Synthesis in Mean Payoff Games},
author = {Carlo Comin and Romeo Rizzi},
journal= {arXiv preprint arXiv:1503.04426},
year = {2016}
}