FINM33000 Homework 1 Solved

35.00 $

Category: Tags: ,
Click Category Button to View Your Next Assignment | Homework

You'll get a download link with a: zip solution files instantly, after Payment

Securely Powered by: Secure Checkout

Description

5/5 - (1 vote)

1 FINM 33000: Homework 1

Due Wednesday October 6, 2021 at 6:00pm In each part, construct an arbitrage: Specify a static portfolio that meets the definition of arbitrage (which you are to verify, using either the type-1 or type-2 condition). You can specify the portfolio’s assets in any order; just be clear and consistent about what order you have chosen. For example, you couldsay(3 units of A, 1 unit of B, -5 units of C)or(1 unit of B, -5 units of C, 3 units of A),but not just (3, 1, −5) nor just (1, −5, 3) without further specification.

Let T > 0.

In each part, S denotes a non-dividend-paying stock. Assume that ST 0. Unless otherwise directed, make no further assumptions about the distribution of ST ; your arbitrage must be valid regardless of the distribution of ST .

(a) Exactly two assets are available: two bank accounts B and B∗ with B0 = B0∗ = 1 and BT =erT andBT∗ =er∗T wherer<r∗.

X0=􏰖B0 B0∗􏰗 􏰖􏰗

=11 XT=􏰖BT BT∗􏰗

= 􏰖ert er∗t􏰗

Θ=􏰖−1 1􏰗 V0 = 0

= ert r −ert >0∀r∗ >r
Type 1: -1 B +1 B∗ for 0 initial cost; payoff guaranteed to be positive at T.

(b) Exactly three assets are available: A discount bond Z with Z0 = 0.9; the stock S with S0 = 100.0; and C, a European call on S with strike 110, expiry T, and time-0 price C0 = 0.50.

VT =−ert+er∗t 􏰅 􏰆r∗

1

X=􏰖Z S C􏰗 0􏰖000􏰗

= 0.9 100 0.5 X=􏰖Z S C􏰗

T􏰖TTT 􏰗 = 1 ST max(ST −110,0)

Θ=􏰖100 −1 1􏰗
V0 = 110∗0.9+(−1)∗100+1∗0.5 = −0.5

VT = 110∗1+(−1)∗ST +1∗max(ST −110,0) = (110−ST)+max(ST −110,0)
= max(ST −110+(110−ST),0+(110−ST)) = max(0, 110 − ST )

Type 2: +100 Z -1 S +1 C for an initial credit of 0.5; payoff is a call option with strike 110 (nonnegative).

(c) Exactly three assets are available: the stock S with S0 = 100.0; a contract G that pays min(ST,110) at time T, and has time-0 price G0 = 85; and C, a European call on S with strike 110, expiry T , and time-0 price C0 = 20.

X=􏰖S G C􏰗 0􏰖000􏰗

= 100 85 20 X=􏰖S G C􏰗

T􏰖TTT 􏰗 = ST min(ST , 110) max(ST − 110, 0)

Θ=􏰖1 −1 −1􏰗
V0 = 100−85−20 = −5

VT = ST −min(ST,110)−max(ST −110,0)
= ST − 110 − min(ST − 110,0) − max(ST − 110,0)

(ST −110) −(min(ST −110,0)+max(ST −110,0)) 􏰚􏰙􏰘􏰛􏰚 􏰙􏰘 􏰛

Futures contract with strike 110 Synthetic futures with strike 110 using -Put +Call

Type 2: +1 S -1 G -1 C for an initial credit of 5; payoff at T is 0.

(d) Exactly four assets are available: A discount bond Z with Z0 = 0.9; and three calls (all on the same underlying. The underlying is not available for you to trade). The calls have expiry T, strike K {20.0,22.5,25.0}, and time-0 price C0(K), where C0(20.0) = 6.40, C0(22.5) = 4.00, C0(25.0) = 1.00. Hint: what combination (how many units of each one) of those calls will produce a time-T payoff max(0, 2.5 − |ST − 22.5|)?

= =0

2

X0 = 􏰖C0(20.0) C0(22.5) C0(25.0)􏰗 􏰖􏰗

= 6.40 4.00 1.00
XT = 􏰖CT (20.0) CT (22.5) CT (25.0)􏰗

= 􏰖max(ST − K, 0)|K ∈ 20.0, 22.5, 25.0􏰗 Θ=􏰖1 −2 1􏰗

V0 = −0.60
VT = max(ST − 20.0,0) − 2max(ST − 22.5,0) + max(ST − 25,0)

 0 if 00.0 ≤ ST < 20.0
= ST −20.0 if20.0≤ST <22.5 ≥0

25.0 − ST if 22.5 ≤ ST < 25.0 0 if25.0≤ST <∞

Type 2: +1 C(20.0) -2 C(22.5) +1 C(25.0) for an initial credit of 0.6; payoff at T is a butterfly spread (20.0, 22.5, 25.0) with a nonnegative payoff.

(e) Assume that ST > 0 and P(ST = 100) > 0. Exactly 3 assets are available: a contract X that pays XT := −2 log(ST /100) at time T and has time-0 price X0 = 0.2, a forward contract Y , with delivery price 100 and delivery date T , and time-0 price Y0 = −10, and a discount bond Z with maturity T and time-0 price Z0 = 0.9.

3

X=􏰖X Y Z􏰗 0􏰖000􏰗

