Faster algorithms for mean-payoff games

Kód výsledku v 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>

Výsledek na webu

<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>

Jazyk výsledku

angličtina

Název v původním jazyce

Faster algorithms for mean-payoff games

Popis výsledku v původním jazyce

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.

Název v anglickém jazyce

Faster algorithms for mean-payoff games

Popis výsledku anglicky

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.

Druh

J_x - Nezařazeno - Článek v odborném periodiku (Jimp, Jsc a Jost)

CEP obor

IN - Informatika

OECD FORD obor

—

Projekt

<a href="/cs/project/GA201%2F09%2F1389" target="_blank" >GA201/09/1389: Verifikace a analýza velmi velkých počítačových systémů</a><br>

Návaznosti

P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)<br>Z - Vyzkumny zamer (s odkazem do CEZ)

Rok uplatnění

2011

Kód důvěrnosti údajů

S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Název periodika

Formal Methods in System Design

ISSN

0925-9856

e-ISSN

—

Svazek periodika

38

Číslo periodika v rámci svazku

2

Stát vydavatele periodika

DE - Spolková republika Německo

Počet stran výsledku

22

Strana od-do

97-118

Kód UT WoS článku

000288671700001

EID výsledku v databázi Scopus

—