Approximating the Value of Energy-Parity Objectives in Simple Stochastic Games

07/11/2023

∙

by   Mohan Dantam, et al.

∙

0

∙

share

We consider simple stochastic games 𝒢 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(|𝒢|)·log(1/ε)) memory modes.