Top Banner
An Introduction to Algorithmic Trading Research in Options 2013 Sebastian Jaimungal U. Toronto many thanks to ´ Alvaro Cartea University College London Ryan Donnelly (U.Toronto) Damir Kinzebulatov (Fields) Jason Ricci (U.Toronto) No 29, 2013 1 / 76
76

An Introduction to Algorithmic Trading Research in Options 2013€¦ · An Introduction to Algorithmic Trading Research in Options 2013 Sebastian Jaimungal U. Toronto many thanks

Aug 17, 2020

Download

Documents

dariahiddleston
Welcome message from author
This document is posted to help you gain knowledge. Please leave a comment to let me know what you think about it! Share it to your friends and learn new things together.
Transcript
Page 1: An Introduction to Algorithmic Trading Research in Options 2013€¦ · An Introduction to Algorithmic Trading Research in Options 2013 Sebastian Jaimungal U. Toronto many thanks

An Introduction to Algorithmic TradingResearch in Options 2013

Sebastian JaimungalU. Toronto

many thanks to

Alvaro CarteaUniversity College London

Ryan Donnelly (U.Toronto)Damir Kinzebulatov (Fields)

Jason Ricci (U.Toronto)

No 29, 2013

1 / 76

Page 2: An Introduction to Algorithmic Trading Research in Options 2013€¦ · An Introduction to Algorithmic Trading Research in Options 2013 Sebastian Jaimungal U. Toronto many thanks

Introduction

2 / 76

Page 3: An Introduction to Algorithmic Trading Research in Options 2013€¦ · An Introduction to Algorithmic Trading Research in Options 2013 Sebastian Jaimungal U. Toronto many thanks

Introduction

Aim is to learn aboutI Algorithmic Trading (AT): The use of computer algorithms

that make trading decisions, submit orders, and manage thoseorders after submission.

I For example, the SEC reports that in the NYSE between 2005and 2009: consolidated average daily share volume increased181%; average speed of execution for small, immediatelyexecutable (marketable) orders shrunk from 10.1 to 0.7seconds; consolidated average daily trades increased 662%;and consolidated average trade size decreased from 724 to 268shares, SEC (2010).

I We will learn aboutI VWAP and TWAPI Optimal liquidationI Pairs trading

3 / 76

Page 4: An Introduction to Algorithmic Trading Research in Options 2013€¦ · An Introduction to Algorithmic Trading Research in Options 2013 Sebastian Jaimungal U. Toronto many thanks

Introduction

I Why AT? One exampleI Institutional or large players need to trade (buy and sell) large

amounts of securities. These quantities are too large for themarket to process without prices moving in the ‘wrongdirection’ (slippage).

I Thus, large orders are broken up in small ones and these aretraded over time (minutes, hours, days, weeks, or evenmonths) and across different venues.

I Deciding how to break up and execute a large order can meansaving millions of dollars for large players

4 / 76

Page 5: An Introduction to Algorithmic Trading Research in Options 2013€¦ · An Introduction to Algorithmic Trading Research in Options 2013 Sebastian Jaimungal U. Toronto many thanks

Introduction

Aim is to learn aboutI High Frequency (HF) Trading: refers to the subset of AT

trading strategies that are characterised by their reliance on speeddifferences relative to other traders to make profits based onshort-term predictions and also by the objective to hold essentiallyno inventories for more than a very short period of time.

I We will learn about

I Market making

I Momentum and short-term-alpha strategies

I Risk metrics for HFT

5 / 76

Page 6: An Introduction to Algorithmic Trading Research in Options 2013€¦ · An Introduction to Algorithmic Trading Research in Options 2013 Sebastian Jaimungal U. Toronto many thanks

Exchanges

6 / 76

Page 7: An Introduction to Algorithmic Trading Research in Options 2013€¦ · An Introduction to Algorithmic Trading Research in Options 2013 Sebastian Jaimungal U. Toronto many thanks

Exchanges

An exchange is a ‘place’ where ‘people’ meet to buy/sell securities:shares, commodities, derivatives, etc

I Order Driven Market:I All buyers and sellers display the prices and quantities at which

they wish to buy or sell a particular security, This is theopposite of a quote driven market, which is one that onlydisplays bids and asks of designated market makers andspecialists for a specific security.

I Quote Driven Market:I Designated market makers and specialists display bids and asks

for a specific security.

7 / 76

Page 8: An Introduction to Algorithmic Trading Research in Options 2013€¦ · An Introduction to Algorithmic Trading Research in Options 2013 Sebastian Jaimungal U. Toronto many thanks

Order Driven Market

I All participants can post limit buy or sell orders

I limit orders show an intention to buy or sell and must indicatethe amount of shares and price at which the agent is willingto trade

I limit buy order with the highest price is known as the best bid

