Proves exponential memory lower bound for strategy lifting from MDPs to stochastic games and shows linear memory suffices and is necessary for optimal randomized strategies in mean-payoff-parity stochastic games.
Title resolution pending
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
citation-role summary
background 1
citation-polarity summary
fields
cs.GT 2years
2026 2verdicts
UNVERDICTED 2roles
background 1polarities
background 1representative citing papers
Sure-almost-sure and sure-limit-sure window mean-payoff problems in MDPs are in P (fixed, unary window) and NP∩coNP (bounded), matching separate sure and almost-sure complexities.
citing papers explorer
-
Mean-Payoff-Parity and Lifting Strategies from MDPs to 2-Player Stochastic Games
Proves exponential memory lower bound for strategy lifting from MDPs to stochastic games and shows linear memory suffices and is necessary for optimal randomized strategies in mean-payoff-parity stochastic games.
-
Sure-almost-sure and Sure-limit-sure Window Mean Payoff in Markov Decision Processes
Sure-almost-sure and sure-limit-sure window mean-payoff problems in MDPs are in P (fixed, unary window) and NP∩coNP (bounded), matching separate sure and almost-sure complexities.