Optimal policies about discounted vector-valued Markovian decision programming and its algorithms
The paper deals with a discounted vector-valued Markov decision process with discrete time and with a countable state set, countable compact action sets, continuous transition probabilities, and continuous uniformly bounded reward functions. The authors describe the set of lexicographical optimal strategies and provide an algorithm for their computation.
discounted vector-valued Markov decision process
continuous uniformly bounded reward functions
scientific article; zbMATH DE number 220706