06.06.2013 Views

STOCHASTIC

STOCHASTIC

STOCHASTIC

SHOW MORE
SHOW LESS

You also want an ePaper? Increase the reach of your titles

YUMPU automatically turns print PDFs into web optimized ePapers that Google loves.

(b) Show that the optimal policy in (i) reduces to dollar averaging when a — b.<br />

(c) Interpret the policy in (i) when b (the maximum possible price decrease) is very small.<br />

(d) Derive an optimal policy similar to (i) which would be appropriate when a (the<br />

maximum possible price increase) is small.<br />

14. Referring to Pye's paper in Chapter 2 of this part, let p, (1 g t g T) be the asset prices,<br />

and suppose the p, follow an arithmetic random walk: p, = Pt-i+yt, t= 1,2,.... The y,<br />

are independent and identically distributed. Let a and b be the maximum possible price<br />

increases and decreases: — b g y, g a. Assume that bit a. Consider the case of a nondivisible<br />

asset, where the only possible decisions are to sell or not to sell the entire asset. Let<br />

pt* = maxosisi(^i), Rt = P*~Pt be the regret at time t, and let P0 be given.<br />

(a) Show that R, and pt* obey the recursion relations<br />

R, + 1 = max(0,/J,-^, + i), p?+i = p,* + max(0,-i?,+j,+1).<br />

Let/„(i?) be the maximum regret given R, given that the asset has not been sold with n<br />

periods to go, and given that a minimax policy is used in the future. Note that/0(i?) = R.<br />

(b) Show that<br />

Mr)- min {max (/{,«), R+b] = max(R,a),<br />

(sell) (retain)<br />

and the minimax policy is to sell on the next-to-last period for any R.<br />

(c) Show by induction that<br />

/„ (R) = min {max(R + jb, (n -j) a)}.<br />

OSJSn-l<br />

(d) Show that an optimal stopping rule is to sell the asset with n periods to go if the<br />

current value of R satisfies R^na — b, and to wait one more period before deciding if<br />

R < na — b.<br />

(e) If ka g b 5j (k+ 1)«, show that the asset will always be sold at least k periods prior<br />

to the terminal date.<br />

(f) If i?i = 0, show that the asset will not be sold prior to<br />

where [x] denotes the largest integer gjc.<br />

a + b<br />

b<br />

a+b<br />

15. Consider a three-state Markov chain with transition matrix<br />

"i i i<br />

P= i 0 i<br />

.4 i 0<br />

Refer to Exercises ME-15 and 16 for notation and concepts.<br />

(a) Find the limiting distribution n,, i = 1,2,3.<br />

(b) Show that the mean first passage times ptj are<br />

2 2 2<br />

[ful =<br />

4 1<br />

4 4<br />

where fiu is the expected recurrence time of state ;'.<br />

Suppose that a cost CO) is incurred each time the chain is in state *': C(l) = 2, C(2) = 0,<br />

CO) = 1.<br />

670 PART V DYNAMIC MODELS

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

Saved successfully!

Ooh no, something went wrong!