Optimality, Equilibrium, and Curb Sets in Decision Problems Without Commitment

Printer-friendly version
P. Jean-Jacques Herings, Andrey Meshalkin, Arkadi Predtetchinski
Dynamic Games and Applications
The paper considers a class of decision problems with an infinite time horizon that contains Markov decision problems as an important special case. Our interest concerns the case where the decision maker cannot commit himself to his future action choices. We model the decision maker as consisting of multiple selves, where each history of the decision problem corresponds to one self. Each self is assumed to have the same utility function as the decision maker. Our results are twofold: Firstly, we demonstrate that the set of subgame optimal policies coincides with the set of subgame perfect equilibria of the decision problem. Furthermore, the set of subgame optimal policies is contained in the set of optimal policies and the set of optimal policies is contained in the set of Nash equilibria. Secondly, we show that the set of pure subgame optimal policies is the unique minimal curb set of the decision problem. The concept of a subgame optimal policy is therefore robust to the absence of commitment technologies.
Developed by Paolo Gittoi