= 0.2 −10 0.9 X=􏰖X Y Z􏰗

TTTT
=􏰖−2log􏰅ST 􏰆 ST −100 1􏰗

Note:

dXT = − 2 dST ST

d2XT = 2 dST2 ST2

Therefore:

dX􏰉􏰉 2 1

100

T􏰉􏰉 =− =− dST 100 100

d2XT ≥0 dST2

􏰖􏰗

Θ= 50 1 0
V0 = 50∗0.2+1∗(−10)+0∗0.9

= 10 − 10 = 0
VT =50∗(−2log􏰅ST 􏰆)+1∗(ST −100)

100

= −100log􏰅ST 􏰆) +(ST −100) 􏰚 􏰙􏰘 100 􏰛

Superreplicates short futures at strike 100

VT ≥ −(ST −100)+(ST −100) = 0
Type 1: +50 X +1 Y 0 Z for an initial portfolio of 0; payoff at T is superreplicates -Y0 +Y0, and

therefore is nonnegative.

Problem 2

Interest rates are zero; the bank account has price Bt = 1 at all times.

Trump is the Republican Party’s candidate in the US Presidential election.

Biden is the Democratic Party’s candidate in the US Presidential election.

Assume that exactly one of these two candidates {Trump the Republican, Biden the Democrat} will win US Presidential election.

According to the rules of the election, the winner depends on who wins in each state of the US.

You do not need to know the full rules that determine the US Presidential election winner from the state winners.

You need to know only the information provided below. 4

50

Assume that the current time is 7:30am on Thursday the 5th of November 2020 – which we will designate as “time 0”.

Election Day was two days ago. The winner of the election in many of the states of the US has been already determined, but in a few US states, finishing the vote count will require some time.

Assume that the winner has not yet been determined in only 3 US states: Arizona (AZ), Georgia (GA), and Pennsylvania (PA)

Assume that, by some specified time T > 0, in each of those 3 states, exactly one of the two candidates will be revealed to be the winner: Trump the Republican, or Biden the Democrat.

There are contracts frictionlessly available at time 0 for the following prices in blue color: (Ignore the dollar amounts in black color listed under “Volume”; they are not relevant to this question).

(This is actual data from polymarket.com on 2020 November 5.)

Let us assign names to the above 8 contracts, and to make sure there is no confusion, let us write these contract names in the same ordering as in the above table.

US AZ GA PA

.Biden .Trump

0.83 0.17 0.80 0.20 0.56 0.44 0.84 0.16

US.Trump AZ.Biden GA.Biden PA.Biden US.Biden AZ.Trump GA.Trump PA.Trump

(Be careful – Biden is listed on the right-hand side for the US election in the top row, but listed on the left-hand side in each individual state in the other three rows).

Each contract pays 1 dollar at time T if the referenced candidate wins the referenced state (or the US, for the contracts in the top row), and pays zero otherwise.

So, for example, the GA.Trump contract has a time-0 price of 0.44 dollars. It pays 1 dollar if Trump wins in Georgia, and pays 0 if Biden wins in Georgia.

Assume that Trump wins the US Presidential election if and only if he wins all three states: Arizona, Georgia, Pennsylvania.

Then arbitrage exists.

(a) Find an arbitrage that uses some or all of those 8 listed contracts, but does not use the bank account. In part (a), short-selling (holding negative quantities of an asset) is allowed for any of those 8 listed contracts.

5

X0 = 􏰖US.TRUMP PA.TRUMP􏰗 􏰖􏰗

= 0.17 0.16
􏰊 US.TRUMP.WIN PA.TRUMP.WIN 􏰋

XT = US.TRUMP.LOSS PA.TRUMP.LOSS 􏰊􏰋

=11 00

Θ=􏰖−1 1􏰗
V0 = −0.17 + 0.16 = −0.01

􏰊−1 + 1􏰋 VT= 0+0

􏰊􏰋

= 0

Type 2: +1 US.TRUMP -1 PA.TRUMP for an initial credit of 0.01; payoff at T is at worst 0.

(b) Find an arbitrage that uses some or all of those 8 listed contracts, but does not involve short- selling of any of those 8 listed contracts. In part (b) you are allowed to hold the bank account, in positive or negative quantities.

You may use either the type-1 or type-2 definition of arbitrage. Make no further assumptions regarding the probability distribution of the outcomes in the 3 states; your arbitrage must be valid, irrespective of the probability distributions of the outcomes in those 3 states (and irrespective of the joint distributions of those outcomes).

X = 􏰖US.BIDEN PA.TRUMP B 􏰗 0􏰖􏰗0

= 0.83 0.16 1

􏰊US.BIDEN.LOSS PA.TRUMP.WIN B 􏰋 XT = T US.BIDEN.WIN PA.TRUMP.LOSS BT

􏰊􏰋

=011 101

Θ=􏰖1 1 −1􏰗
V0 = 0.83+0.16−1 = −0.01

􏰊0 + 1 − 1􏰋 VT = 1+0−1

􏰊􏰋

= 0

Type 2: +1 US.BIDEN +1 PA.TRUMP -1 B for an initial credit of 0.01; payoff at T is at worst 0.

Note: B0 = BT = 1 may indicate that the time step between betting is negligible i.e. limT →0 BT = limT→0erT =e0 =1.

6

  • HW1-4cv6nx.zip