

Study with the several resources on Docsity
Earn points by helping other students or get them with a premium plan
Prepare for your exams
Study with the several resources on Docsity
Earn points to download
Earn points by helping other students or get them with a premium plan
Problem set 4 for the course stochastic processes ii - m375t, taught by gerard brunick. The problems cover various topics in stochastic processes, including exponentiation of martingales, choosing constants for martingales, and strategies for gambling on coin flips.
Typology: Assignments
1 / 2
This page cannot be seen from the preview
Don't miss anything!


Course: Stochastic Processes II - M375T Instructor: Gerard Brunick
We will go over this problem set on Monday 4/6.
We are working in the coin-flip setup with Mn ,
∑n i=1 1 Hi −^1 Ti for all of the following problems.
(a) Set Xn = eMn^. Is (Xn)n∈N 0 a martingale, submartingale, or supermartingale? Hint: write Xn = e∆Mn^ Xn− 1 and use the convexity of the exponential function. (b) Let Nn = eMn−nC^ for some constant C. Choose C so that (Nn)n∈N 0 is a martingale. Hint: write Nn = e∆Mn^ e−C^ Nn− 1.
∑n i=1 Θn∆Mn. (a) Write In as a function of Mn and n. Hint: notice that Mn− 1 (∆Mn) = (^12)
M (^) n^2 − M (^) n^2 − 1 − (∆Mn)^2
, and the expression on the right is essentially a telescoping sum. (b) Is (Θn)n∈N 0 adapted? Is it predictable? Is In a martingale?
i=1 1 Hi denote twice the number of heads that occur in the first three flips (so X is a random variable not a process).
(a) Set Nn = E[X | Fn]. Compute the process (Nn)n∈N 0 explicitly and check that it is a martingale. Hint: it may help to consider the cases n ≤ 3 and n > 3 separately. For the n ≤ 3 case it may help to draw a tree of all possibilities. (b) Find a process (Θn)n∈N such that Nn = N 0 +
∑n i=1 Θi∆Mi. You may help to look at the tree from the previous part and try to use backward induction. (c) Suppose that in addition to the regular bets on heads and tails, you can also buy a “magic double triple header ticket” for some cost $C, where C is a non- random constant. When you buy such a ticket, you get $2 for each heads that appears in the next three flips. If C < 3, explain how you can take advantage of this mispricing to make money with no risk. Such an opportunity is called an arbitrage. Hint: The “hedging strategy” that you computed in the previous part of this problem gives you one way to produce a payoff equal to X, and the buying the ticket gives you another. How can you play these two possibilities off against one another?
Page: 1/
Course: Stochastic Processes II - M375T Instructor: Gerard Brunick
In the following problems, we describe a strategy that one could follow when gambling on coin flips. You are asked to give the integrand process (Θn)n∈N (in particular, Θ 0 doesn’t matter) such that the stochastic integral In =
∑n i=1 Θi∆Mi^ corresponds to the amount of money that you would have at time n if you followed the given strategy.
Page: 2/