Exercise. Show that Vn (0) is nonincreasing in p for given n .
Compare n* ( p) and n* ( p' ) for p p' .
What is the behaviour of n* ( p) in p ?
Show that Vn1 (0, p) is nonincreasing in p for n 1 .
Revise the notation for Vn (i ) used in the lecture notes
Numerical Solutions (Computational Burden) of the DP formulations : Curse of Dimensionality.
DP allows us to analytically investigate the optimal policy structure.
A Stochastic Shortest Path Problem
Consider the N -stage network with N 6 .