Contractivity of Bellman Operator in Risk Averse Dynamic Programming with Infinite Horizon

08/03/2022

∙

by   Martin Šmíd, et al.

∙

0

∙

share

The paper deals with a risk averse dynamic programming problem with infinite horizon. First, the required assumptions are formulated to have the problem well defined. Then the Bellman equation is derived, which may be also seen as a standalone reinforcement learning problem. The fact that the Bellman operator is contraction is proved, guaranteeing convergence of various solution algorithms used for dynamic programming as well as reinforcement learning problems, which we demonstrate on the value iteration algorithm.