I limit sell order with the lowest price is known as the best offer

I The best bid/ask is also called the touch

I The difference between the best bid and offer is called thespread

8 / 76

Page 9: An Introduction to Algorithmic Trading Research in Options 2013€¦ · An Introduction to Algorithmic Trading Research in Options 2013 Sebastian Jaimungal U. Toronto many thanks

Evolution of markets

I Old days brokerage model: Ring a broker, broker sends orderto the pit and after screaming and hand signalling the order isexecuted.

I Electronic market: Ring or use internet to contact broker whosends the order to the electronic exchange (no screaming)

I Direct Access Market: clients send orders directly to market

But to which market? ARCA-NYSE: electronic platform of NYSE,BATS (Kansas), BEX: Boston Equity Exchange, CBSX (CBOE StockExchange), CSXZ (Chicago Stock Exchange), DRCTEDGE (Direct Edge,Jersey City, NJ), ISE (International Securities Exchange), ISLAND(Acquired by Nasdaq in 2003), LAVA (Citigroup), NSX (National StockExchange, Chicago) TRACKECN (Track ECN), ChiX, LSE (LondonStock Exchange), etc, etc

9 / 76

Page 10: An Introduction to Algorithmic Trading Research in Options 2013€¦ · An Introduction to Algorithmic Trading Research in Options 2013 Sebastian Jaimungal U. Toronto many thanks

Limit Order Book

10 / 76

Page 11: An Introduction to Algorithmic Trading Research in Options 2013€¦ · An Introduction to Algorithmic Trading Research in Options 2013 Sebastian Jaimungal U. Toronto many thanks

Limit Order Book

I Limit orders are accumulated in the limit order book (LOB)until they find a counterparty for execution or are cancelled

I The counterparty is a market order which is an order to buyor sell an amount of shares, regardless of the price, and isimmediately executed against the best prices

165.9 166 166.1 166.2 166.3 166.40

200

400

600

800

1000

1200

1400Event: 95000 Time Stamp: 11:45:20.26 Type: D Price: 0 Volume:0

Price

Vol

ume

Sell QuotesBuy Quotes

11 / 76

Page 12: An Introduction to Algorithmic Trading Research in Options 2013€¦ · An Introduction to Algorithmic Trading Research in Options 2013 Sebastian Jaimungal U. Toronto many thanks

Limit Order Book

Immediate Execution Costs

12 / 76

Page 13: An Introduction to Algorithmic Trading Research in Options 2013€¦ · An Introduction to Algorithmic Trading Research in Options 2013 Sebastian Jaimungal U. Toronto many thanks

Limit Order Book

Impact dynamics throughout the day

13 / 76

Page 14: An Introduction to Algorithmic Trading Research in Options 2013€¦ · An Introduction to Algorithmic Trading Research in Options 2013 Sebastian Jaimungal U. Toronto many thanks

Limit Order Book

Trade Activity

0 2 4 6 8 1025.15

25.2

25.25

25.3

25.35

25.4

25.45

25.5

25.55MSFT 20110322 : 9:30:0.0 to 9:40:0.0

14 / 76

Page 15: An Introduction to Algorithmic Trading Research in Options 2013€¦ · An Introduction to Algorithmic Trading Research in Options 2013 Sebastian Jaimungal U. Toronto many thanks

Limit Order Book

Trade Activity

0 2 4 6 8 1025.32

25.34

25.36

25.38

25.4

25.42

25.44

25.46

25.48

25.5MSFT 20110322 : 10:0:0.0 to 10:10:0.0

15 / 76

Page 16: An Introduction to Algorithmic Trading Research in Options 2013€¦ · An Introduction to Algorithmic Trading Research in Options 2013 Sebastian Jaimungal U. Toronto many thanks

Limit Order Book

Trade Activity

0 2 4 6 8 1025.3

25.35

25.4

25.45MSFT 20110322 : 11:0:0.0 to 11:10:0.0

16 / 76

Page 17: An Introduction to Algorithmic Trading Research in Options 2013€¦ · An Introduction to Algorithmic Trading Research in Options 2013 Sebastian Jaimungal U. Toronto many thanks

Limit Order Book

Trade Activity

0 2 4 6 8 1025.35

25.4

25.45

25.5MSFT 20110322 : 12:0:0.0 to 12:10:0.0

17 / 76

Page 18: An Introduction to Algorithmic Trading Research in Options 2013€¦ · An Introduction to Algorithmic Trading Research in Options 2013 Sebastian Jaimungal U. Toronto many thanks

Limit Order Book

Trade Activity

0 2 4 6 8 1025.24

25.26

25.28

25.3

25.32

25.34

25.36

25.38

25.4

25.42MSFT 20110322 : 13:0:0.0 to 13:10:0.0

18 / 76

