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.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
citation-role summary
background 1
citation-polarity summary
fields
cs.GT 1years
2026 1verdicts
UNVERDICTED 1roles
background 1polarities
background 1representative citing papers
citing papers explorer
-
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.