BRÁZDIL, Tomáš, Václav BROŽEK, Kousha ETESSAMI and Antonín KUČERA. Approximating the Termination Value of One-Counter MDPs and Stochastic Games. In Luca Aceto, Monika Henzinger, Jiří Sgall. Proceedings of 38th International Colloquium on Automata, Languages and Programming (ICALP 2011). Berlin: Springer, 2011, p. 332-343. ISBN 978-3-642-22011-1.
Other formats:   BibTeX LaTeX RIS
Basic information
Original name Approximating the Termination Value of One-Counter MDPs and Stochastic Games
Authors BRÁZDIL, Tomáš (203 Czech Republic, belonging to the institution), Václav BROŽEK (203 Czech Republic, belonging to the institution), Kousha ETESSAMI (840 United States of America) and Antonín KUČERA (203 Czech Republic, guarantor, belonging to the institution).
Edition Berlin, Proceedings of 38th International Colloquium on Automata, Languages and Programming (ICALP 2011), p. 332-343, 12 pp. 2011.
Publisher Springer
Other information
Original language English
Type of outcome Proceedings paper
Field of Study 10201 Computer sciences, information science, bioinformatics
Country of publisher Germany
Confidentiality degree is not subject to a state or trade secret
RIV identification code RIV/00216224:14330/11:00049981
Organization unit Faculty of Informatics
ISBN 978-3-642-22011-1
UT WoS 000313861100010
Keywords in English stochastic games; one-counter automata
Tags International impact, Reviewed
Changed by Changed by: prof. RNDr. Antonín Kučera, Ph.D., učo 2508. Changed: 17/12/2011 16:19.
Abstract
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.
Abstract (in Czech)
V článku je dokázáno, že všechny kvantitativní aproximační problémy v jednočítačových hrách, kde cílem hračů je maximalizovat resp. minimalizovat pravděpodobnost ukončení, jsou algoritmicky řešitelné. Pro zadanou chybu e lze hodnotu hry efektivně aproximovat s přesností e a je také možné vypočítat e-optimální strategie.
Links
GAP202/10/1469, research and development projectName: Formální metody pro analýzu a verifikaci komplexních systémů
Investor: Czech Science Foundation
MSM0021622419, plan (intention)Name: Vysoce paralelní a distribuované výpočetní systémy
Investor: Ministry of Education, Youth and Sports of the CR, Highly Parallel and Distributed Computing Systems
1M0545, research and development projectName: Institut Teoretické Informatiky
Investor: Ministry of Education, Youth and Sports of the CR, Institute for Theoretical Computer Science
PrintDisplayed: 25/7/2024 14:08