Page 19: An Introduction to Algorithmic Trading Research in Options 2013€¦ · An Introduction to Algorithmic Trading Research in Options 2013 Sebastian Jaimungal U. Toronto many thanks

Limit Order Book

Trade Activity

0 2 4 6 8 1025.24

25.26

25.28

25.3

25.32

25.34

25.36

25.38

25.4

25.42MSFT 20110322 : 14:0:0.0 to 14:10:0.0

19 / 76

Page 20: An Introduction to Algorithmic Trading Research in Options 2013€¦ · An Introduction to Algorithmic Trading Research in Options 2013 Sebastian Jaimungal U. Toronto many thanks

Limit Order Book

Trade Activity

0 2 4 6 8 1025.24

25.26

25.28

25.3

25.32

25.34

25.36

25.38

25.4

25.42MSFT 20110322 : 15:0:0.0 to 15:10:0.0

20 / 76

Page 21: An Introduction to Algorithmic Trading Research in Options 2013€¦ · An Introduction to Algorithmic Trading Research in Options 2013 Sebastian Jaimungal U. Toronto many thanks

Limit Order Book

Trade Activity

0 2 4 6 8 10

25.25

25.3

25.35

25.4MSFT 20110322 : 15:50:0.0 to 16:0:0.0

21 / 76

Page 22: An Introduction to Algorithmic Trading Research in Options 2013€¦ · An Introduction to Algorithmic Trading Research in Options 2013 Sebastian Jaimungal U. Toronto many thanks

Order Imbalance

22 / 76

Page 23: An Introduction to Algorithmic Trading Research in Options 2013€¦ · An Introduction to Algorithmic Trading Research in Options 2013 Sebastian Jaimungal U. Toronto many thanks

Order Imbalance

I Order Imbalance ρ ∈ [0, 1]

ρt =V bt

V at + V b

t

I It is a good predictor of trade direction(ORIT June 21, 2011)

ρ # Buy Orders # Sell Orders

All 756 ( 67% ) 396 ( 33 % )> 0.5 568 ( 79% ) 155 ( 21% )> 0.75 320 ( 84% ) 60 ( 16% )< 0.5 168 ( 43% ) 225 ( 57% )< 0.25 39 ( 25% ) 116 ( 75%)

23 / 76

Page 24: An Introduction to Algorithmic Trading Research in Options 2013€¦ · An Introduction to Algorithmic Trading Research in Options 2013 Sebastian Jaimungal U. Toronto many thanks

Order Imbalance

A slice of imbalance for MSFT 10:00am to 10:10am on 22 Mar2011

3.6 3.61 3.62 3.63 3.64 3.65 3.66

x 107

0

0.2

0.4

0.6

0.8

1Order Imblance

24 / 76

Page 25: An Introduction to Algorithmic Trading Research in Options 2013€¦ · An Introduction to Algorithmic Trading Research in Options 2013 Sebastian Jaimungal U. Toronto many thanks

Order Imbalance

Midprice change pre/post MO event with ρ ∈ [0, 0.1)

25 / 76

Page 26: An Introduction to Algorithmic Trading Research in Options 2013€¦ · An Introduction to Algorithmic Trading Research in Options 2013 Sebastian Jaimungal U. Toronto many thanks

Order Imbalance

Midprice change pre/post MO event with ρ ∈ [0.1, 0.2)

26 / 76

Page 27: An Introduction to Algorithmic Trading Research in Options 2013€¦ · An Introduction to Algorithmic Trading Research in Options 2013 Sebastian Jaimungal U. Toronto many thanks

Order Imbalance

Midprice change pre/post MO event with ρ ∈ [0.2, 0.3)

27 / 76

Page 28: An Introduction to Algorithmic Trading Research in Options 2013€¦ · An Introduction to Algorithmic Trading Research in Options 2013 Sebastian Jaimungal U. Toronto many thanks

Order Imbalance

Midprice change pre/post MO event with ρ ∈ [0.3, 0.4)

28 / 76

Page 29: An Introduction to Algorithmic Trading Research in Options 2013€¦ · An Introduction to Algorithmic Trading Research in Options 2013 Sebastian Jaimungal U. Toronto many thanks

Order Imbalance

Midprice change pre/post MO event with ρ ∈ [0.4, 0.5)

29 / 76

Page 30: An Introduction to Algorithmic Trading Research in Options 2013€¦ · An Introduction to Algorithmic Trading Research in Options 2013 Sebastian Jaimungal U. Toronto many thanks

Order Imbalance

Midprice change pre/post MO event with ρ ∈ [0.5, 0.6)

30 / 76

Page 31: An Introduction to Algorithmic Trading Research in Options 2013€¦ · An Introduction to Algorithmic Trading Research in Options 2013 Sebastian Jaimungal U. Toronto many thanks

Order Imbalance

