License: 
Creative Commons Attribution 4.0 International license (CC BY 4.0)
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.MFCS.2023.38
URN: urn:nbn:de:0030-drops-185724
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2023/18572/
Dantam, Mohan ;
Mayr, Richard
Approximating the Value of Energy-Parity Objectives in Simple Stochastic Games
Abstract
We consider simple stochastic games G with energy-parity objectives, a combination of quantitative rewards with a qualitative parity condition. The Maximizer tries to avoid running out of energy while simultaneously satisfying a parity condition.
We present an algorithm to approximate the value of a given configuration in 2-NEXPTIME. Moreover, ε-optimal strategies for either player require at most O(2-EXP(|G|)⋅log(1/ε)) memory modes.
BibTeX - Entry
@InProceedings{dantam_et_al:LIPIcs.MFCS.2023.38,
author = {Dantam, Mohan and Mayr, Richard},
title = {{Approximating the Value of Energy-Parity Objectives in Simple Stochastic Games}},
booktitle = {48th International Symposium on Mathematical Foundations of Computer Science (MFCS 2023)},
pages = {38:1--38:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-292-1},
ISSN = {1868-8969},
year = {2023},
volume = {272},
editor = {Leroux, J\'{e}r\^{o}me and Lombardy, Sylvain and Peleg, David},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/opus/volltexte/2023/18572},
URN = {urn:nbn:de:0030-drops-185724},
doi = {10.4230/LIPIcs.MFCS.2023.38},
annote = {Keywords: Energy-Parity Games, Simple Stochastic Games, Parity, Energy}
}
|
Keywords: |
|
Energy-Parity Games, Simple Stochastic Games, Parity, Energy |
|
Collection: |
|
48th International Symposium on Mathematical Foundations of Computer Science (MFCS 2023) |
|
Issue Date: |
|
2023 |
|
Date of publication: |
|
21.08.2023 |
