Optimal Adaptive Execution of Portfolio Transactions

1 / 20

# Optimal Adaptive Execution of Portfolio Transactions - PowerPoint PPT Presentation

Optimal Adaptive Execution of Portfolio Transactions. Julian Lorenz Joint work with Robert Almgren (Banc of America Securities, NY). Execution of Portfolio Transactions. Sell 100,000 Microsoft shares today!. Broker/Trader. Fund Manager. Problem: Market impact.

I am the owner, or an agent authorized to act on behalf of the owner, of the copyrighted work described.

## PowerPoint Slideshow about 'Optimal Adaptive Execution of Portfolio Transactions' - mason

Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author.While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server.

- - - - - - - - - - - - - - - - - - - - - - - - - - E N D - - - - - - - - - - - - - - - - - - - - - - - - - -
Presentation Transcript

### Optimal Adaptive Execution of Portfolio Transactions

Julian Lorenz

Joint work with Robert Almgren (Banc of America Securities, NY)

Execution of Portfolio Transactions

Sell 100,000 Microsoft shares today!

Fund Manager

Problem: Market impact

Trading Large Volumes Moves the Price

How to optimize the trade schedule over the day?

Market Model
• Discrete times
• Stock price follows random walk
• Sell program

for initial position of X shares

s.t.

,

• Execution strategy:

= shares hold at time

i.e.

sell shares between t0 and t1

t1 and t2

• Pure sell program:
X=x0=100

N=10

C() is independent of S0

Market Impact and Cost of a Strategy

Selling xk-1 – xk shares in [tk-1, tk] at discount to Sk-1

with

Linear Temporary Market Impact

x

x

x(t)

x(t)

X

X

t

t

T

T

Œ

Minimal Risk

Obviously by immediate liquidation

No risk, but high market impact cost



Minimal Expected Cost

Linear strategy

ð

But: High exposure to price volatility

High risk

Optimal trade schedules seek risk-reward balance

Random variable!



Minimal expected cost

Œ

Minimal variance

Efficient Strategies

Variance as risk measure

E-V Plane



Linear Strategy

ImmediateSale

Efficient Strategies

Œ

R. Almgren, N. Chriss: "Optimal execution of portfolio transactions", Journal of Risk (2000).

ð

functions of decision variables (x1,…,xN)

Almgren/Chriss Trajectories:

Dynamic strategies:

xi = xi(1,…,i-1)

xi deterministic

E-V Plane

x(t)

X

T=1, =10

Dynamic strategies improve (w.r.t. mean-variance) !

We show:

ð

C() normally distributed

t

T

ð

Straightforward QP

x(t)

x(t)

X

t

T

Deterministic

Trajectories

for some

ð

By dynamic programming

Urgency  controls curvature

adapted strategiesfor X shares in N periods with expected cost

i.e.

„no other admissible strategy offers lower variance for same level of expected cost“

Definitions

and optimal strategies for k-1 periods

and optimal strategies for k periods

+

Optimal Markovian one-step control

…ultimately interested in

?

For type “ “ DP is straightforward.

Here: in value function & terminal constraint …

Dynamic Programming (1/4)

Define value function

Œ

In current period sell shares at



Use efficient strategy for remaining k-1 periods

Note: must be deterministic, but when we begin , outcomeof is known, i.e. we may choose depending on 

ð

Specify by its expected cost z()

Dynamic Programming (2/4)

We want to determine

Situation:

• k periods and x shares left
• Limit for expected cost is c
• Current stock price S
• Next price innovation is x ~ N(0,2)

Construct optimal strategy for k periods

Conditional on :

Using the laws of total expectation and variance

One-step optimization of and by means of and

Dynamic Programming (3/4)

ð

Strategy  defined by control and control functionz()

Dynamic Programming (4/4)

Theorem:

where

Control variablenew stock holding

(i.e. sell x – x’ in this period)

Control functiontargeted cost as function of next price change 

ð

Solve recursively!

Solving the Dynamic Program
• No closed-form solution
• Difficulty for numerical treatment:

Need to determine a control function

• Approximation: is piecewise constant

ð

For fixed determine

• Nice convexity property

Theorem:

In each step, the optimization problem is a convex constrained problem in {x‘, z1, … , zk}.

„Aggressive in the Money“

Theorem:

At all times, the control function z() is monotone increasing

Recall:

• z() specifies expected cost for remainder as a function of the next price change 
• High expected cost = sell quickly (low variance)

Low expected cost = sell slowly (high variance)

ð

If price goes up (> 0), sell faster in remainder

Spend part of windfall gains on increased impact costs

to reduce total variance

Numerical Example
• Respond only to up/down
• Discretize state space of

Aggressive in the money …

Family of New Efficient Frontiers

Family of frontiers

parametrized by

Sample cost PDFs:



strategies



Larger improvement for large portfolios

Almgren/Chriss deterministic strategy

(i.e. )



Almgren/Chriss frontier



Distribution plots obtained by Monte Carlo simulation





Improved frontiers

Extensions
• Non-linear impact functions