Midprice change pre/post MO event with ρ ∈ [0.6, 0.7)

31 / 76

Page 32: An Introduction to Algorithmic Trading Research in Options 2013€¦ · An Introduction to Algorithmic Trading Research in Options 2013 Sebastian Jaimungal U. Toronto many thanks

Order Imbalance

Midprice change pre/post MO event with ρ ∈ [0.7, 0.8)

32 / 76

Page 33: An Introduction to Algorithmic Trading Research in Options 2013€¦ · An Introduction to Algorithmic Trading Research in Options 2013 Sebastian Jaimungal U. Toronto many thanks

Order Imbalance

Midprice change pre/post MO event with ρ ∈ [0.8, 0.9)

33 / 76

Page 34: An Introduction to Algorithmic Trading Research in Options 2013€¦ · An Introduction to Algorithmic Trading Research in Options 2013 Sebastian Jaimungal U. Toronto many thanks

Order Imbalance

Midprice change pre/post MO event with ρ ∈ [0.9, 1.0]

34 / 76

Page 35: An Introduction to Algorithmic Trading Research in Options 2013€¦ · An Introduction to Algorithmic Trading Research in Options 2013 Sebastian Jaimungal U. Toronto many thanks

Statistical Machine Learning Models

35 / 76

Page 36: An Introduction to Algorithmic Trading Research in Options 2013€¦ · An Introduction to Algorithmic Trading Research in Options 2013 Sebastian Jaimungal U. Toronto many thanks

Statistical Machine Learning

I Statistical machine learning models are quite variedI Supervise learning (inputs and outputs known – i.e. data is

“labeled”)I Support vector machines

I Gaussian random fields

I Restricted Boltzman Machines

I Unsupervise learning (only inputs known – no “labels”)I Clustering (k-means, mixture models)

I Hidden Markov Models

I Blind signal separation (PCA, SVD, independent componentanalysis)

36 / 76

Page 37: An Introduction to Algorithmic Trading Research in Options 2013€¦ · An Introduction to Algorithmic Trading Research in Options 2013 Sebastian Jaimungal U. Toronto many thanks

Restricted Boltzman MachinesI An RBM is a probabilistic model with a hidden and a visible

layer with connections only between layers:Hidden layer h

Visible layer v Visible target layer y

I Joint distribution of observing a configuration is

p(y , v , h | θ) =1

Z (θ)e−E(y ,v ,h|θ)

where the “Energy” of the configuration is

E = −R∑

r=1

K∑k=1

vr ωrk hk −C∑i=1

K∑k=1

yi βik hk −R∑

r=1

br vr −K∑

k=1

ck hk −C∑i=1

di yi

37 / 76

Page 38: An Introduction to Algorithmic Trading Research in Options 2013€¦ · An Introduction to Algorithmic Trading Research in Options 2013 Sebastian Jaimungal U. Toronto many thanks

Restricted Boltzman Machines

I Training of the model (i.e., learning ω, β, b, c and d)I compute all binary states

38 / 76

Page 39: An Introduction to Algorithmic Trading Research in Options 2013€¦ · An Introduction to Algorithmic Trading Research in Options 2013 Sebastian Jaimungal U. Toronto many thanks

Restricted Boltzman Machines

The number of predictions using the given confidence cutoff

39 / 76

Page 40: An Introduction to Algorithmic Trading Research in Options 2013€¦ · An Introduction to Algorithmic Trading Research in Options 2013 Sebastian Jaimungal U. Toronto many thanks

Restricted Boltzman Machines

The % correct predictions using the given confidence cutoff

40 / 76

Page 41: An Introduction to Algorithmic Trading Research in Options 2013€¦ · An Introduction to Algorithmic Trading Research in Options 2013 Sebastian Jaimungal U. Toronto many thanks

Who are you trading with? Is she betterinformed?

41 / 76

Page 42: An Introduction to Algorithmic Trading Research in Options 2013€¦ · An Introduction to Algorithmic Trading Research in Options 2013 Sebastian Jaimungal U. Toronto many thanks

Imagine that you are a market maker... (part I)

Glosten-Milgrom model

I An asset is worth either V or V with prob 12

I MM sets the bid and ask prices

I A trader arrives and buys OR sells the asset to the MM

I The trader is informed with probability α

I Informed traders know the asset outcome before trading

I Uniformed traders buy/sell with probability 12

42 / 76

Page 43: An Introduction to Algorithmic Trading Research in Options 2013€¦ · An Introduction to Algorithmic Trading Research in Options 2013 Sebastian Jaimungal U. Toronto many thanks

Imagine that you are a market maker... (part II)

Glosten-Milgrom model

I What are the rational prices that a risk-neutral MM sets?

I Naive answer is simply to set

ask = bid = E[ V ]

I The MM will then be adversely selected...

