Abstract
AbstractWe study stochastic games with energy-parity objectives, which combine quantitative rewards with a qualitative $$\omega $$
ω
-regular condition: The maximizer aims to avoid running out of energy while simultaneously satisfying a parity condition. We show that the corresponding almost-sure problem, i.e., checking whether there exists a maximizer strategy that achieves the energy-parity objective with probability 1 when starting at a given energy level k, is decidable and in $$\mathsf {NP}\cap \mathsf {coNP}$$
NP
∩
coNP
. The same holds for checking if such a k exists and if a given k is minimal.
Publisher
Springer International Publishing
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. Submixing and shift-invariant stochastic games;International Journal of Game Theory;2023-05-25