2 papers
math.OC2024
Strategy Complexity of Limsup and Liminf Threshold Objectives in Countable MDPs, with Applications to Optimal Expected Payoffs
Richard Mayr, Eric Munday
We study Markov decision processes (MDPs) with a countably infinite number of states. The (resp. ) threshold objective is to maximize the probability that the $\…
cs.GT2024
Strategy Complexity of Reachability in Countable Stochastic 2-Player Games
Stefan Kiefer, Richard Mayr, Mahsa Shirmohammadi +1
We study countably infinite stochastic 2-player games with reachability objectives. Our results provide a complete picture of the memory requirements of -optimal (resp…