06.06.2013 Views

STOCHASTIC

STOCHASTIC

STOCHASTIC

SHOW MORE
SHOW LESS

Create successful ePaper yourself

Turn your PDF publications into a flip-book with our unique Google optimized e-Paper software.

(a) Show that U obeys the functional equation<br />

_1<br />

U(i,t) = max F{i, t),-i- Y g,j U(J,t+1) -/ft0<br />

1+P,T 1 4-/), A-i<br />

for t = 1,..., T-1 and t/ft T) = 0 for all i.<br />

It is useful to reformulate the problem as a pure entrance-fee problem in which the reward<br />

for stopping is F'{i,t) = 0 and an entrance fee/'(',0 must be paid to continue. Note that<br />

if/'((', 0 < 0, it is actually profitable to continue. In the present case, let<br />

fV,t) = F(i,t)+f(i,t)- TT7,P' jFU ' t+1)<br />

and F'(i,t) = 0. Let U'(i,t) be the maximum expected reward for the pure entrance-fee<br />

problem, starting from state (i, t).<br />

(b) Show that U'(i, t) obeys the equation<br />

U'(J,t) = max<br />

for t = 1,2,..., T-1, and U'(i, T) = 0 for all i.<br />

(c) Show that U(i, t) = F(i, t) + U'(i, t). [Hint: Use backward induction.]<br />

(d) Show that the optimal refunding policy for the original and the entrance-fee versions<br />

is the same.<br />

(e) Recalling the functional equation obeyed by the bond prices />,, t, show that<br />

/'ftO = 2r + c, + 1-c,<br />

l+Pt ! t= i,...,r-i.<br />

(f) Recalling Pye's assumptions Pi < Pt + i, Ac, ^ 0, A 2 c, js 0, show that<br />

f'(i+ 1,0 < /'(«,/) and /'(/,;*?,,+ i •<br />

(b) Show that ysG.<br />

(c) Assuming that x* is unique, show that its components satisfy the equation<br />

MIND-EXPANDING EXERCISES<br />

0,-A/,0 + 2>u**. + i<br />

j<br />

683

Hooray! Your file is uploaded and ready to be published.

Saved successfully!

Ooh no, something went wrong!