Академический Документы
Профессиональный Документы
Культура Документы
Lecture Objectives
Pricing Interest Rate Derivatives
How one can use our implied BDT binomial trees to calculate
options on pure discount bound
Swaption values
COMPUTATIONAL FINANCE
MSc
©Finbarr Murphy 2007
Agenda
Page
3
COMPUTATIONAL FINANCE
MSc
3
©Finbarr Murphy 2007
4
©Finbarr Murphy 2007
5
©Finbarr Murphy 2007
6
©Finbarr Murphy 2007
j=1
j=0
COMPUTATIONAL FINANCE
j=-1
j=-2
j=-N
PSN S,-N S=1
MSc
PSN S , j = 1 ∀ nodes j at N S
Now, using backward induction, we can calculate
the price of a Psi,j bond (one that matures at S) for
each node
We only need to work back as far as node T for
European style options
COMPUTATIONAL FINANCE
[
PSi , j = 12 d i , j PSi+1, j+1 + PSi+1, j−1 ]
We have calculated all the di,j’s previously
MSc
8
©Finbarr Murphy 2007
9
©Finbarr Murphy 2007
{
PNT , j = max 0, PSNT , j − K } ∀ j at N T
When the terminal conditions are calculated, we
can work back to find the current value of the
option
COMPUTATIONAL FINANCE
[
Ci , j = 12 d i , j Ci +1, j +1 + Ci +1, j −1 ]
MSc
10
©Finbarr Murphy 2007
11
©Finbarr Murphy 2007
0 1 2 3 4
MSc
12
©Finbarr Murphy 2007
13
©Finbarr Murphy 2007
14
©Finbarr Murphy 2007
payer swaption {
= ∑ QNT , j max 0,1 − BNT , j }
max{0, B − 1}
j
= ∑ QN T , j
receiver swaption
NT , j
j
COMPUTATIONAL FINANCE
MSc
15
©Finbarr Murphy 2007
Recommended Texts
Required/Recommended
Clewlow, L. and Strickland, C. (1996) Implementing derivative
models, 1st ed., John Wiley and Sons Ltd.
— Chapter 8
Additional/Useful
COMPUTATIONAL FINANCE
MSc
16