Strong and Compact Policies for Submodular Markov Decision Processes via LP-Based Submodular OrienteeringResearch Paper
A Markov decision process (MDP) is the standard model of sequential decision making under uncertainty in operations research and reinforcement learning (Puterman 1990). In the classical model the agent collects an additive reward over a finite horizon , and an optimal policy that depends only on the current state and time is found by dynamic programming.