52 citations · 206 across the 25 of their papers we have counts for
Showing 2022Show all
3 papers · 1 filter
math.OC2022
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.GT2022
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…
cs.CC2022★ 1 cited
Strategy Complexity of Point Payoff, Mean Payoff and Total Payoff Objectives in Countable MDPs
Richard Mayr, Eric Munday
We study countably infinite Markov decision processes (MDPs) with real-valued transition rewards. Every infinite run induces the following sequences of payoffs: 1. Point payoff (th…