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(2EXP(∣G∣)⋅log(ε1)) memory modes.
@article{arxiv.2307.05762,
title = {Approximating the Value of Energy-Parity Objectives in Simple Stochastic Games},
author = {Mohan Dantam and Richard Mayr},
journal= {arXiv preprint arXiv:2307.05762},
year = {2023}
}