Energy mean-payoff games have protagonist strategies that may require infinite memory (antagonist needs none), with polynomial-time decidability in the one-player case and co-NP membership plus explicit constructions in the two-player case.
Reachability Games on Extended Vector Addition Systems with States
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
abstract
We consider two-player turn-based games with zero-reachability and zero-safety objectives generated by extended vector addition systems with states. Although the problem of deciding the winner in such games is undecidable in general, we identify several decidable and even tractable subcases of this problem obtained by restricting the number of counters and/or the sets of target configurations.
fields
cs.GT 1years
2019 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Energy mean-payoff games
Energy mean-payoff games have protagonist strategies that may require infinite memory (antagonist needs none), with polynomial-time decidability in the one-player case and co-NP membership plus explicit constructions in the two-player case.