An application of Kleene's fixed point theorem to dynamic programming

摘要

We show that the least fixed point of the Bellman operator in a certain set can be computed by value iteration whether or not the fixed point is the value function. As an application, we give a simpler proof of one of Kamihigashi's main results.