Past exam of the mathematics course of the University of Cambridge / 2005 / ii / Paper 2 / 28J / i

Let ${\mathcal{F}}_n$ represent the information at decision time $n$ and $E_n$ conditional expectation given it. $V_n(w)$ is the largest conditional expected utility from the remaining consumption opportunities with current wealth $w$; it may depend on the information state as well as $w$. The controls $c$ and $\theta$ are chosen using current information. In the usual allocation interpretation $0\le c\le w$ and $0\le \theta \le 1$, and next wealth is $(w-c)[r+\theta (X_{n+1}-r)]$. Other borrowing/short-selling rules require explicitly replacing this admissible set while preserving solvency.

The Bellman equation follows by separating current utility from future utility: after any current decision the best continuation has conditional value $V_{n+1}$, and maximizing over the current admissible decisions gives the stated recursion. At the last opportunity all wealth is consumed, because utility is increasing, giving $V_N(w)=U(w)$.

There are two printed qualifications. Strict convexity is not needed for this recursion, but it conflicts with the concave power utility in part (ii) and does not support the interior maximizing first-order conditions in part (iii). Also the displayed recursion starting at $n=0$ includes consumption at times $0,\dots ,N$, whereas the preceding sum starts at one. The same recursion represents that sum when begun at time one; alternatively relabel the consumption dates. Below the policy is given for the recursion's remaining horizon, so this indexing discrepancy does not leave the optimization unspecified.