1 citations · 1 across the 2 of their papers we have counts for
3 papers
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.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…
cs.AI2021
Strategy Complexity of Mean Payoff, Total Payoff and Point 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…