Faster algorithms for mean-payoff games
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216224%3A14330%2F11%3A00050261" target="_blank" >RIV/00216224:14330/11:00050261 - isvavai.cz</a>
Result on the web
<a href="http://dx.doi.org/10.1007/s10703-010-0105-x" target="_blank" >http://dx.doi.org/10.1007/s10703-010-0105-x</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1007/s10703-010-0105-x" target="_blank" >10.1007/s10703-010-0105-x</a>
Alternative languages
Result language
angličtina
Original language name
Faster algorithms for mean-payoff games
Original language description
In this paper, we study algorithmic problems for quantitative models that are motivated by the applications in modeling embedded systems. We consider two-player games played on a weighted graph with mean-payoff objective and with energy constraints. We present a new pseudopolynomial algorithm for solving such games, improving the best known worst-case complexity for pseudopolynomial mean-payoff algorithms. Our algorithm can also be combined with the procedure by Andersson and Vorobyov to obtain a randomized algorithm with currently the best expected time complexity. The proposed solution relies on a simple fixpoint iteration to solve the log-space equivalent problem of deciding the winner of energy games. Our results imply also that energy games and mean-payoff games can be reduced to safety games in pseudopolynomial time.
Czech name
—
Czech description
—
Classification
Type
J<sub>x</sub> - Unclassified - Peer-reviewed scientific article (Jimp, Jsc and Jost)
CEP classification
IN - Informatics
OECD FORD branch
—
Result continuities
Project
<a href="/en/project/GA201%2F09%2F1389" target="_blank" >GA201/09/1389: Verification and Analysis of Large-Scale Computer Systems</a><br>
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)<br>Z - Vyzkumny zamer (s odkazem do CEZ)
Others
Publication year
2011
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Name of the periodical
Formal Methods in System Design
ISSN
0925-9856
e-ISSN
—
Volume of the periodical
38
Issue of the periodical within the volume
2
Country of publishing house
DE - GERMANY
Number of pages
22
Pages from-to
97-118
UT code for WoS article
000288671700001
EID of the result in the Scopus database
—