I When trading with uninformed trader... no losses on average.

I When they sell... they sometimes sell to an informed traderwho knows the price was going up

I When they buy... they sometimes buy from an informed traderwho knows the price was going down

43 / 76

Page 44: An Introduction to Algorithmic Trading Research in Options 2013€¦ · An Introduction to Algorithmic Trading Research in Options 2013 Sebastian Jaimungal U. Toronto many thanks

Imagine that you are a market maker... (part III)

Glosten-Milgrom model

I To account for the potential of being adversely selected, theMM sets instead

ask =E[ V | MO is buy ]

bid =E[ V | MO is sell ]

I After some simple computations one finds

ask =E[ V ] +α

2(V − V )

bid =E[ V ]− α

2(V − V )

I Thereforespread = α (V − V )

44 / 76

Page 45: An Introduction to Algorithmic Trading Research in Options 2013€¦ · An Introduction to Algorithmic Trading Research in Options 2013 Sebastian Jaimungal U. Toronto many thanks

Optimal Liquidation

45 / 76

Page 46: An Introduction to Algorithmic Trading Research in Options 2013€¦ · An Introduction to Algorithmic Trading Research in Options 2013 Sebastian Jaimungal U. Toronto many thanks

Optimal Liquidation

I Imagine you have a large position in an asset to liquidate

I If you sell all at once, then your orders will walk the bookand receive you a large market impact

I If you sell slowly, then you have large uncertainty in theprice

I You need to tradeoff impact and uncertainty

46 / 76

Page 47: An Introduction to Algorithmic Trading Research in Options 2013€¦ · An Introduction to Algorithmic Trading Research in Options 2013 Sebastian Jaimungal U. Toronto many thanks

Optimal Liquidation

Several target prices are used in practice

I VWAP (volume weighted average price)I The objective is to obtain the volume-weighted average price

(might be a self-fulfilling prophecy)

I Must predict the volume

I TWAP (time weighted average price)I The objective is to obtain the time-weighted average price

I POV (percentage of volume)I Use a constant participation rate, say β

I For example, if the agent still needs to purchase Q shares, thealgo computes the volume traded over a time window, say V ,and then executes min(Q, βV )

47 / 76

Page 48: An Introduction to Algorithmic Trading Research in Options 2013€¦ · An Introduction to Algorithmic Trading Research in Options 2013 Sebastian Jaimungal U. Toronto many thanks

Optimal Liquidation

10 11 12 13 14 15 160

2000

4000

6000

8000

10000V

olum

e

Time

AKAM 2011−01−13

48 / 76

Page 49: An Introduction to Algorithmic Trading Research in Options 2013€¦ · An Introduction to Algorithmic Trading Research in Options 2013 Sebastian Jaimungal U. Toronto many thanks

Optimal Liquidation

10 11 12 13 14 15 1649

49.5

50

50.5

51

51.5

Vol

ume

Time

AKAM 2011−01−13

TWAP

VWAP

Midprice

49 / 76

Page 50: An Introduction to Algorithmic Trading Research in Options 2013€¦ · An Introduction to Algorithmic Trading Research in Options 2013 Sebastian Jaimungal U. Toronto many thanks

Optimal Liquidation

Almgren-Chriss framework minimizes arrival price slippage

I Trader sells at a rate of νt

I Without trading, fundamental price is a Brownian motion

I But trading permanently impacts prices

dSt = −b νt dt + σ dWt

I Also, trader does not receive St when purchasing, insteadthere is a temporary impact and the trader receives

S∗t = St − a νt

per share

50 / 76

Page 51: An Introduction to Algorithmic Trading Research in Options 2013€¦ · An Introduction to Algorithmic Trading Research in Options 2013 Sebastian Jaimungal U. Toronto many thanks

Optimal Liquidation

Almgren-Chriss framework minimizes arrival price slippage

I Trader’s wealth X from liquidating shares is therefore

Xt =

∫ t

0(Su − a νu) ν du

I The trader’s optimization problem is to maximizeexpected profits but penalize inventories

supν∈A

E[

XT − φσ2

∫ T

0q2u du

]where trader’s inventory remaining is

qt = Q −∫ t

0νu du

51 / 76

Page 52: An Introduction to Algorithmic Trading Research in Options 2013€¦ · An Introduction to Algorithmic Trading Research in Options 2013 Sebastian Jaimungal U. Toronto many thanks

Optimal Liquidation

Almgren-Chriss framework minimizes arrival price slippage

I This is a stochastic control problem

I In general solved via the dynamic programming principle(DPP) leading to dynamic programming equations (DPEs)

I Basic ideasI Introduce a time indexed collection of performance criteria

for an arbitrary strategy (not necessarily optimal)

H(ν)(t, x ,S , q) = Et,x,S,q

