MATH268 - Common Distribution Function And Optimality Equation - Mathematics Assignment Help

Download Solution Order New Solution
Assignment Task

 

Exercise 1  At each play of the game, a gambler can bet any nonnegative amount up to his present fortune and will either win or lose that amount with probability p ∈ (0, 1) and 1 − p, respectively. By saying “win that amount”, we mean he gets a net profit of that amount. The gambler is allowed to make n bets, and his objective is to maximize the expectation of the logarithm of his final fortune. What strategy achieves this end when p ≤ 1/2? What is the optimal value of this problem if the gambler has initial fortune x > 0?

 

Exercise 2  Let Sk denote the price of a given stock on the kth day (k ≥ 1) and suppose that

Sk+1 = Sk + Xk+1 = S0 + X k+1 i=1 Xi

where X1, X2, . . . are i.i.d. with common distribution function F. Assume X1, X2, . . . are independent on S0 (the initial price), and the mean E[X1] := μF< 0 is finite. (We allow the “stock” price to fall below 0.)

Suppose now you own an option to buy one share of the stock at a fixed price, say c, and you have N days in which to exercise the option. You are not obliged to exercise it, but if you do at a time when the stock’s price is s, then your profit is s − c (i.e., buy a share of stock at c and immediately sell it at the price s). You are interested in the policy maximizes your expected profit.

(a) Write down the optimality equation. (You may formulate a suitable dynamic programming problem with the following meaning of states: sn is the stock price, and the option has not been exercise, at the day n.)

(b) Prove that Vn(s) − s is decreasing in s.

(c) Show that one can take an optimal policy in the following form: there are increasing sequence of numbers b1 ≤ b2 ≤ b3 ≤ · · · ≤ bn ≤ . . . such that if there are n days to go, and the present price is s, then one should exercise the option if s ≥ bn and not exercise if s < bn. (You may use the fact that Vn(x) is continuous in x without justifications.)

 

 

This (MATH268) Mathematics Assignment has been solved by our Mathematics experts at My Uni Paper. Our Assignment Writing Experts are efficient to provide a fresh solution to this question. We are serving more than 10000+ Students in Australia, UK & US by helping them to score HD in their academics. Our Experts are well trained to follow all marking rubrics & referencing style.
Be it a used or new solution, the quality of the work submitted by our assignment experts remains unhampered. You may continue to expect the same or even better quality with the used and new assignment solution files respectively. There’s one thing to be noticed that you could choose one between the two and acquire an HD either way. You could choose a new assignment solution file to get yourself an exclusive, plagiarism (with free Turnitin file), expert quality assignment or order an old solution file that was considered worthy of the highest distinction.

Get It Done! Today

Country
Applicable Time Zone is AEST [Sydney, NSW] (GMT+11)
+

Every Assignment. Every Solution. Instantly. Deadline Ahead? Grab Your Sample Now.