Approximating the Termination Value of One-Counter MDPs and Stochastic Games
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216224%3A14330%2F11%3A00049981" target="_blank" >RIV/00216224:14330/11:00049981 - isvavai.cz</a>
Result on the web
—
DOI - Digital Object Identifier
—
Alternative languages
Result language
angličtina
Original language name
Approximating the Termination Value of One-Counter MDPs and Stochastic Games
Original language description
We show that all quantitative approximation problems for the termination value for one-counter MDPs and one-counter stochastic games are computable. Specifically, given a one-counter game, and given e > 0, we can compute a value v that approximates the value of the termination game within additive error e, and furthermore we can compute e-optimal strategies for both players in the game.
Czech name
—
Czech description
—
Classification
Type
D - Article in proceedings
CEP classification
IN - Informatics
OECD FORD branch
—
Result continuities
Project
Result was created during the realization of more than one project. More information in the Projects tab.
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
Article name in the collection
Proceedings of 38th International Colloquium on Automata, Languages and Programming (ICALP 2011)
ISBN
978-3-642-22011-1
ISSN
—
e-ISSN
—
Number of pages
12
Pages from-to
332-343
Publisher name
Springer
Place of publication
Berlin
Event location
Zurich, Switzerland
Event date
Jan 1, 2011
Type of event by nationality
WRD - Celosvětová akce
UT code for WoS article
—