Professional Documents
Culture Documents
CQF
1/98
CQF Module 3: Option Valuation Models Connecting the Dots
2/98
CQF Module 3: Option Valuation Models Connecting the Dots
In this lecture...
We conclude on the first half of the course by bringing together the three
valuation models we have seen so far:
I the binomial model;
I the PDE approach;
I the martingale approach.
3/98
É
EF
Et
Akio
D Hedging
em
Payoff
1111
t
e
iE
local 1
CQF Module 3: Option Valuation Models Connecting the Dots
4/98
CQF Module 3: Option Valuation Models Connecting the Dots
4 1 2
so sd dxso
I stock priced at S0 ;
I time period t;
I stock can only go up to Su = uS0 with probability p or down to Sd = dS0
with probability 1 p. Formally, we denote by ST the random variable
taking value Su in an up-move and value Sd in a down-move;
I condition that d < 1 < u;
I discount rate r . Hence discount factor D = (1 + r t) 1 and bank account
factor B = D1 = (1 + r t);
I Our objective is to find the current value of an option, denoted by V0 .
D B Inst
fast I
5/98
CQF Module 3: Option Valuation Models Connecting the Dots
6/98
CQF Module 3: Option Valuation Models Connecting the Dots
DST Ta Vd D Sd
To Vo
Delta hedging means finding such that the value of a portfolio long a call
option and short stocks is independent on the stock value or risk. We can
think of delta has the sensitivity of the option to the change in the stock (i.e.
same Delta as in Black Scholes).
select D Tu IT
Va Dsu Vd DSol
7/98
S D
CQF Module 3: Option Valuation Models Connecting the Dots
Since the portfolio is delta hedged, the value of the portfolio must be the
same in the upper and lower state. Hence,
O
Vu Vd
Vu S u = Vd Sd () =
(u d)S0
8/98
CQF Module 3: Option Valuation Models Connecting the Dots
no-arbitrage valuation and state that to prevent arbitrage, the return of the
portfolio over the time period t must be the risk-free rate:
O
1
Vu Su = Vd Sd = (V0 S0 )
D
Tu Id
I To
9/98
CQF Module 3: Option Valuation Models Connecting the Dots
Vu Payoff
first
D
Inst I Vd Payoff
Therefore,
Vu Vd uVd dVu
0
V0 =
u
(1
d
+D
u d
Dd)Vu (Du 1)Vd
= (1)
u d
10/98
CQF Module 3: Option Valuation Models Connecting the Dots
11/98
CQF Module 3: Option Valuation Models Connecting the Dots
so is
the stock will earn the RFR a
Onage ol so
1 5 77 8 So t it f
e
12/98
CQF Module 3: Option Valuation Models Connecting the Dots
ERN Vt p Vu
i pt Vol
Vo
I Vu Ce pt Va
i to D p
t
13/98
CQF Module 3: Option Valuation Models Connecting the Dots
Vo To o
Vo D t Vu
O
Equation (1) can be written more elegantly as
V0 = D [p ⇤ Vu + (1 p ⇤ )Vd ]
where
1
⇤ D
d
p =
u d
Hp
The parameter p ⇤ can be interpreted as a probability. In fact, the Cox Ross
Rubinstein model is built so that the p ⇤ is the probability in use.
14/98
CQF Module 3: Option Valuation Models Connecting the Dots
15/98
CQF Module 3: Option Valuation Models Connecting the Dots
Since we just have two possible events1 , namely an up move and a down move,
the parameter p 2 (0, 1) is enough to uniquely define a probability measure P as
⇢
P [up move]
P [down move] = 1 p
=
O p
0
1 p Cup more
1
Mathematically, ⌦ = {up move, down move}
16/98
CQF Module 3: Option Valuation Models Connecting the Dots
8 8
TT
17/98
Everything depends on the probability p
IP
Pdefine the probability
measure
is
Changing measure easy
take o s and p E 0,1
Before answering this question, let’s try the same approach as in Lecture 3.3,
i.e. determine the equivalent martingale measure Q and price the option in this
measure.
18/98
CQF Module 3: Option Valuation Models Connecting the Dots
c s
g
Dsu 1 9 Did So so.q
c s D a
i xD a sad so
19/98
CQF Module 3: Option Valuation Models Connecting the Dots
Since we are in such a simple setting, we will not need to use any “big” result.
We can see that since p 2 (0, 1) and q 2 (0, 1) the P-measure and Q-measure
are indeed equivalent.
20/98
CQF Module 3: Option Valuation Models Connecting the Dots
21/98
CQF Module 3: Option Valuation Models Connecting the Dots
The next step is to find the parameter q such that Q is the equivalent
martingale measure.
S0 = EQ [DST ] FAP
= D (qSu + (1 q)Sd ) (2)
22/98
CQF Module 3: Option Valuation Models Connecting the Dots
V0 = D [p ⇤ Vu + (1 p ⇤ )Vd ]
= EQ [D max(ST E , 0)]
23/98
CQF Module 3: Option Valuation Models Connecting the Dots
24/98
CQF Module 3: Option Valuation Models Connecting the Dots
In this section, we will explore the connection between the binomial model and
the PDE approach by deducing the Black-Scholes PDE from the
Cox-Ross-Rubinstein implementation of the binomial model.
25/98
CQF Module 3: Option Valuation Models Connecting the Dots
There are di↵erent implementations of the binomial model, due to Cox, Ross
and Rubinstien (79), Jarrow-Rudd (83) and Leisen-Reiner (96). Each of these
implementation distinguishes itself with a specific choice of parameters for u, d
and sometimes p.
26/98
CQF Module 3: Option Valuation Models Connecting the Dots
Bsn
the discounted
GBP under Q for stock price
o
CRR St
The implementation we will use in this lecture is the Cox, Ross and Rubinstien
(CRR). In the CRR model,
p
o
I u := e t
;
p
I d := e t
= u1 ;
I D := e r t
.
where r is the instantaneous risk-free rate and
of the stock (log) return. o is the instantaneous volatility
27/98
CQF Module 3: Option Valuation Models Connecting the Dots
With this choice, our binomial model is consistent with the assumptions made
by Black and Scholes.
28/98
CQF Module 3: Option Valuation Models Connecting the Dots
f
(1/D)(u d)V = (1/D)(Vu Vd ) + (uVd dVu ) (5)
29/98
CQF Module 3: Option Valuation Models Connecting the Dots
O Stf out
30/98
CQF Module 3: Option Valuation Models Connecting the Dots
31/98
CQF Module 3: Option Valuation Models Connecting the Dots
ti ft Sts su
p Je
We now perform a Taylor expansion of Vu : I
@V @V 1 @2V
00⇡
Q
( S u )2
0 9
Vu V+ t+ Su + 2
@t @S 2 @S
where
Sa s errs
D Su =
=
Su S
D
⇣ p
S e t
1
⌘
I Taylor
✓ ◆
p 1 2
⇡ S t+ t
2
I
and hence
( S u )2 ⇡ S2 2
t
32/98
CQF Module 3: Option Valuation Models Connecting the Dots
Itis
Similarly, for Vd :
SE
@V @V 1 @2V
Va V test StSSa
g
Vd ⇡ V+
@t
t+ Sd +
@S O 2 @S 2
( S d )2
where
O
S d =
=
Sd S
⇣
S e
p
t
1
⌘
L Taylor
✓ ◆
p 1 2
⇡ S t+ t
2
and hence
O
( S d )2 S2 2
⇡ t
VK.SI
I test St 33/98
0
CQF Module 3: Option Valuation Models Connecting the Dots
34/98
CQF Module 3: Option Valuation Models Connecting the Dots
Developing
p (make sure to keep all the terms), rearranging and dividing by
2 t, we get 0 SH 271
of to to
2
@V @V 1 2 @ V
+ t + rS t+ S2 t rV t ⇡ 0
@t @S 2 @S 2
go.pt
divide by
St f a
81 try 102528 rv
87 0 s off trsooftzrs.gg r
35/98
B
CQF Module 3: Option Valuation Models Connecting the Dots
36/98
CQF Module 3: Option Valuation Models Connecting the Dots
We have just seen that the Black-Scholes PDE is “contained” in the binomial
model’s delta-hedging valuation equation (1).
In fact, we could venture further and assert that absence of arbitrage, the
necessary condition for delta hedging to be possible, implies the existence of a
“Black-Scholes”-type PDE.
37/98
CQF Module 3: Option Valuation Models Connecting the Dots
00
4. The binomial model and the Black-Scholes formula
38/98
CQF Module 3: Option Valuation Models Connecting the Dots
O
4.1. The N-period binomial model
N St
In
ten
Let’s say that we want to price a European call on a stock using the binomial
model. The call has exercise price E and matures at time T . The stock has
instantaneous volatility and the instantaneous risk-free rate is r .
For pricing purpose, a one-period binomial model is clearly not good enough.
We will therefore consider a N-period binomial model by splitting the lifetime
T of the option into N steps of “length” t with
T
t=
N
39/98
CQF Module 3: Option Valuation Models Connecting the Dots
1111111 40/98
CQF Module 3: Option Valuation Models Connecting the Dots
At each time step, the stock can go up with probability p and down with
probability 1 p.
Our model of choice will once again be the CRR, so that the up-move,
down-move and discount factor for each time step t is given by:
p
I u := e t
;
p
I d := e t
= u1 ;
I D := e r t
.
41/98
CQF Module 3: Option Valuation Models Connecting the Dots
Since we know the one-step binomial valuation model very well, the natural
way of disentangling the N-step pricing problem is to proceed recursively, one
step at a time, from expiry backwards in time to time 0.
For each time step, we need to solve the option valuation problem a given
number of times. For example, at time step N k, we have N k + 1 option
values to compute.
Let’s introduce some notation so that we can find our way more easily through
the binomial tree.
42/98
CQF Module 3: Option Valuation Models Connecting the Dots
8
o
43/98
CQF Module 3: Option Valuation Models Connecting the Dots
0
ON
a
o
f
44/98
CQF Module 3: Option Valuation Models Connecting the Dots
45/98
CQF Module 3: Option Valuation Models Connecting the Dots
46/98
CQF Module 3: Option Valuation Models Connecting the Dots
47/98
CQF Module 3: Option Valuation Models Connecting the Dots
We will use the number of time steps (counted backwards) and the stock price
movement as a system of coordinates of the form
c
(Time Steps, Stock Movement)
to uniquely identify each node in the tree.
go
I k steps back in time from expiry;
I j asset steps up from the lowest stock price for this time step;
48/98
CQF Module 3: Option Valuation Models Connecting the Dots
Ne N
4.2.1 Pricing the Option at Step N 1
At time step N 1, we just have one hedging decision to make before expiry
(corresponding to time N).
49/98
CQF Module 3: Option Valuation Models Connecting the Dots
ESCN
a N it Y Max
E o
50/98
CQF Module 3: Option Valuation Models Connecting the Dots
IN It 1
Considering our binomial option pricing formula (2), and adapting it to our
N-period setting we get the value of the option 1 step from expiry.
51/98
CQF Module 3: Option Valuation Models Connecting the Dots
52/98
CQF Module 3: Option Valuation Models Connecting the Dots
This is rather simple since time step N represents the terminal time T , and
hence V (N, j + 1) and V (N, j) are respectively the option payo↵s:
53/98
CQF Module 3: Option Valuation Models Connecting the Dots
54/98
CQF Module 3: Option Valuation Models Connecting the Dots
d
Figure: A possible path leading to S(N, j)
N So
south
Node O
S n o
So
55/98
CQF Module 3: Option Valuation Models Connecting the Dots
S(N, j) = S0 u j d N j
56/98
CQF Module 3: Option Valuation Models Connecting the Dots
V (N 1, j) = D [p ⇤ max [S(N, j + 1) E , 0]
+(1 p ⇤8D
) max [S(N, j) E , 0]]
57/98
CQF Module 3: Option Valuation Models Connecting the Dots
0
4.2.2 Pricing the Option at Step N 2
58/98
CQF Module 3: Option Valuation Models Connecting the Dots
tfY
Ven i j
59/98
CQF Module 3: Option Valuation Models Connecting the Dots
Again, we use our binomial option pricing formula (2). Adapting it to our
N-period setting, we get
V (N
I
2, j) = D [p ⇤ V (N 1, j + 1) + (1 p ⇤ )V (N 1, j)]
60/98
IN 2,0 DIptVCNDDt pHvcn.i
DIp.IDOIP.V In I i pt renin
H HIDE INPUTTING p
2 PCI PT VIN jt
1
N j 2
DIp I pt VIN j
ME N
a
pt
ATTE s 2 pre 1
FLEW is
CQF Module 3: Option Valuation Models Connecting the Dots
61/98
CQF Module 3: Option Valuation Models Connecting the Dots
... and we have just computed these two values in the previous step.
Developing our expression for the option value:
V (N 2, j) = D [p ⇤ V (N 1, j + 1) + (1 p ⇤ )V (N 1, j)]
= D [p ⇤ (D [p ⇤ max [S(N, j + 2) E , 0]
⇤
+ (1 p ) max [S(N, j + 1) E , 0]])
+(1 p ⇤ ) (D [p ⇤ max [S(N, j + 1) E , 0]
+(1 p ⇤ ) max [S(N, j) E , 0]])]
⇣
= D (p ⇤ )2 max [S(N, j + 2) E , 0]
2
62/98
CQF Module 3: Option Valuation Models Connecting the Dots
is the number of combinations (i.e. the number of ways one can pick i objects
from a bag of n objects when the order in which the objects are picked does
not matter).
63/98
I
CQF Module 3: Option Valuation Models Connecting the Dots
CEE Cit
VIN je TOTTI PIVEN jt1
N2 j DF
YEEIrcn.is
With this in mind, and noting that Cm0 = Cmm = 1, we could express formula (6)
as
V (N 2, j)
2
!
X
= D2 C2i (p ⇤ )i (1 p ⇤ )2 i
max [S(N, j + i) E , 0] (7)
i=0
64/98
CQF Module 3: Option Valuation Models Connecting the Dots
4.2.4 Step N k
jth
If our intuition is correct, then the option value V (N k, j) at the time step
N k and asset step j with 0 j N can be expressed as:
V (N k, j)
k
!
X
= Dk Cki (p ⇤ )i (1 p ⇤ )k i
max [S(N, j
Do + i) E , 0] (8)
i=0
65/98
CQF Module 3: Option Valuation Models Connecting the Dots
66/98
CQF Module 3: Option Valuation Models Connecting the Dots
Using the one-step formula for the binomial model (2), we know that the
option value V (N k, j) at the time step N k and asset step j with
0 j N is equal to:
V (N k, j) = D (p ⇤ V (N (k 1), j + 1)
+(1 p ⇤ )V (N (k 1), j)) (9)
67/98
CQF Module 3: Option Valuation Models Connecting the Dots
If our intuition is correct, then the same type of formula as (8) applies to the
option values at nodes (N (k 1), j + 1) and (N (k 1), j). Hence, we
conjecture that
V (N (k 1), j + 1)
k 1
!
X ⇤ i
= Dk 1
Cki 1 (p ) (1 p ⇤ )k 1 i
max [S(N, j+1 + i) E , 0]
i=0
(10)
and
V (N (k 1), j)
k 1
!
X ⇤ i
= Dk 1
Cki 1 (p ) (1 p ⇤ )k 1 i
max [S(N, j + i) E , 0]
i=0
(11)
68/98
CQF Module 3: Option Valuation Models Connecting the Dots
V (N k, j)
" k 1
⇤
X ⇤ i
= D p D k 1
Cki 1 (p ) (1 p ⇤ )k 1 i
max
i=0
⇥ [S(N, j + 1 + i) E , 0])
+(1 p ⇤ )D k 1
k 1
!#
X ⇤ i
⇥ Cki 1 (p ) (1 p ⇤ )k 1 i
max [S(N, j + i) E , 0]
i=0
69/98
CQF Module 3: Option Valuation Models Connecting the Dots
V (N k, j)
k 1
X ⇤ i+1
= D k
Cki 1 (p ) (1 p ⇤ )k 1 i
max [S(N, j + 1 + i) E , 0]
i=0
k 1
!
X ⇤ i
+ Cki 1 (p ) (1 p ⇤ )k i
max [S(N, j + i) E , 0] (12)
i=0
70/98
CQF Module 3: Option Valuation Models Connecting the Dots
max [S(N, j + 1 + i) E , 0]
max [S(N, j + i) E , 0]
71/98
CQF Module 3: Option Valuation Models Connecting the Dots
To be able to add these two terms together, we will need to change the
indexing of the first term from
k 1
X ⇤ i+1
Cki 1 (p ) (1 p ⇤ )k 1 i
max [S(N, j + 1 + i) E , 0]
i=0
to
k
X ⇤ i
Cki 1
1 (p ) (1 p ⇤ )k i
max [S(N, j + i) E , 0]
i=1
by setting “i + 1 ! i”.
72/98
CQF Module 3: Option Valuation Models Connecting the Dots
V (N k, j)
k
X ⇤ i
= D k
Cki 1
1 (p ) (1 p ⇤ )k i
max [S(N, j + i) E , 0]
i=1
k 1
!
X ⇤ i
+ Cki 1 (p ) (1 p ⇤ )k i
max [S(N, j + i) E , 0]
i=0
73/98
CQF Module 3: Option Valuation Models Connecting the Dots
Developing, we get
V (N k, j)
⇣
= D (p ⇤ )k max [S(N, j + k)
k
E , 0]
k 1
X ⇤ i
+ Cki 1
1 (p ) (1 p ⇤ )k i
max [S(N, j + i) E , 0]
i=1
k 1
X ⇤ i
+ Cki 1 (p ) (1 p ⇤ )k i
max [S(N, j + i) E , 0]
i=1
⌘
+(1 p ⇤ )k max [S(N, j) E , 0]
74/98
CQF Module 3: Option Valuation Models Connecting the Dots
Recalling that
I Cmj 1 + Cmj = Cm+1
j
;
I Cm0 = Cmm = 1
we can now add term by term to obtain:
V (N k, j)
k
!
X
= Dk Cki (p ⇤ )i (1 p ⇤ )k i
max [S(N, j + i) E , 0]
i=0
75/98
CQF Module 3: Option Valuation Models Connecting the Dots
of
We can get the pricing formula for time 0 by setting k = N and j = 0 into (13):
V (0, 0)
function
N
X
froba I ! Payoff
y g
= DN CNi (p ⇤ )i (1 p ⇤ )N i
max [S(N, i) E , 0]
i=0
u
p
Binomial probability
Xu BCN p
PEX i Cai pay i pin
76/98
CQF Module 3: Option Valuation Models Connecting the Dots
CNi (p ⇤ )i (1 p ⇤ )N i
are probabilities under the Binomial distribution with N trials and probability of
success p ⇤ , B(N, p ⇤ ). Specifically, if X ⇠ B(N, p ⇤ ), then
P[X = i] = CNi (p ⇤ )i (1 p ⇤ )N i
77/98
CQF Module 3: Option Valuation Models Connecting the Dots
RN Moba
i=1
9 9Moba
then formula (13) can be viewed as the following expectation under a Binomial
distribution:
0dam
⇤
V (0, 0) = D N EB(N,p ) [max [ST E , 0]] (13)
78/98
m 07
o D
N
EB Man St E
MPD
DN EBC St E A St E
D
LILITH
ÉjEHst
BNP A
E DN E St E
StZET RN Moba
EDNP of exercise
Ben
Sizes
DN e
N it Nt
A St e
If CN
Ry 44933
A St es
p Die
oc
p s t
I so l1 p M
ICip s
So EBM P
Ags e
S PpB É e
CQF Module 3: Option Valuation Models Connecting the Dots
V (0, 0)
N
X
= S0 D N
CNi (p ⇤ )i (1 p ⇤ )N i u i d N i 1S(N,i)>E
i=0
N
X
ED N
CNi (p ⇤ )i (1 p ⇤ )N i 1S(N,i)>E
i=0
79/98
CQF Module 3: Option Valuation Models Connecting the Dots
Regrouping,
V (0, 0)
N
X
= S0 CNi (Dp ⇤ u)i (D [1 p ⇤ ] d)N i 1S(N,i)>E
i=0
N
X
ED N
CNi (p ⇤ )i (1 p ⇤ )N i 1S(N,i)>E
i=0
80/98
CQF Module 3: Option Valuation Models Connecting the Dots
Define
1
⇤ D
d
p̄ := Dup = Du
u d
and note that
1
⇤ u D
Dd(1 p ) = Dd
u d
= 1 p̄
81/98
CQF Module 3: Option Valuation Models Connecting the Dots
then,
V (0, 0)
N
X
= S0 CNi (p̄)i (1 p̄)N i 1S(N,i)>E
i=0
N
X
ED N
CNi (p ⇤ )i (1 p ⇤ )N i 1S(N,i)>E
i=0
and the parameter p̄ uniquely defines a new measure P̄ (and a new Binomial
distribution B(N, p̄)).
82/98
CQF Module 3: Option Valuation Models Connecting the Dots
83/98
CQF Module 3: Option Valuation Models Connecting the Dots
Cro
We are now very close to the Black-Scholes formula...
The intuition for this convergence is that by the Central Limit Theorem, the
Binomial distribution converges to the Normal distribution as N ! 1. Most of
the remaining work consists in verifying that we e↵ectively get d1 and d2 out of
p̄ and p ⇤ .
84/98
CQF Module 3: Option Valuation Models Connecting the Dots
We have just seen that the binomial model’s risk-neutral valuation equation (2)
tends to the Black-Scholes formula in the limit as the number of time steps
tends to infinity.
85/98
CQF Module 3: Option Valuation Models Connecting the Dots
So far, we have seen that the binomial model connects two seemingly di↵erent
aspects of derivatives valuation:
I the binomial model and the martingale approach coincide regardless of the
specific implementation we choose for the binomial model.
I when we adopt the CRR implementation, the binomial model’s
no-arbitrage pricing formula (1) converges to the Black-Scholes PDE;
I when we adopt the CRR implementation, the binomial model’s risk-neutral
pricing formula (2) converges to the Black-Scholes formula;
So, what is the BIG idea here?
86/98
CQF Module 3: Option Valuation Models Connecting the Dots
87/98
CQF Module 3: Option Valuation Models Connecting the Dots
O D
5.1. No Arbitrage implies that we can find a Martingale Measure
D hedging RN pricing
At the begining of the lecture (slide 14), we noted that the no-arbitrage
valuation equation (1) could be rewritten as the risk-neutral valuation
equation (2) by defining a probability p ⇤
88/98
CQF Module 3: Option Valuation Models Connecting the Dots
89/98
CQF Module 3: Option Valuation Models Connecting the Dots
Pr E 0,11
O
exists because p ⇤ 1. This implies that
js.EE
1
d 1
E
⇤ D
p = 1,u
sues
u d D
Hence d < u 1
D
. O
Since D is risk-free, an arbitrage opportunity may exist: shortselling the stock
and investing in the bank account guarantees a minimum return equal to
1
D
u 0. And even if academic arbitrage does not exist, then the
”probabilistic” arbitrage does exists: why invest in a risky asset that can at best
give you a risk-free return when you could get the risk-free return for sure2 !
2
remember that p ⇤ and p are not the same thing
90/98
CQF Module 3: Option Valuation Models Connecting the Dots
O
p ⇤ 0. This implies that
1
d 1
O
⇤ D
p = 0, d
tsao
u d D
1
Hence d < u.
f Sd
D
Sh
An arbitrage opportunity may also exist: buying the stock and financing the
purchase by borrowing from the bank account guarantees a minimum return
equal to d D1 0 with no risk of loss.
91/98
CQF Module 3: Option Valuation Models Connecting the Dots
92/98
CQF Module 3: Option Valuation Models Connecting the Dots
The BIG idea that the No Arbitrage and Equivalent Martingale Measure
approaches are equivalent works well enough in the (continuous) Black-Scholes
setting and the binomial model because they are examples of complete
markets.
93/98
CQF Module 3: Option Valuation Models Connecting the Dots
of rish
6.1. Complete Markets
N sources
The option is exposed to one source of risk, the risk of the underlying share
modelled as the Brownian motion X (t). Luckily, we can trade and hedge this
risk by trading the stock.
i to
94/98
CQF Module 3: Option Valuation Models Connecting the Dots
95/98
CQF Module 3: Option Valuation Models Connecting the Dots
N sources of risk
M C N assets
Incomplete markets are markets in which you cannot find enough tradeable
securities to hedge the risk(s) of the derivative you are trying to price.
The simplest example of an incomplete market is the bond market. One can
view bond as a derivative on some (stochastic) interest rates. Since interest
rates are not directly tradeable, the only way we have to hedge/replicate a
bond B1 is by trading a related bond B2 exposed to the same interest rate risk.
96/98
CQF Module 3: Option Valuation Models Connecting the Dots
The problem here is since we do not know how to price a bond to start with,
using bond B2 as a hedging instrument for bond B1 is far from solving all our
problems, and we will have to make some assumptions if we want to solve the
pricing problem.
Port
s met
É
g
97/98
CQF Module 3: Option Valuation Models Connecting the Dots
I the binomial model and the martingale approach coincide regardless of the
specific implementation we choose for the binomial model.
I when we adopt the CRR implementation, the binomial model’s risk-neutral
pricing formula (2) converges to the Black-Scholes formula;
I when we adopt the CRR implementation, the binomial model’s
no-arbitrage pricing formula (1) converges to the Black-Scholes PDE;
I In complete markets, the no-arbitrage approach and the martingale
measure approach are strictly equivalent.
98/98