[X

(ν)T − φσ2

∫ T

t

(q(ν)u

)2

du

]I Use iterated expectations to show that

H(ν)(t, x ,S , q) = Et,x,S,q

[H(ν)(τ,Sντ , q

ντ )− φσ2

∫ τ

t

(q(ν)u

)2

du

]

52 / 76

Page 53: An Introduction to Algorithmic Trading Research in Options 2013€¦ · An Introduction to Algorithmic Trading Research in Options 2013 Sebastian Jaimungal U. Toronto many thanks

Optimal Liquidation

Almgren-Chriss framework minimizes arrival price slippage

I Choose the arbitrary strategy

νt =

{νt , t ∈ [t, τ ] arbitrary

ν∗t . t ∈ (τ,T ] optimal

I Let H(t, S , q) denote the optimal strategy, then

H(ν)(t, x ,S , q) ≤ Et,x ,S ,q

[H(τ,Sν

∗τ , qντ )− φσ2

∫ τ

t

(q

(ν)u

)2du

]I Equality holds for the optimal strategy

H(t, x , S , q) = Et,x ,S ,q

[H(τ,Sν

∗τ , qν

∗τ )− φσ2

∫ τ

t

(q

(ν∗)u

)2du

]

53 / 76

Page 54: An Introduction to Algorithmic Trading Research in Options 2013€¦ · An Introduction to Algorithmic Trading Research in Options 2013 Sebastian Jaimungal U. Toronto many thanks

Optimal Liquidation

Almgren-Chriss framework minimizes arrival price slippage

I Write the above in infinitesimal form using Ito’s lemma to find

0 = ∂tH+12σ

2∂SS

+ supν

{(S − a ν) ν ∂xH + (S − b ν) ∂SH − ν ∂qH

}I optimal trading speed in feedback form is

ν∗ =1

2 a ∂xH(S∂x + b ∂S + ∂q)H

54 / 76

Page 55: An Introduction to Algorithmic Trading Research in Options 2013€¦ · An Introduction to Algorithmic Trading Research in Options 2013 Sebastian Jaimungal U. Toronto many thanks

Optimal Liquidation

Almgren-Chriss framework minimizes arrival price slippage

I Substitute back into the DPE to find a non-linear PDE for H

0 =

(∂t +

1

2σ2∂SS

)H−φ q2 +

1

4a∂xH[(S∂x + b∂S + ∂q) H]2

I An ansatz H = x + S q + h(t) q2 in fact reduces the problemto a Riccati ODE

0 = ∂th − φ+ 14a(b − 2 h)2

55 / 76

Page 56: An Introduction to Algorithmic Trading Research in Options 2013€¦ · An Introduction to Algorithmic Trading Research in Options 2013 Sebastian Jaimungal U. Toronto many thanks

Optimal Liquidation

Almgren-Chriss framework minimizes arrival price slippage

I Substitute everything back, one then finds

ν∗ =1

aht qt

It is deterministic function scaled by current remaininginventory

I More explicitly, one can show that

qt =sinh(γ(T − t)

sinh(γ T )

where γ =√φ/a

56 / 76

Page 57: An Introduction to Algorithmic Trading Research in Options 2013€¦ · An Introduction to Algorithmic Trading Research in Options 2013 Sebastian Jaimungal U. Toronto many thanks

Optimal Liquidation

0 0.2 0.4 0.6 0.8 10

0.2

0.4

0.6

0.8

1

Qν∗

time ( t )

φ = 0

φ = 0.01

φ = 0.1

φ = 1

57 / 76

Page 58: An Introduction to Algorithmic Trading Research in Options 2013€¦ · An Introduction to Algorithmic Trading Research in Options 2013 Sebastian Jaimungal U. Toronto many thanks

Optimal Liquidation

0 0.2 0.4 0.6 0.8 10

0.2

0.4

0.6

0.8

1

Qν∗

time ( t )

φ = 0

φ = 0.01

φ = 0.1

φ = 1

optimal strategy is independent of the asset price!

58 / 76

Page 59: An Introduction to Algorithmic Trading Research in Options 2013€¦ · An Introduction to Algorithmic Trading Research in Options 2013 Sebastian Jaimungal U. Toronto many thanks

Optimal Acquisition

If there is a limit price, i.e., trader must acquire all shares prior toan upper bound... see J. & Kinzebulatov (2013)

0 0.2 0.4 0.6 0.8 1

0.95

1

1.05

1.1

Time (t)

FundamentalPrice

(Ft)

0 0.2 0.4 0.6 0.8 10

0.5

1

1.5

2

2.5

3

3.5

Time (t)TradingSpeed(ν

t)

Now optimal strategy is dependent on asset price

59 / 76

Page 60: An Introduction to Algorithmic Trading Research in Options 2013€¦ · An Introduction to Algorithmic Trading Research in Options 2013 Sebastian Jaimungal U. Toronto many thanks

Optimal Acquisition

If there is a limit price, i.e., trader must acquire all shares prior toan upper bound... see J. & Kinzebulatov (2013)

0 0.2 0.4 0.6 0.8 10.98

1

1.02

1.04

1.06

1.08

1.1

Time (t)

Cost

per

Share

(Xt/Q

t)

Now optimal strategy is dependent on asset price

60 / 76

Page 61: An Introduction to Algorithmic Trading Research in Options 2013€¦ · An Introduction to Algorithmic Trading Research in Options 2013 Sebastian Jaimungal U. Toronto many thanks

Market Making

61 / 76

Page 62: An Introduction to Algorithmic Trading Research in Options 2013€¦ · An Introduction to Algorithmic Trading Research in Options 2013 Sebastian Jaimungal U. Toronto many thanks

Market Making

I The market maker’s problem is to find prices at which topost limit buy/sell order to profit from round-trip trades

I The benchmark models: Ho & Stoll (81), Avellanda &Stoikov (08) J. & Cartea (12)

I Need to account forI market order arrival rate

I Probability that you are filled at a given level

I midprice dynamics

62 / 76

Page 63: An Introduction to Algorithmic Trading Research in Options 2013€¦ · An Introduction to Algorithmic Trading Research in Options 2013 Sebastian Jaimungal U. Toronto many thanks

Market Making

I Market orders. arrive at jump times of a Poisson processM±t with intensity λ±

I Fill probabilities. MOs fill posted LOs with p = e−κ±δ±

0 5 10

10−1

100

Ticks (δ)

FillProbab

ility

I Midprice. The midprice is a drifted Brownian motion

dSt = µ dt + σ dWt .

63 / 76

Page 64: An Introduction to Algorithmic Trading Research in Options 2013€¦ · An Introduction to Algorithmic Trading Research in Options 2013 Sebastian Jaimungal U. Toronto many thanks

Market Making

I Other ingredients to solve MMs profit maximisation problem

I N±t – counting process for filled limit orders

Nt =

∫ t

0

∫ +∞

c±δ±s

µ±(dy , ds)

µ±(dy , ds) is a Poisson Random Measure withmean-measure

ν±(dy , ds) = λ± A± e−A± y dy ds

I Total market orders are given in terms of the random measure

M±t =

∫ t

0

∫ +∞

0

µ±(dy , ds)

64 / 76

Page 65: An Introduction to Algorithmic Trading Research in Options 2013€¦ · An Introduction to Algorithmic Trading Research in Options 2013 Sebastian Jaimungal U. Toronto many thanks

Market Making

A PRM µ with mean measure ν is a random measure on ameasurable space (E , E)

Set A

such that

I µ(A) is Poisson random variable, with mean ν(A), ∀ A ∈ EI µ(A1), µ(A2), . . . are independent for countable disjoint

A1,A2, · · · ∈ E

65 / 76

Page 66: An Introduction to Algorithmic Trading Research in Options 2013€¦ · An Introduction to Algorithmic Trading Research in Options 2013 Sebastian Jaimungal U. Toronto many thanks

Market Making

I Other ingredients to solve MMs profit maximisation problemI qt – agent’s inventory

qt = N−t − N+

t

I Xt – agent’s cash process

dXt = (St + δ+t ) dN+

t︸ ︷︷ ︸gains from filled sells

− (St − δ−t ) dN−t︸ ︷︷ ︸

costs from filled buys

I Choose δ± to maximise expected penalised wealth:

H(t, x , q, S) = supδ±t ∈A

E [XT + qT (ST − `(qT ))| Ft ]

66 / 76

Page 67: An Introduction to Algorithmic Trading Research in Options 2013€¦ · An Introduction to Algorithmic Trading Research in Options 2013 Sebastian Jaimungal U. Toronto many thanks

Market Making

I A DPP shows that H is the unique viscosity solution to

∂tH +(µ∂S + 1

2σ2∂SS

)H︸ ︷︷ ︸

mid-price Diffusion

+ supδ+

{λ+ e−κ+δ+︸ ︷︷ ︸

prob. filled sell LO

(H(t, x + (S + δ+), q − 1, S) − H(t, x , q, S)

)︸ ︷︷ ︸

change due to filled sell LO

}

+ supδ−

{λ− e−κ−δ−︸ ︷︷ ︸

prob. filled buy LO

(H(t, x − (S − δ−), q + 1, S) − H(t, x , q,S)

)︸ ︷︷ ︸

change due to filled buy LO

}= 0 ,

s.t. H(T , x , q, S) = x + q(S − `(q)) .

67 / 76

Page 68: An Introduction to Algorithmic Trading Research in Options 2013€¦ · An Introduction to Algorithmic Trading Research in Options 2013 Sebastian Jaimungal U. Toronto many thanks

Optimal Sell Spreads – No Ambiguity

0 2 4 6 8 100

0.02

0.04

0.06

0.08

0.1

0.12

Time (secs)

SellSpread(δ

+)

q = −2

q = −1

q = 0q = 1

q = 2

q = 3

Figure : Optimal sell spreads. Parameter values are κ± = 15, λ± = 2,σ = 0.01, µ = 0, `(q) = αq, α = 0.01, q = −q = 3 and T = 10 seconds.

68 / 76

Page 69: An Introduction to Algorithmic Trading Research in Options 2013€¦ · An Introduction to Algorithmic Trading Research in Options 2013 Sebastian Jaimungal U. Toronto many thanks

Market Making

Sample inventory path...

69 / 76

Page 70: An Introduction to Algorithmic Trading Research in Options 2013€¦ · An Introduction to Algorithmic Trading Research in Options 2013 Sebastian Jaimungal U. Toronto many thanks

Market Making

Risk-Reward profile...

1 2 3 4 5 6 710

11

12

13

14

15

16

Vol of Terminal PnL

MeanTerminal

PnL

α = 10−5

α = 10−4

α = 10−3

α = 10−2

increasing φ

70 / 76

Page 71: An Introduction to Algorithmic Trading Research in Options 2013€¦ · An Introduction to Algorithmic Trading Research in Options 2013 Sebastian Jaimungal U. Toronto many thanks

Informed Trading

71 / 76

Page 72: An Introduction to Algorithmic Trading Research in Options 2013€¦ · An Introduction to Algorithmic Trading Research in Options 2013 Sebastian Jaimungal U. Toronto many thanks

Informed Trading

I Suppose an agent makes a prediction ST about ST

I E.g., IBM will go up within two hours by $2

I Naive strategy is to execute a market order to

I buy asset if ST > St + ∆/2

I sell asset if ST < St −∆/2

I How can one...

I incorporate prediction uncertainty?

I include both limit and market orders?I learn from the realised dynamics of

I the asset midprice?I other assets midprice?

72 / 76

Page 73: An Introduction to Algorithmic Trading Research in Options 2013€¦ · An Introduction to Algorithmic Trading Research in Options 2013 Sebastian Jaimungal U. Toronto many thanks

Informed Trading

I Asset midprice S is a randomised Brownian bridge (rBB)

St = S0 + σ βt,T +t

TD

βt,T − standard Brownian bridge representing “noise”

fluctuations in the LOB due to the action of traders

D − the random change in asset price

I The midprice history (Su)u≤t generates the filtration Ft

I cannot distinguish signal (D) from noise (βt,T )

I Borrows ideas from Brody, Hughston, Macrina (08) oninformation based asset pricing

I But differs since in BHM: St generates filtration, but the assetprice Xt = E[D|Ft ] and is a martingale

73 / 76

Page 74: An Introduction to Algorithmic Trading Research in Options 2013€¦ · An Introduction to Algorithmic Trading Research in Options 2013 Sebastian Jaimungal U. Toronto many thanks

Informed Trading

I In algo trading problems, many model St as Brownian motion

I When D|F0 ∼ N (0, σ2T ), rBB reduces to Brownian motion

I This new approach allows the agent to include their futureviews on the asset price directly in the assumed dynamics,e.g.,

I Uninformed traders have prior D|F0 ∼ N (0, 1)

I Informed traders have prior D|F0 ∼ N (a, b2)

obtained from internal models – e.g. by using LOB shape,order flow, statistical machine learning, etc...

74 / 76

Page 75: An Introduction to Algorithmic Trading Research in Options 2013€¦ · An Introduction to Algorithmic Trading Research in Options 2013 Sebastian Jaimungal U. Toronto many thanks

Informed Trading

A prediction of upward/downward movement within bands...

0 0.2 0.4 0.6 0.8 1−10

−5

0

5

10

Time

Midprice

75 / 76

Page 76: An Introduction to Algorithmic Trading Research in Options 2013€¦ · An Introduction to Algorithmic Trading Research in Options 2013 Sebastian Jaimungal U. Toronto many thanks

Informed Trading

I All traders observe St and learn about D, e.g.,

I Uninformed traders have prior D|F0 ∼ N (0, 1)

I Informed traders have prior D|F0 ∼ N (a, b2)

obtained from internal models – e.g. by using LOB shape,order flow, statistical machine learning, etc...

I The posterior probability conditional on Ft is given by

P(D ∈ D|St = s) =

∫D exp

{x s−s0σ2(T−t)

− x2 t2σ2T (T−t)

}µD(dx)∫

exp{

x s−s0σ2(T−t)

− x2 t2σ2T (T−t)

}µD(dx)

I Go to slides from other talk...

76 / 76