Princeton Financial Math PDF
Princeton Financial Math PDF
Princeton Financial Math PDF
Dept. of Eng. Sci. and App. Math., Northwestern University, Evanston, IL 60208, USA. email: [email protected]
Chapter 1
Administrivia
1.1
Lecturers
1. Rene
Carmona
(Princeton
University)
http://www.princeton.edu/ rcarmona/
2. Rama Cont (Imperial College London)
3. Michael Coulon (Princeton University)
4. Jean-Pierre Fouque (UC Santa Barbara)
5. Johannes Muhle-Karbe (ETH Zurich)
6. Alexander Schied (University of Mannheim)
7. Ronnie Sircar (Princeton University)
8. Glen Swindle (Scoville Risk Partners LLC & NYU)
1.2
1.
2.
3.
4.
5.
6.
7.
8.
Times
9-9:50 - Lecture
10-10:50 - Lecture
11-11:30 - Break
11:30-12:20 - Lecture
12:30-14:00 - Lunch
?? 13:30-14:00 - Special Q&A Session ??
14:00-14:50 - Lecture
15:00-15:50 - Guest Lecture
1.3
Locations
Links
1. https://orfe.princeton.edu/rtg/fmsummer/reading
2. https://github.com/traviscj/fmsummer
Part I
Systemic Risk
Chapter 2
2.1
History
4. If we consider
0 < t1 < ... < tn T
(2.5)
(Mean-
(2.6)
(2.7)
such that
2. 90s:
(a) Local Volatility
(b) Stochastic Volatility
a = inf{t > 0 : Wt a}
(2.2)
Okay, but usually we dont know the , and there is some noise! (We are really looking for Wt = a)
We can instead think
How can we add noise? Since is the return, maybe by adding
some white noise
{a t} = { max Ws a}
0st
(2.11)
(2.3)
Then
t = Wtt + (2a Wt)t>
W
where the Noise term is given by Brownian Motion, which has
the form
is a Brownian Motion. RP.
dWt
(2.4)
Now suppose we want to find the probability:
with > 0, and (Wt)t0 for t T . The properties of Brownian
Motion:
1. W0 = 0
2. Wt is continuous
3. Independent, increments
(2.10)
P( t, |Wt a| > b)
=P( t, Wt > a + b) + P( t, Wt < a b)
=2P( t, Wt > a + b)
=2N(0,t)(a b)
4
(2.12)
(2.13)
(2.14)
(2.15)
(2.16)
(2.17)
A few remarks:
1. is predictable. We say that is announced by a sequence
n, the hitting time of a n1 .
2. Large Deviations: Consider the probability of a very large
deviation (a )
a2
P(a t) e 2t
(2.18)
Chapter 3
3.1
Joint Distributions
3.2
Consider the joint distribution of (, Wt). We can think of this as Now consider
dSt = St(dt + dWt)
(3.16)
P(Wt = v)
if v > a
g(v)
00
P( t, Wt = v) =
=
which is a stochastic differential equation. We should think of this
P(Wt = 2a v) if v < a
g(2a v) as a convient notation for something more complicated. Basically,
(3.1)
Z t
For nonstandard Brownian Motions,
StdWt
SadWa
(3.17)
0
Xt = x + t + Wt
(3.2)
We will use Itos lemma which lets us do the chain rule with
And then
= inf{t > 0, xt a}
(3.3) a brownian motion:
1
So then,
dg(Wt) = g0(Wt)dWt + g00(Wt)dt
(3.18)
2
xt a (x + t + Wt a)
(3.4)
t + Wt a x
(3.5) where g(t, Wt) is once differentiable in t and twice differentiable
in Wt. Then if we have
ax
(3.6)
t + wt
dXt = tdt + tdWt
(3.19)
Define = , and a
=
Then we have that
ax
.
then
Wt + t
1
dg(Xt) = g0(Xt)dXt + g00(Xt)dhxit
2
(3.7)
Then an SDE like
Wt
Mt = eWt 2
Then
E(Mt ) = 1
(3.20)
(3.21)
(3.9)
2
2
)t
+ Wt
(3.22)
and
P . So next,
E (x/Fs) =
1
E(XMt /Fs)
Ms
(3.11)
Defaultable Bond
E eiu(Wt Ws ) = e 2 (ts)
(3.12) time T then we have no payout, otherwise get 1.) So then the
price of the bond is
Why do we care about all of that? Well, we can do the following:
PD
(3.24)
(0,T ) = E (>T ) = P ( > T ).
= inf{t > 0, Wt a
}
(3.13)
So now we consider
Then
2
{ inf S0e(r 2 )t+Wt > 0}
(3.25)
dP
0<tT
P( t) = E(t) = E t
(3.14)
dP
By taking the logarithm, we get a nonstandard brownian motion,
which we can evaluate. By some computation, we can get
We can use the joint distribution of (, Wt ).
"
#
1 2r2
2(ax))
a x t
a x + t
S0
+
rT
= N(
) + e 2 N(
) (3.15)
P (0, T ) = e
N(d2 )
N(d2 )
(3.26)
t
t
D
6
with
d
(3.27)
x
T W
t
2 =
t
N
The main ingredients here were reflection principle and change
of measure. Alternatively, one could do this completely with
partial differential equations.
3.5 Yield
1
PD (0, T )
log
T
P(0, T )
(3.28)
Example
(3.29)
Toy Model
(3.31)
easdWp
(3.32)
0
2
(3.34)
(3.35)
Chapter 4
N
p
a X j
(xt xit)dt + (dWt0 + 1 2dWti)
N j=1
(4.2)
(4.3)
dXt = dWt +
dWti
N
i=1
Other models
4.1.1
(4.11)
dXti = hV 0(Xti)dt + a
N
X
(Xti Xtj )dt + dWti
(4.12)
j=1
(4.4)
4.2
Games
dXti =
N
a X j
(X Xti)dt + ti dt + Noise
N j=1 t
(4.13)
This gives rise to a flocking behaviorall the banks will follow
the meanat least as long as the mean is large.
Now to prevent the bank from borrowing infinite money, we
Consider the case where = 0 which gives
must introduce a cost:
dBt.
(4.6)
T
X
N
(it)2
Ji =
dt
(4.14)
2
We will count a bank as defaulting when it hits some default
0
amount D < 0. We can consider the event
where we would of course minimize J i. But now of course we
min Xt < D
(4.7) must include an incentiveotherwise, we would just never borrow.
0tT
So we modify to
And in particular, we can calculate the probability of default,
D2 N
D N
Ji =
and
(4.9)
Ji =
D
P(
t) = 2N ( )
T
(4.15)
T
X
(t)2
t Xti))dt
( i qti (X
2
0
(4.10)
8
T
X
(t)2
t Xti) + (X
t Xti)2)dt
( i qti (X
2
2
0
(4.16)
4.2. GAMES
some other cost at the very end, and also take the expectation,
Lets solve it:
which gives:
( q2)(exp((T t)) 1) C(+ exp((T t)) )
( T
t = )
X (t)2
( exp((T t)) +) C(1 N12 )(exp((T t)) 1)
t X i) + (X
t X i)2)dt + c (X
T X i )2
Ji = E
( i qti (X
t
t
T
(4.28)
2
2
2
0
where
(4.17)
We can not take too small, we must have q2.
=+
(4.29)
(4.30)
= (a + q) R
Lions-Lasry for the N case. This is interestingwe pass
to the limit to get an easier problem. Another approach is from
1
R =(a + q)2 + (1 2 )( q2) > 0
(4.31)
Carmona-Delarue. But it turns out that we can solve this game
N
for N finite, via a dynamic programming approach.
Where are we at here? First, we have
We start with ti = i(t, Xt). The dynamic programming
approach means also introducing the quantities
1
Xti)
!
ti = (q + (1 + )t)(X
(4.32)
Z T
N
i
V (t, x) = min Ex
as above + (terminal cond)|Ft
and also
t
(4.18)
N
a X j
This is governed by the Hamilton-Jacobi-Bellman (?) equation:
(X Xti)dt + (above...)dt + Noise
(4.33)
dXti =
N j=1 t
Z
N
X
(i)2
2 X X 2
i
i
T V +
(a(
x xj ) + i)xj V i +
+ (1 )2[ed]
qhere.
(
x xi) + (
x xi)2 = 0
j,k I+missed
one
2 j
2
2
j=1
k
Could do T because the terminal time is annoying. One
(4.19) option is to take c = 0, and optimizing T1 JTi . Taking T
[Ed: there was a random xj ,xk V i floating around here.. I think mean the effective rate of borrowing and lending is
it goes after the jk ) part?] Also jk is the Kronecker delta.
( q2)
Because we want the infimum, we just take the gradient. And
(4.34)
i
we want it with respect to so
xi V i+iq(
xi) = 0 =
i = xi V i+q(
xi),
i = 1, ..,We
N could also take N , but this will be on Friday.
(4.20) Tomorrow will be a different approach and compare the two.
But this assumes that we know V i, which we do not! So next
we consider
N
X
1
1
2 X X 2
tV i+
(a + q)(
x xj ) xj V j xj V i+
+ (1 2)jk xj xk V i+ (q2)(
xxi)2+ (xi V i)2
2
2
2
j=1
j
k
(4.21)
Well try an Ansatz here:
t
(
x xi)2 + t
2
(4.22)
V i(T, x) T = C, T = 0
(4.23)
V i(t, x) =
and impose that
which gives
xj V i = t(
and
xj ,xk Vti = t(
1
ij )(
x xi)
N
1
1
ij )( ik )
N
N
(4.24)
(4.25)
which gives
0t =2(a + q)t + (1
0t = 2(1 2)(1
1
)2 ( q2),
N2 t
1
)t,
N
T = 0
T = C
(4.26)
(4.27)
Chapter 5
Consider
So we will consider
Z T
=
(t)2
inf E
qt(mt Xt) + (mt Xt)2 dt+(otherstuff)
2
2
0
for i = 1, .., N. One way to handle this is the open-loop
(5.11)
feedback approach, which introduces
Then
(Z
) the Hamiltonian is
T
X
i
c
2
( ) qi(
Ji = E
xt xit) +
(
xt xit)2)dt + (
xT xt)2
H
=
[]
y
+
q(mt x) + (t x)2
(5.12)
2
2
0
2
2
(5.2)
Another way is the dynamic programming approach where and again well set up the hamiltonians
we introduce V i(t, x). A more different way is the closed
H
loop approach due to Pontugigin (spelling?). This is also a
dt + (noise)
X0 = x0
(5.13)
dXt =
Forward-Backward DE approach. It works by introducing a
y
Hamiltonian for each player i:
H
dt + (noise)
YT = (0orT C)
(5.14)
dYt =
x
N
X
1
(5.15)
H i(~x,~yi, ~) =
((
xxk )+k )yik + (i)2qi(
xxi)+ (
xxi)2
2
2
k=1
(5.3) Now then, because E(mt Xt) = 0, we have E(Yt) = 0. Using
k
k
Then imposing that for k =
6 i, we have = (t, x). All of this all of that, we can find E(Xt) = mt (no surprise) Then we get
some equation like
becomes the stochastic differential equations
t = tXtdt
(5.16)
H i
dXi =
dt
(5.4) (but this equation is wrong, there is a q somewhere)
y
Two references:
1
H
i,j
i,j
i
tY = C(
1. Carmona-Delarue
xT xT )( ij )
dYt = j dt + ZtdW
T
x
N
2. Mean Field Games: Lions-Cassry Cassy
(5.5)
dXti
a(
xt xit)dt + (dWt0
p
+ 1 2dWti) + idt (5.1)
)
yik qi( ij )+(
xxi)( ij )
kj
j
x
N
N
N
k=1
(5.6)
and
"N
#
X
X
1
1
ij
ik
i 1
i
dYt =
(a + y)( kj )Yt q ( ij ) +
(
xt xt)( ij ) dt+ZtdWt
N
N
N
k=1
(5.7)
To solve, we take the anstaz
Ytij = t(
1
ij )(
xt xit)
N
(5.8)
Plug that in, then we get some expression for dYtij . Eventually,
we get the differential equation from
t0 = 2(a + q)t + (1
1 2
) ( q2),
n2 t
T = C
(5.9)
Chapter 6
6.1
(6.4)
(6.5)
n p
n
X
X
dSt = (
i)dt + 2
XtdWti
PDE:
Equation: D: 2 StdBt.
tu = 0 + T.C. + B.C.
(6.6)
Then we have
!
n
n q
(Insert plot: horizontal: (0, T ) , x1 from some value to infinity, etc.)
X
X
xitdWti
dS
=
dt
+
0
+
2
t
i
6.2 T. Ichibu Paper
i=1
Which is equivalent to
n
X
q
(xjt xit)pij (Xt)dt + 2 XtidWti
(6.13)
(6.14)
(6.12)
(6.7)
j=1
(6.15)
(6.16)
i=1
n
X
(6.17)
i=1
Quick review
e 2 z 2 dz
u(y) =
1
(6.10)
11
(6.19)
12
1X i
X0
n n
i=1
lim
(6.21)
Xti Xtk pk,j (Xt)
(6.22)
j=1 i=1
???
Chapter 7
Rama Cont
Microprudential approach
Liability Chain
13
Chapter 8
14
Part II
15
Chapter 9
Storable vs non-storable
continuous vs seasonal production (or demand)
local vs regional vs global
elasticity of supply or demand to price
so
F (t, T ) = Ste(r)(T t)
(9.5)
(9.6)
(9.7)
(9.8)
(9.9)
17
which implies
dFt
= dWt
Ft
(9.11)
(9.12)
(9.13)
2
yt)dt + dWt
2
(9.14)
1
F (t, T ) = EQ
t [St ] = exp{mean + variance}
2
(9.16)
(9.17)
Chapter 10
10.1
10.2
So far, two simple one-factor spot price model. The two main These try to correct some of the weaknesses of the volatility
structures, etc. See Schwortz (97) for two factors. We need short
approaches are
term shocks which are not mean reverting but long term which is.
1. Generalized Brownian Motion (no mean reversion)
dSt =(r t)Stdt + StdWt
(10.5)
dSt
dF (t, T )
= (r )dt + dWt =
= dWt (10.1)
dt =( t)dt +
dWt
(10.6)
St
f(t, T )
dWtdWt =dt
(10.7)
2. Exponential OU (mean reverting)
The advantage is that this is a combination of mean reverting
and non-mean reverting(which is basically just saying short term
dSt
dF (t, T )
= (log St)dt+dWt =
= e(T t)dWt and long term.)
St
F (t, T )
(10.2) 10.2.1 Schwartz & Smith (00)
Here, the coefficients of the stochastic differential equations Instead:
St = exp{Xt + Yt}
(10.8)
for F (t, T ) describe the vol term structure.
The key observation here is that:
where Xt is arithmetic brownian motion and Yt is O.U.
Both models are lognormal and find find
mean reversion in St decaying vol of F (t, T ). (10.3)
F (t, T ) = EtQ[St]
(10.9)
Picture goes here: time is horizontal axis. GBM is a constant y
value, exponential OU shows a decay. Typical data ( either implied We can show the equivalence with Schwartz (97).
or historical) show somewhat slower decay of the forward curves.
10.2.2 Extension: 3 factor
Notes:
1. Why the mean reversion of the spot prices? We can make We can also add a Vasicek model for rt. But this one doesnt
economic arguments about short term shocks vs long term really matter because interest rates have only minuscule amounts
of volatility relative to the volatility of the commodity.
equilibrium (production/consumption levels).
2. Why not mean reversion in F (t, T ) itself? Its a traded
derivative, it must satisfy the martingale condition. (Forwards
are martingales, at least for fixed T )
3. What about F (t, t+) (fixed tau)? For a start, its not a traded
contract. Therefore, it is likely that it could be mean reverting.
And of course, as 0, we should get the spot price.
Any exceptions? In theory, we can have something that mean
reverts under P but not under Q. But this is quite unusual or artificial. Why? Drift under P with a mean reverting process gives a
market price at risk . That is, drift under P to drift under Q gives
10.3
Calibration
Yt)dt
1. Normal backwardation: > 0 (this is hedging pressure where W (i) are independent brownian motions for simplicity.
t
from risk producers pushing F (t, T ) downwards). See Now we must choose:
Inconvenience Yield and The Theory of Normal Contango
- Bouchuev, 2012 for an argument that recent change toward 1. The number of factors N
2. Shape of 1(t, T ), ..., N (t, T ).
contango change driven by contango.
2.
Notes on this:
18
19
2 0 i
0
i=1
(10.11)
So we went from the St dynamics to the F (t, T ) dynamics.
Can we go from the F (t, T ) dynamics to the St dynamics?
Recall that St = F (t, t), so
log St = log(F (0, t) +
n
X
[...])
(10.12)
i=1
{ i(u, t)
du +
dWu }dt +
i(t, t)dWt
=
St
t
t
t
0
0
i=1
i=1
(10.13)
which actually implies that St is non-Markovian! (Bad news!)
Unless you have just the right form that the terms cancel.
How can we estimate the volatility functions? 1) From
historical returns, we do Principal Component Analysis. 2) From
options directly. People usually propose a particular parametric
form. One option (which Glen probably uses):
N
dF (t, T ) X
(i)
=
vi(t)i(T )ei (T t)dWt
F (t, T )
i=1
(10.14)
Chapter 11
Commodities - Day 3
11.2
Spread Options
dF (t, T ) X
(i)
=
i(t, T )dWt
F (t, T )
i=1
(11.1)
(11.10)
Option Pricing
(1)
(2)
jJ
(11.6)
(11.14)
The main challenge is to capture the multi-commodity dependence
structure and the link with demand in a mathematically tractable
r(T1 t)
Vt = e
[F (t, T2)(d+) k(d)]
(11.7) model.
Main approaches:
2
log(F (t,T2 )/K)x
Q
2
where d =
and
=
Var
[log
F
(T
,
T
)].
1.
Reduced-Form: Correlated Lognormals, etc (Carmona &
1 2
x
x
Durrleman)
Fine. Now the general forward model is
2. Full Fundamental: Via production cost optimization problem
N Z
N Z T1 3. Structurally: Embedded into a model for spot power:
X
1 X T1 2
log F (T1, T2) N (log F (t, T2)
i (u, T2)du,
i2(u, T2)du)
2 i=1 t
t
Power = f(gas, coal, carbon, ...)
(11.15)
i=1
(11.8)
Some issues using Margrabe for power valuation:
We just need to integrate the squared forward vol over the life
of the option. For example, the Schwartz 1-factor model gives 1. prices negative
Z T1
2. not brownian motion
2 2(T2 T1 )
3. etc...
x2 =
(e(T2 u))2du =
e
e2(T2 t)
2
t
(11.9) 11.2.3 Electricity Markets
Plot vs maturity: Exponential decay from T2 T1 until T2 t. Main point: Electricity is not storable, so we require hourly
(Or, alternatively, integrating the exponential increase from t matching of supply and demand for market clearing. The price
to T1 (and avoiding T1 to T2)).
varies widely across different locations and is
20
Hence, we have
Were shooting for a middle ground which lets us use forwardlooking models and soforth. Also, using historical data is
problematic.
1. Demand Dt: Barlow (2002)
2. Capacity t: Burger et all(2004), Cartea et al (2007)
3. Fuel Prices Gt: Pirrong and Jermakyan(2005) , Aid (2011)
11.2.5
21
Chapter 12
12.1
Main Themes
(12.2)
1. d and F are discount factor
2. S is the current inventory level, s = S 0
3. denotes costs associated with injection and withdrawal. Eg:
= k|s(t)|F (t, t)
4. A denotes allowed controls
This is a super hard problem.
Lets figure out a calendar spread option: time spread option.
Consider options with the following payoff
max F (, T + U) + erU F (, T ), 0
(12.3)
22
Chapter 13
N(t)
Y F (Tn, Tn)
F (t, Tn+1)
Vt =
(13.1)
F
(T
,
T
)
n
n+1
n=1
Working problem: On 18Feb2009 you are asked by the sales
desk to price WTI Dec11 at-the-money European straddles with
expiration on 17Dec2009. This is the simplest incarnation of
nonstandard expiration. Most occurences are much more complex.
What you know: Dec11 is a liquid contract with standard
options expiration date 16Nov2011. NYMEX options market
are visible on this horizon.
13.0.1
Non-Stationarity
Volatility Backwardation
Volatility backwardates.
23
Part III
Portfolio Optimization,
Transaction Costs, Dynamic Games
24
Chapter 14
1.
2.
3.
4.
5.
Setting
Frictionless Control Heuristics (no transaction costs)
Verification via Convex Duality
Control Heuristics with Transaction Costs
Verification via Shadow Prices
(14.8)
sdSs)|Ft |Fs
(14.11)
The safe position implicitly determined by self-financing condition:
t
t0 = x +
"
sdSs tSt
(14.3)
=E
U(Xt
Z
+
sdSs)|Fs
"
=E
U(Xs
t 0
(14.4)
"
E
U(Xs
Z
+
sdSs) +
s
ssds <
(14.12)
sdSs)|Fs
(14.13)
sdSs)|Fs
(14.14)
=v(s, x
s)
(14.15)
(14.16)
(14.17)
25
2 2
vxx)dt + (...)dWt
2 t
(14.18)
26 CHAPTER 14. PORTFOLIO OPTIMIZATION, TRANSACTION COSTS & DYNAMIC GAMES 1 - MUHLE-KARBE
This should be a supermartingale for any t: drift 0. It will
also be a martingale for the optimizer t: with drift = 0. Then
maximize drift pointwise in t. Plug in maximizer. Set to zero.
This yields equations for optimal stategry and value functions.
We can consider a special case: Take the exponential
utility function U(x) = eax, and factor the wealth out via
v(t, x) = eaxv(t, 0), with the constant absolute risk-tolerance
1/a. This gives the constant risky position
t =
a2
(14.19)
22(t T )
U(x) =
) = CE(
) = x +
x1
1
(14.21)
Chapter 15
Lecture 2
15.2
(dt + dWt)
=
2
Xt
(15.1)
(15.6)
This is not compatible with utilities on R: optimal wealth pro- The counterpart with transaction costs is
cesses for exponential utility follows brownian motion with drift:
dt0 = Stdut + (1 )Stddt.
(15.7)
dXt =
(dt
+
dW
)
(15.2)
t
Why is all of this important? Non-trivial spreads are common
2
even in the most liquid markets. Constant position/weight
requires infinite turnover, which causes infinite costs, which
How can we verify?
is not feasible. How can we adapt optimal trading strategies?
15.1.1 Convex Duality
How much welfare is lost? What are the endogenous spreads
in equilibrium between market makers and rebalancing investors?
For a concave function U, we can define the conjugate:
(This is a sort of static game which can determine the bid-ask
V (y) = sup{U(x) xy}
(15.3) spread as an output of a model such as: Find a bid-ask spread by
x>0
examining market maker profit from optimal strategy of traders
given a bid-ask spread.) There is also a new difficulty: complex
Then
horizon dependence. Do not trade if horizon is close. Way out?
Two alternatives:
E [U(XT)] E [V (yYT )] + E [XT YT ] = E [V (yYT )] + EQ [XT] y 1. We could look at the expected utility of the final value of our
(15.4)
portfolio:
for y > 0 and density process Yt of an EMM Q.
E[U(XT )]
(15.8)
R
t
Then Xt = x + 0 sdSs is a local Q-martingale.
but this is a bit fishy...
1. Supermartingale if bounded from below for utilities on R+ 2. Another option is to look at
2. Martingale if risky position is sufficiently integrable for utilities
Z
on R (eg, bounded). This implies admissibility.
E[
etU(ct)dt]
(15.9)
0
In either case, E[U(XT )] E[V (yYT )] + xy.
This upper bound is for any trading strategy , any t, and
which is good, except that it is basically intractable.
any y. Candidate is optimal if bound is tight for
So, as before, well consider the exponential utility
1
1. U 0(Xt) = yYt
U(x) = ex or power utility U(x) = x1 . But infinite
2. E[YT (U 0)1(yYT )] = x
horion to reduce stationary problem: For exponential utilities,
x
we
maximize the equivalent annuity:
For exponential utilities U(x) = e
, we get
h
i
V (y) = y log y 1. The second condition gives y =
1
lim sup
log E eXT max!
(15.10)
exp(xE[YT log YT ]). This yields a simplified upper bound:
T
T
(15.5)
1
lim sup
log E (XT)1 max!
(15.11)
In complete market with unique YT , we can verify equality
T (1 )T
for candidate by direct computation! Sweet!
We can do analogous results for power utilities
This keeps scaling properties in the wealth, and also gets rid
U(x) = x1 /(1 ).
The conjugate comes out to of the horizon dependence.
V (y) = 1
y11/ . Then we look at the expectation, and look
Open questions: What are the control heuristics? How can
we verify it?
at the upper duality bound simplifies.
27
Chapter 16
Lecture 5
dhit
This is determined by a type of portfolio gamma dhSi
. This
t
implies that Active strategies require a wide buffer and turbulent
markets call for closer tracking.
Note that only the current spread t matters here; future
dynamics are hedged at higher orders, but not considered here.
We can do the following calculation: Given t = (St), then
we have
dT = 0(St)dSt + (...)dt
(16.8)
(16.2)
(16.3)
dt = tdt + dWt
(16.4)
NT = t + 0t(Xt Xt)
We can determine the halfwidth to be
31
3Rt dhit
NTt =
t
2 dhSit
(16.6)
(16.7)
28
Chapter 17
17.1
Announcements
Motivation
2. Player 2 objective:
(17.5)
(17.6)
(17.1)
1
R1(q2) = (1 q2 a1)
2
1
R2(q1) = (1 q1 a2)
2
1
q1 = (1 2a1 + a2)
3
1
q2 = (1 2a1 + a1)
3
(17.7)
(17.8)
(17.9)
(17.10)
(17.11)
17.4
30
(17.14)
Dynamic Programming
We can take the two points with two value functions, and
non-zero sum differential games.
17.6.1
Recipe
Introduce
L = q1
q2
x
y
(17.16)
Then
rv = max Lv + q1(1 q1 q2)
(17.17)
(17.18)
q1
and similarly,
q2
(17.19)
and
w
w
rw = max q2(1 q1 q2
) q1
q2
y
x
(17.20)
(17.22)
(17.23)
(17.24)
SIRCAR
Part IV
High
Frequency Trading and Limit Order Book
31
Chapter 18
High-Frequency Trading & Limit Order Book 1 - Carmona: Limit Book Orders
33
Chapter 19
19.1
Hidden Liquidity
1. Smith-Farmer-Guillemot-Kirshnamurthy(SFGK) Model
2. Market orders (buys and sells) arrive according to a Poisson
process with rate /2.
3. Cancellation of existing limit orders: outstanding limit orders
die at a rate .
A little bit better one: Cont-Stoikov-Talreja:
1. P = {1, 2, .., n} is a price model
2. LOB at time t is O(t).
3. Admissible state space:
O = {O Zn; 1 k ` n, Op < 0forp k, Op = 0forp = k..`Op
(19.1)
4. Ask price at time t
PA(t) := (n + 1) inf{p; 1 p n, Op(t) > 0}
(19.2)
order reaches the front of the queue, only the display quantity 6. Mid Price: P (t) = 2 [PA(t) + PB (t)]
= PA(t) PB (t)
is filled. Then the grade (price and quantity filled) is revealed. 7. Bid-ask spread: S(t)
The hidden part is put at the back of the queue. Sometimes
For the sake of simplicity, we assume changes to the Limit Order
an extra execution fee is charged by the exchange.
Book happen one charse at a time. We review the events causing
the LOB state transitions. One convenient notation here is:
19.1.2 Fully Hidden Order
p
19.2 Dark Pools
Oj
p1
Oj =
(19.4)
Ojp 1
Dark pools are an electronic engine that matches buy and sell
orders without routing them to lit exchanges. The reason is to
Practical Assumptions:
move large amounts without impacting the price (no need for
iceberg orders). These are run by private brokerages:
1. Limit buy orders arrive at a distance of i ticks from the
opposite best quote at independent, exponential times.
1. Ex: Liquidnet, Pipeline, ITG Posit, Goldman SIGMA X
2. Participatnts submit lists of orders to matching engine
We can summarize all the transition rates with a markov chain.
3. Matched orders are executed at the midpoint of the bid-ask The chain remains in O if it starts there, which is to say that
spread.
PB (t) PA(t), t > 0
(19.5)
4. PROS: trade at midpoint can be better than lit market
5. CONS: may have to wait a long time.
if it is true at time t = 0.
The SEC regulates this in the US as Alternative Trading Systems.
In summary:
They have little to no public disclosure, and little transparency.
1.
This is a descriptive analysis
Supposedly, 32% of trades in 2012 were on dark pools.
2. Uses ideas from queuing theory: first passage times of
19.3 Order book Modeling Objectives
Birth-and -Death processes
Offer a framework to investigate order impact on execution prices. 3. Laplace transform techniques
4. We can compute/estimate probabilities of condition events
1. Optimal mult-period liquidation strategies against a limit
5. But.... its not sufficient for optimal order book strategies.
order book
Optimization problems: The goal of a LOB model is to
2. Detailed but tractable stochastic model of spread and
transaction costs
1. Understand the costs of transactions
3. Benchmark tracking slippage
2. Develop efficient (or optimal) trading strategies
4. Opportunity costs of delayed trading.
Typical challenge: Sell x0 units of an asset and maximize the
sales revenues, using a limited number of market orders only!
19.4 Order Book Models
Roughly speaking, LOB is a set of two histograms (Bids & Asks).
The reduced form model sets it up as a Markov process (Ot)t
on a large state space of order books O. The simplest model:
34
sup
1 ...n <T
N
X
E(U(
PB (i)))
i=1
(19.6)
35
Chapter 20
20.1
queries
We already saw that we should split and spread large orders, so:
1.
2.
3.
4.
20.2
(20.4)
Here we assume that the unaffected (fair) price is given by a semimartingale. The mid-price is affected by trading, via two parts: 20.3 Challenges
1. Permanent price impact given by a function g of the trading The first generation considered price impact models: Risk
neutral framework, more complex portfolios (eg, with options), or
speed:
mid
dPt
= g(v(t))dt + dWt
(20.1) robustness and performance constraints(e.g. slippage or tracking
market VWAP).
The second generation uses simplified LOB models, for
2. A temporary price impact given by a function h of the trading
example a simple liquidation problem or performance constraints
speed:
Pttrans = Ptmid + h(v(t))
(20.2) and using both market and limit orders.
20.4 Optimal Execution
The problem is: we want find a deterministic continuous
First we can expand on the definition
transaction path to maximize the mean-variance reward
Z T
1. Closed form solution when permanent and instaneous price
t)Pt)dt
(X
(20.6)
R(X) =
impact functions g and h are linear.
0
2. Efficient frontier: the speed of trading and hence risk/return
Z T
Z T
is controlled by a risk aversion parameter.
tItdt
tP
tdt
X
(20.7)
X
=
This is widely used within the industry.
0
0
Z T
20.2.1 Criticisms
0 +
t C(x)
=x0P
XtdP
(20.8)
mid
0
1. Mid price Pt
is arithmetic brownian motion with drift...
so we can see negative prices, reasonable only for short times, where
maybe that price never actually happens.
C(x) =
(20.9)
2. Are there issues with rate of trading in continuous time?
Can try to maximize expected revenue, but get a boring answer.
3. Price impact is more complex than instantaneous and
A better way is instead to maximize:
permanent.
4.
E [R(X)] var [R(X)]
(20.10)
5. Empirical evidence that it is stochastic.
Here, is a risk aversion parameterlate trades carry some
20.2.2 Optimal Execution
volatility risk.
An execution algorithm has three layers:
For a DETERMINISTIC trading strategy X, we can find the
expectation.
1. Highest: How to slice the order, when to trade, what size,
Instead, we might include risk aversion via a utility function:
how long?
2. Mid: Given a slice, market or limit order? What price level?
3. Low: Given an order, which venue? (we will ignore this!)
E [U(R(XT ))]
max
(20.11)
Recent Developments
1. Gatheral/Schied(2011)
2. Schied(2012)
3. Almgren-Li (2012): Hedging a large option position. Explicit
solution in some gases)
Modeling the LOB by a shape function:
1. Obizhaeva-Wang (2006)
2. Alfonsi-Fruth-Schied(2010)
3. Alfonsi-Schied-Schulz(2011)
4. Predoiu-Shaikhet-Shreve(2011)
37
Chapter 21
38
Chapter 22
Wed like to build a model of agents and have the limit order
book model happen automatically.
Agents:
1. Market Maker: agent that places competitive orders on both
sides of the order book in exchange for privileges. Liquidity
Provider Strategy: adapt pricing and volumes by reading
client flows.
2. Clients: Liquidity Takers, agents who trade with the
market maker. Clients place market orders. Each client has
his/her own information and acts accordingly.
Well assume an ordering in time.
22.1
1.
2.
3.
4.
5.
Theoretical Literature
Early approaches
Inventory models
Informed traders
Zero-Intelligence models
Price impact models.
22.2
Objective
sup
(` ct(`))
(22.1)
`supp(ct )
According to Duality:
ctconvex with compact domain t00is a positive finite measure
(22.2)
The distribution t00 represents the order book formed by the
orders of the market maker. If t00 has a density f(x), it is the
shape function we used earlier.
More about the client model: We are NOT trying to implement
an optimal trading strategy. We assume the client is only trying
to predict!
22.3 Client Optimization Problem
Exogeneous state variables
1. Pt is a nonnegative Ito process
2. ct is a random adapted convex function in a fixed domain.
Endogeneous state variables:
i
dLt = `itdt
(22.3)
dXti = LitdPt ct(`it)dt
40CHAPTER 22. HIGH FREQUENCY TRADING LECTURE 5HETEROGENEOUS BELIEFS AND HF MARKET MAKING (CARM
Assume the market maker is risk-neutral.
This is super complicated, so well do the natural thing: let
n tend to infinity,
So critically, well need to model the ti ; well have two choices:
1. Microscopic model:
dti = ti dt + dBti + dBt
(22.8)
t00
t , t idt
m() = ( )
(22.11)
(22.12)
Chapter 23
HFT Day 6
23.1
StX dXt
(23.1)
(23.2)
(23.3)
(23.4)
41
Part V
Guest Lectures
42
Chapter 24
Overview:
1. Risk measures: Primal representation, acceptance sets, dual
representation, examples
2. Generalizations: Multivariate risks
Basics: We define a probability space (, F, P ) (the sample
space, -algebra, and probability measure, respectively). Random
variables map the probability space to real numbers.
Risk measures are mathematical models to quantify uncertainy.
It is a functional on the space Lp(, F, P ) with p [0, ] (or
subspaces of random variables):
(24.3)
It holds
1. inf{t R : t A} = 0 = A(0) = 0
2. A + Lp+ A = A monotone.
3. A satisfies the translation property.
4. A convex = A convex
5. A a cone = A is positively homogeneous
6. A closed = A closed.
: Lp
7 R {+}
p
2. R1:Monotonicity X1, X2 L : X1 X2
=
XA E [X] = ( dP ) is called the penalty function.
(X1) (X2).
then the conjugate function
3. R2:Translation properties (Cash invariance) X Lp, c R,
Aside: If f : X
7 R,
= , (X + c) = (X) c.
f (x) = sup {x(x) f(x)}
(24.5)
Extra features:
xX
1. R3: Convexity in
If f is l.s.c. convex, proper, then
2. R0-R3: Convex Risk Measure
3. R4: Positive Homogeneity (scaling property)
f(x) = sup {x(x) f (x)] = f (x)
(24.6)
4. R0-R4: Coherent Risk Measure
x X
Value-At-Risk is a typical Risk Measure, but it is not convex!
(ie, it is the conjugate of the conjugate.)
24.1 Acceptance Sets
We just need to prove that Q and Q are the same; these fall
We call A := {X Lp : (X) 0 the acceptance set of the out from our original definitions. Start with
risk measure .
(0) = 0
(24.7)
Lemma 1 Consider a function : Lp
7 R {+}. It holds:
which implies
1. monotone = A + Lp+ subset of Ap
inf (y) = 0
(24.8)
2. convex implies A convex
y Lp
3. positively homogeneous implies A is a cone.
which implies that
4. closed implies A is closed.
(y) 0
(24.9)
Reminder: A function F is called closed (or lower semiconNext, since is monotone, we have
tinuous) if
epif := {(v, r) Lp R : f(v) r} Lp R
dom L
(24.2)
is closed in Lp R.
Can we construct a risk measure from a given set of acceptable
positions?
(24.10)
y L
+
(24.11)
44
(24.12)
sup {E[xy] }
(24.13)
and
xA
(24.14)
A few counterexamples:
1. Variance 2(X) is not monotone or translative!
2. Value at risk V aR(X) at level (0, 1) is not convex!
V aR(X) := inf{x R : P {X + x 0} } = x
(24.15)
Example: Consider two defaultable corporate bonds with face
value $500,000. Payoff X1, X2 (r = 10%, default prob 0.8%, independent). Calculate V aR(X1),V aR(X2), V aR( 12 (X1 + X2)
for = 1%.
50, 000
99.2%
X1 =
(24.16)
500, 000 0.8%
98.4%
50, 000
1
y = (X1 + X2) = 225, 000 1.58
2
500, 000 ??0.006??
(24.17)
1
E[X1{Xxa }] + x( P [X x])
(24.18)
Z
1
=
V aR (X)d
(24.19)
0
Outlook
Multivariate risks
(24.20)
Chapter 25
45
Bibliography
46