Stochastic target problems and pricing under risk constraints B. - - PowerPoint PPT Presentation

stochastic target problems and pricing under risk
SMART_READER_LITE
LIVE PREVIEW

Stochastic target problems and pricing under risk constraints B. - - PowerPoint PPT Presentation

Stochastic target problems and pricing under risk constraints B. Bouchard Ceremade - Univ. Paris-Dauphine, and, Crest - Ensae Tamerza 2010 Joint works with R. Elie, M. N. Dang, N. Touzi, T. N. Vu Motivation General setting : trading


slide-1
SLIDE 1

Stochastic target problems and pricing under risk constraints

  • B. Bouchard

Ceremade - Univ. Paris-Dauphine, and, Crest - Ensae

Tamerza 2010

Joint works with R. Elie, M. N. Dang, N. Touzi, T. N. Vu

slide-2
SLIDE 2

Motivation

slide-3
SLIDE 3

General setting

✷ φ : trading strategy

slide-4
SLIDE 4

General setting

✷ φ : trading strategy ✷ Y φ

y : wealth process, valued in R, initial wealth y

slide-5
SLIDE 5

General setting

✷ φ : trading strategy ✷ Y φ

y : wealth process, valued in R, initial wealth y

✷ X φ : stocks, factors, valued in Rd

slide-6
SLIDE 6

General setting

✷ φ : trading strategy ✷ Y φ

y : wealth process, valued in R, initial wealth y

✷ X φ : stocks, factors, valued in Rd ✷ Target : E

  • G(X φ(T), Y φ

y (T))

  • ≥ p, p ∈ R, G : Rd × R → R
slide-7
SLIDE 7

General setting

✷ φ : trading strategy ✷ Y φ

y : wealth process, valued in R, initial wealth y

✷ X φ : stocks, factors, valued in Rd ✷ Target : E

  • G(X φ(T), Y φ

y (T))

  • ≥ p, p ∈ R, G : Rd × R → R

✷ Constraint : (X φ, Y φ

y ) ∈ O up to T (O : t → O(t) ⊂ Rd+1)

slide-8
SLIDE 8

General setting

✷ φ : trading strategy ✷ Y φ

y : wealth process, valued in R, initial wealth y

✷ X φ : stocks, factors, valued in Rd ✷ Target : E

  • G(X φ(T), Y φ

y (T))

  • ≥ p, p ∈ R, G : Rd × R → R

✷ Constraint : (X φ, Y φ

y ) ∈ O up to T (O : t → O(t) ⊂ Rd+1)

✷ Price under risk constraint : inf

  • y : ∃ φ s.t. (X φ, Y φ

y ) ∈ O and E

  • G(X φ(T), Y φ

y (T))

  • ≥ p
  • .
slide-9
SLIDE 9

Examples of dynamics : “usual” large investor model

✷ Control φ : predictable process with values in U ⊂ Rd. dX φ = µX(X φ, φ)dr + σX(X φ, φ)dW dY φ = φ′µX(X φ, φ)dr + φ′σX(X φ, φ)dW . ✷ ⇒ X φ = stocks, Y φ = wealth, φ = number of stocks in the portfolio.

slide-10
SLIDE 10

Examples of dynamics : proportional transaction costs

✷ Control φ adapted non-decreasing process (component by component) X 1(s) = x1 + s

t

X 1(r)µdr + s

t

X 1(r)σdW 1

r

X 2,φ(s) = x2 + s

t

X 2,φ(r) X 1(r) dX 1(r) − s

t

dφ1

r +

s

t

dφ2

r

Y φ(s) = y + s

t

(1 − λ)dφ1

r −

s

t

(1 + λ)dφ2

r .

✷ ⇒ X 1 = stock, X 2,φ = value invested in the stock, Y φ = value invested in cash ✷ φ1

t = cumulated amount of stocks sold, φ2 t = cumulated

amount of stocks bought. ✷ λ ∈ (0, 1) : proportional transaction cost coefficient.

slide-11
SLIDE 11

Examples of dynamics : model with immediate proportional price impact

✷ Control φ adapted non-decreasing process (component by component) dX φ = µX(X φ)dr + σX(X φ)dW + βX(X φ)dφ dY φ = X φdφ . ✷ ⇒ X φ = stock, Y φ = wealth, dφ = number of stocks bought at time t. ✷ βX = immediate impact factor.

slide-12
SLIDE 12

Examples of dynamics : model with immediate non-proportional price impact

✷ Control φ =

i≥1 ξi1[τi,τi+1) adapted

dX 1,φ = µX(X φ)dr + σX(X φ)dW +

  • i≥1

βX(X φ, ∆φ)1τi dX 2,φ =

  • i≥1

∆φ1τi dY φ =

  • i≥1

βY (X φ, ∆φ)1τi . ✷ ⇒ X 1,φ = stock, X 2,φ = number of stocks in the portfolio, Y φ = cash account, ∆φτi = number of stocks bought/sold at time τi. ✷ βX = immediate impact factor, βY = buying/selling cost.

slide-13
SLIDE 13

Other possible dynamics

✷ Dynamics with jumps (finance/insurance) : L. Moreau, B.

slide-14
SLIDE 14

Other possible dynamics

✷ Dynamics with jumps (finance/insurance) : L. Moreau, B. ✷ Any mixed control type problems.

slide-15
SLIDE 15

Examples of constraints : super-hedging

✷ Problem : v := inf

  • y : ∃ φ s.t. (X φ, Y φ

y ) ∈ O and E

  • G(X φ(T), Y φ

y (T))

  • ≥ p
  • .

✷ Take O := Rd+11[0,T) + 1{T}{(x, y) : y ≥ g(x)} , G = 0 and p = 0 . ✷ Super-hedging of an European option : v := inf

  • y : ∃ φ s.t. Y φ

y (T) ≥ g(X φ(T))

  • .
slide-16
SLIDE 16

Examples of constraints : super-hedging

✷ Problem : v := inf

  • y : ∃ φ s.t. (X φ, Y φ

y ) ∈ O and E

  • G(X φ(T), Y φ

y (T))

  • ≥ p
  • .

✷ Take O := Rd+1 , G(x, y) = 1y≥g(x) and p = 1 . ✷ Super-hedging of an European option : v := inf

  • y : ∃ φ s.t. Y φ

y (T) ≥ g(X φ(T))

  • .
slide-17
SLIDE 17

Examples of constraints : super-hedging of American option

✷ Problem : v := inf

  • y : ∃ φ s.t. (X φ, Y φ

y ) ∈ O and E

  • G(X φ(T), Y φ

y (T))

  • ≥ p
  • .

O := {(x, y) : y ≥ g(x)} , G = 0 and p = 0 . ✷ Super-hedging of an American option : v := inf

  • y : ∃ φ s.t. Y φ

y ≥ g(X φ) up to T

  • .
slide-18
SLIDE 18

Examples of constraints : P&L-hedging

✷ Problem : v := inf

  • y : ∃ φ s.t. (X φ, Y φ

y ) ∈ O and E

  • G(X φ(T), Y φ

y (T))

  • ≥ p
  • .

Take O := Rd+1 , G i(x, y) = 1y−g(x)≥−ci and pi ∈ (0, 1] . with P

  • Y φ

y (T) − g(X φ(T)) ≥ −ci

≥ pi with ci ↑, pi ↑ ⇒ P&L constraint (work in progress with T. N. Vu).

slide-19
SLIDE 19

Examples of constraints : shortfall-hedging

✷ Problem : v := inf

  • y : ∃ φ s.t. (X φ, Y φ

y ) ∈ O and E

  • G(X φ(T), Y φ

y (T))

  • ≥ p
  • .

Take O := Rd+1 , G(x, y) = −ℓ([y − g(x)]−) and p < 0 . ⇒ Shortfall-hedging of European option.

slide-20
SLIDE 20

Examples of constraints : indifference pricing

✷ Problem : v := inf

  • y : ∃ φ s.t. (X φ, Y φ

y ) ∈ O and E

  • G(X φ(T), Y φ

y (T))

  • ≥ p
  • .

Take O := Rd+1 , G(x, y) = U(y0+y−g(x)) and p := sup

φ

E

  • U(Y φ

t,x,y0(T))

  • .

⇒ Utility indifference price.

slide-21
SLIDE 21

Aim

slide-22
SLIDE 22

Aim

✷ Provide a PDE characterization in the (Markovian) situations where

slide-23
SLIDE 23

Aim

✷ Provide a PDE characterization in the (Markovian) situations where

  • markets are incomplete
slide-24
SLIDE 24

Aim

✷ Provide a PDE characterization in the (Markovian) situations where

  • markets are incomplete
  • markets have frictions
slide-25
SLIDE 25

Aim

✷ Provide a PDE characterization in the (Markovian) situations where

  • markets are incomplete
  • markets have frictions
  • models without any notion of martingale measure. Ex : WVAP

guaranteed liquidation contracts.

slide-26
SLIDE 26

Aim

✷ Provide a PDE characterization in the (Markovian) situations where

  • markets are incomplete
  • markets have frictions
  • models without any notion of martingale measure. Ex : WVAP

guaranteed liquidation contracts. ✷ Based on a “risk” criteria.

slide-27
SLIDE 27

Aim

✷ Provide a PDE characterization in the (Markovian) situations where

  • markets are incomplete
  • markets have frictions
  • models without any notion of martingale measure. Ex : WVAP

guaranteed liquidation contracts. ✷ Based on a “risk” criteria. ✷ We want a direct approach :

slide-28
SLIDE 28

Aim

✷ Provide a PDE characterization in the (Markovian) situations where

  • markets are incomplete
  • markets have frictions
  • models without any notion of martingale measure. Ex : WVAP

guaranteed liquidation contracts. ✷ Based on a “risk” criteria. ✷ We want a direct approach :

  • one (non-linear) pricing equation
slide-29
SLIDE 29

Aim

✷ Provide a PDE characterization in the (Markovian) situations where

  • markets are incomplete
  • markets have frictions
  • models without any notion of martingale measure. Ex : WVAP

guaranteed liquidation contracts. ✷ Based on a “risk” criteria. ✷ We want a direct approach :

  • one (non-linear) pricing equation
  • no-numerical inversion procedure

(infy maxφ E

  • G(X φ, Y φ

y )

  • ≥ p = v).
slide-30
SLIDE 30

Aim

✷ Provide a PDE characterization in the (Markovian) situations where

  • markets are incomplete
  • markets have frictions
  • models without any notion of martingale measure. Ex : WVAP

guaranteed liquidation contracts. ✷ Based on a “risk” criteria. ✷ We want a direct approach :

  • one (non-linear) pricing equation
  • no-numerical inversion procedure

(infy maxφ E

  • G(X φ, Y φ

y )

  • ≥ p = v).

✷ If one can allow for high dimensions : include liquid options as assets ⇒ automatically calibrated.

slide-31
SLIDE 31

Geometric Dynamic Programming

✷ Problem extension : Z φ

t,z = (X φ t,x, Y φ t,x,y)

slide-32
SLIDE 32

Geometric Dynamic Programming

✷ Problem extension : Z φ

t,z = (X φ t,x, Y φ t,x,y)

v(t, x, p) := inf

  • y : ∃ φ s.t. Z φ

t,x,y ∈ O on [t, T] , E

  • G(Z φ

t,x,y(T))

  • ≥ p
  • .
slide-33
SLIDE 33

Geometric Dynamic Programming

✷ Problem extension : Z φ

t,z = (X φ t,x, Y φ t,x,y)

v(t, x, p) := inf

  • y : ∃ φ s.t. Z φ

t,x,y ∈ O on [t, T] , E

  • G(Z φ

t,x,y(T))

  • ≥ p
  • .

✷ Assumption : y′ ≥ y and (x, y) ∈ O ⇒ (x, y′) ∈ O, t → O(t) is right-continuous and G ↑ in y.

slide-34
SLIDE 34

The P − a.s. case

✷ Problem extension : Z φ

t,z = (X φ t,x, Y φ t,x,y)

v(t, x) := inf

  • y : ∃ φ s.t. Z φ

t,x,y ∈ O on [t, T]

  • .
slide-35
SLIDE 35

The P − a.s. case

✷ Problem extension : Z φ

t,z = (X φ t,x, Y φ t,x,y)

v(t, x) := inf

  • y : ∃ φ s.t. Z φ

t,x,y ∈ O on [t, T]

  • .

✷ Theorem : For all φ and θ ∈ T[t,T] : GDP1 : Z φ

t,z ∈ O on [t, T] ⇒ Y φ t,z(θ) ≥ v(θ, X φ t,x(θ))

GDP2 : y < v(t, x) ⇒ P

  • Y φ

t,z(θ) ≥ v(θ, X φ t,x(θ)) and Z φ t,z ∈ O on [t, θ]

  • < 1
slide-36
SLIDE 36

The P − a.s. case

✷ Problem extension : Z φ

t,z = (X φ t,x, Y φ t,x,y)

v(t, x) := inf

  • y : ∃ φ s.t. Z φ

t,x,y ∈ O on [t, T]

  • .

✷ Theorem : For all φ and θ ∈ T[t,T] : GDP1 : Z φ

t,z ∈ O on [t, T] ⇒ Y φ t,z(θ) ≥ v(θ, X φ t,x(θ))

GDP2 : y < v(t, x) ⇒ P

  • Y φ

t,z(θ) ≥ v(θ, X φ t,x(θ)) and Z φ t,z ∈ O on [t, θ]

  • < 1

✷ First introduced by Soner and Touzi for super-hedging under Gamma constraints. Extended to American type contraints :

  • bstacle version of B. and Vu.
slide-37
SLIDE 37

Constraints in expectations

✷ Problem extension : Z φ

t,z = (X φ t,x, Y φ t,x,y)

v(t, x, p) := inf

  • y : ∃ φ s.t. Z φ

t,x,y ∈ O on [t, T] , E

  • G(Z φ

t,x,y(T))

  • ≥ p
  • .
slide-38
SLIDE 38

Constraints in expectations

✷ Problem extension : Z φ

t,z = (X φ t,x, Y φ t,x,y)

v(t, x, p) := inf

  • y : ∃ φ s.t. Z φ

t,x,y ∈ O on [t, T] , E

  • G(Z φ

t,x,y(T))

  • ≥ p
  • .

✷ Theorem : For all φ and θ ∈ T[t,T] : GDP1 : Z φ

t,z ∈ O on [t, T] ⇒ Y φ t,z(θ) ≥ v(θ, X φ t,x(θ), p) ?

slide-39
SLIDE 39

Constraints in expectations

✷ Problem extension : Z φ

t,z = (X φ t,x, Y φ t,x,y)

v(t, x, p) := inf

  • y : ∃ φ s.t. Z φ

t,x,y ∈ O on [t, T] , E

  • G(Z φ

t,x,y(T))

  • ≥ p
  • .

✷ Theorem : For all φ and θ ∈ T[t,T] : GDP1 : Z φ

t,z ∈ O on [t, T] ⇒ Y φ t,z(θ) ≥ v(θ, X φ t,x(θ), Pt,p(θ))

with Pt,p(θ) := E

  • G(Z φ

t,z(T)) | Fθ

slide-40
SLIDE 40

Constraints in expectations

✷ Problem extension : Z φ

t,z = (X φ t,x, Y φ t,x,y)

v(t, x, p) := inf

  • y : ∃ φ s.t. Z φ

t,x,y ∈ O on [t, T] , E

  • G(Z φ

t,x,y(T))

  • ≥ p
  • .

✷ Theorem : For all φ and θ ∈ T[t,T] : GDP1 : Z φ

t,z ∈ O on [t, T] ⇒ Y φ t,z(θ) ≥ v(θ, X φ t,x(θ), Pt,p(θ))

with Pt,p(θ) := E

  • G(Z φ

t,z(T)) | Fθ

  • = p +

θ

t

αsdWs , if Ft = σ(Ws, s ≤ t).

slide-41
SLIDE 41

Constraints in expectations

✷ Problem extension : Z φ

t,z = (X φ t,x, Y φ t,x,y)

v(t, x, p) := inf

  • y : ∃ φ s.t. Z φ

t,x,y ∈ O on [t, T] , E

  • G(Z φ

t,x,y(T))

  • ≥ p
  • .
slide-42
SLIDE 42

Constraints in expectations

✷ Problem extension : Z φ

t,z = (X φ t,x, Y φ t,x,y)

v(t, x, p) := inf

  • y : ∃ φ s.t. Z φ

t,x,y ∈ O on [t, T] , E

  • G(Z φ

t,x,y(T))

  • ≥ p
  • .

✷ Problem reduction : For all φ : Z φ

t,z ∈ O on [t, T] and E

  • G(Z φ

t,z(T))

  • ≥ p

if and only if ∃ α such that (Z φ

t,z, Pα t,p) ∈ O × R on [t, T] and G(Z φ t,z(T)) ≥ Pα t,p(T)

with Pt,p := E

  • G(Z φ

t,z(T)) | F·

  • = p +

·

t

αsdWs .

slide-43
SLIDE 43

Constraints in expectations

✷ Problem extension : Z φ

t,z = (X φ t,x, Y φ t,x,y)

v(t, x, p) := inf

  • y : ∃ φ s.t. Z φ

t,x,y ∈ O on [t, T] , E

  • G(Z φ

t,x,y(T))

  • ≥ p
  • .

✷ Problem reduction : For all φ : Z φ

t,z ∈ O on [t, T] and E

  • G(Z φ

t,z(T))

  • ≥ p

if and only if ∃ α such that (Z φ

t,z, Pα t,p) ∈ O × R on [t, T] and G(Z φ t,z(T)) ≥ Pα t,p(T)

with Pt,p := E

  • G(Z φ

t,z(T)) | F·

  • = p +

·

t

αsdWs . ✷ Can use the GDP with an increased controlled process.

slide-44
SLIDE 44

PDE derivation

slide-45
SLIDE 45

PDE derivation

✷ Previous works

slide-46
SLIDE 46

PDE derivation

✷ Previous works

  • Soner and Touzi : Brownian filtration and bounded controls

(apart from particular cases in finance). P − a.s. criteria. Problems with Gamma constraints with Zhang, Cheridito.

slide-47
SLIDE 47

PDE derivation

✷ Previous works

  • Soner and Touzi : Brownian filtration and bounded controls

(apart from particular cases in finance). P − a.s. criteria. Problems with Gamma constraints with Zhang, Cheridito.

  • B. : Jump diffusion with bounded control and locally bounded
  • jumps. P − a.s. criteria.
slide-48
SLIDE 48

PDE derivation

✷ Previous works

  • Soner and Touzi : Brownian filtration and bounded controls

(apart from particular cases in finance). P − a.s. criteria. Problems with Gamma constraints with Zhang, Cheridito.

  • B. : Jump diffusion with bounded control and locally bounded
  • jumps. P − a.s. criteria.
  • B., Elie and Touzi : Brownian filtration with unbounded
  • controls. Criteria in expectation (concentrating on the case of

a criteria in expectation).

slide-49
SLIDE 49

PDE derivation

✷ Previous works

  • Soner and Touzi : Brownian filtration and bounded controls

(apart from particular cases in finance). P − a.s. criteria. Problems with Gamma constraints with Zhang, Cheridito.

  • B. : Jump diffusion with bounded control and locally bounded
  • jumps. P − a.s. criteria.
  • B., Elie and Touzi : Brownian filtration with unbounded
  • controls. Criteria in expectation (concentrating on the case of

a criteria in expectation).

  • B. and Vu : “American” case.
slide-50
SLIDE 50

PDE derivation

✷ Previous works

  • Soner and Touzi : Brownian filtration and bounded controls

(apart from particular cases in finance). P − a.s. criteria. Problems with Gamma constraints with Zhang, Cheridito.

  • B. : Jump diffusion with bounded control and locally bounded
  • jumps. P − a.s. criteria.
  • B., Elie and Touzi : Brownian filtration with unbounded
  • controls. Criteria in expectation (concentrating on the case of

a criteria in expectation).

  • B. and Vu : “American” case.
  • Moreau : Extension of B., Elie and Touzi to jump diffusions.
slide-51
SLIDE 51

PDE derivation

✷ Previous works

  • Soner and Touzi : Brownian filtration and bounded controls

(apart from particular cases in finance). P − a.s. criteria. Problems with Gamma constraints with Zhang, Cheridito.

  • B. : Jump diffusion with bounded control and locally bounded
  • jumps. P − a.s. criteria.
  • B., Elie and Touzi : Brownian filtration with unbounded
  • controls. Criteria in expectation (concentrating on the case of

a criteria in expectation).

  • B. and Vu : “American” case.
  • Moreau : Extension of B., Elie and Touzi to jump diffusions.

✷ In the following, we consider the case with controls of bounded variations types (simplification of a work with M. N. Dang).

slide-52
SLIDE 52

The general model

✷ Set of controls : L ∈ L set of continuous non-decreasing Rd-valued adapted processes L s.t. E

  • |L|2

T

  • < ∞.
slide-53
SLIDE 53

The general model

✷ Set of controls : L ∈ L set of continuous non-decreasing Rd-valued adapted processes L s.t. E

  • |L|2

T

  • < ∞.

✷ Dynamics of Z = (X, Y ) ∈ Rd × R : dX L = µX(X L)dr + σX(X L)dW + βX(X L)dL dY L = µY (Z L)dr + σY (Z L)dW + βY (Z L)dL .

slide-54
SLIDE 54

The general model

✷ Set of controls : L ∈ L set of continuous non-decreasing Rd-valued adapted processes L s.t. E

  • |L|2

T

  • < ∞.

✷ Dynamics of Z = (X, Y ) ∈ Rd × R : dX L = µX(X L)dr + σX(X L)dW + βX(X L)dL dY L = µY (Z L)dr + σY (Z L)dW + βY (Z L)dL . ✷ Problem : v(t, x, p) := inf

  • y : ∃L ∈ L / Z L

t,x,y ∈ O , E

  • G(Z L

t,x,y(T))

  • ≥ p
slide-55
SLIDE 55

The general model

✷ Set of controls : L ∈ L set of continuous non-decreasing Rd-valued adapted processes L s.t. E

  • |L|2

T

  • < ∞.

✷ Dynamics of Z = (X, Y ) ∈ Rd × R : dX L = µX(X L)dr + σX(X L)dW + βX(X L)dL dY L = µY (Z L)dr + σY (Z L)dW + βY (Z L)dL . ✷ Problem : v(t, x, p) := inf

  • y : ∃L ∈ L / Z L

t,x,y ∈ O , E

  • G(Z L

t,x,y(T))

  • ≥ p
  • ✷ Reduction : A set of predictable square integrable processes

inf

  • y : ∃(L, α) ∈ L × A / Z L

t,x,y ∈ O , G(Z L t,x,y(T)) ≥ Pα t,p(T)

  • .
slide-56
SLIDE 56

Formal derivation of the PDE

Assume that v is smooth and the inf is achieved. For y = v(t, x, p), ∃ (L, α) such that Z L

t,z ∈ O on [t, T] and

G(Z L

t,x,y(T)) ≥ Pα t,p(T).

slide-57
SLIDE 57

Formal derivation of the PDE

Assume that v is smooth and the inf is achieved. For y = v(t, x, p), ∃ (L, α) such that Z L

t,z ∈ O on [t, T] and

G(Z L

t,x,y(T)) ≥ Pα t,p(T).

Then Y L

t,z(t+) ≥ v(t+, X L t,x(t+), Pα t,p(t+)) and

slide-58
SLIDE 58

Formal derivation of the PDE

Assume that v is smooth and the inf is achieved. For y = v(t, x, p), ∃ (L, α) such that Z L

t,z ∈ O on [t, T] and

G(Z L

t,x,y(T)) ≥ Pα t,p(T).

Then Y L

t,z(t+) ≥ v(t+, X L t,x(t+), Pα t,p(t+)) and

  • µY (z) − Lα

X,Pv(t, x, p)

  • dt

≥ (σY (z) − Dxv(t, x, p)σX(x) − Dpv(t, x, p)αt) dWt + (βY (z) − Dxv(t, x, p)βX(x)) dLt

slide-59
SLIDE 59

Formal derivation of the PDE

  • µY (z) − Lα

X,Pv(t, x, p)

  • dt

≥ (σY (z) − Dxv(t, x, p)σX(x) − Dpv(t, x, p)αt) dWt + (βY (z) − Dxv(t, x, p)βX(x)) dLt

slide-60
SLIDE 60

Formal derivation of the PDE

  • µY (z) − Lα

X,Pv(t, x, p)

  • dt

≥ (σY (z) − Dxv(t, x, p)σX(x) − Dpv(t, x, p)αt) dWt + (βY (z) − Dxv(t, x, p)βX(x)) dLt Ok if µY (x, v(t, x, p)) − Lα

X,Pv(t, x, p) ≥ 0

with σY (x, v(t, x, p)) = Dxv(t, x, p)σX(x) − Dpv(t, x, p)α.

slide-61
SLIDE 61

Formal derivation of the PDE

  • µY (z) − Lα

X,Pv(t, x, p)

  • dt

≥ (σY (z) − Dxv(t, x, p)σX(x) − Dpv(t, x, p)αt) dWt + (βY (z) − Dxv(t, x, p)βX(x)) dLt Ok if µY (x, v(t, x, p)) − Lα

X,Pv(t, x, p) ≥ 0

with σY (x, v(t, x, p)) = Dxv(t, x, p)σX(x) − Dpv(t, x, p)α. Or (βY (x, v(t, x, p)) − Dxv(t, x, p)βX(x)) ℓ > 0 with ℓ ∈ ∆+ := ∂B1(0) ∩ Rd

+.

slide-62
SLIDE 62

Formal derivation of the PDE

Set Fv := sup

  • µY (·, v) − Lα

X,Pv, α ∈ Nv

  • Gv

:= max {[βY (·, v) − Dxv(t, x)βX(x)]ℓ, ℓ ∈ ∆+} with Nv := {α : σY (·, v) = DxvσX + Dpvα} ∆+ := Rd

+ ∩ ∂B1(0) .

PDE characterization in the interior of the domain max {Fv , Gv} = 0 on (t, x, v(t, x)) ∈ int(D) where D := {(t, x, y) : (x, y) ∈ O(t)}.

slide-63
SLIDE 63

PDE on the space boundary (x, y) ∈ ∂O(t)

Domain is D := {(t, x, y) : (x, y) ∈ O(t)}.

slide-64
SLIDE 64

PDE on the space boundary (x, y) ∈ ∂O(t)

Domain is D := {(t, x, y) : (x, y) ∈ O(t)}. Assumption : D ∈ C 1,2 (or intersection of C 1,2 domains).

slide-65
SLIDE 65

PDE on the space boundary (x, y) ∈ ∂O(t)

Domain is D := {(t, x, y) : (x, y) ∈ O(t)}. Assumption : D ∈ C 1,2 (or intersection of C 1,2 domains). Take δ ∈ C 1,2 such that δ > 0 in int(D), δ = 0 on ∂D and δ < 0 elsewhere.

slide-66
SLIDE 66

PDE on the space boundary (x, y) ∈ ∂O(t)

Domain is D := {(t, x, y) : (x, y) ∈ O(t)}. Assumption : D ∈ C 1,2 (or intersection of C 1,2 domains). Take δ ∈ C 1,2 such that δ > 0 in int(D), δ = 0 on ∂D and δ < 0 elsewhere. The state constraints imposes dδ(t, Z L

t,z(t)) ≥ 0 if (t, z) ∈ ∂D.

slide-67
SLIDE 67

PDE on the space boundary (x, y) ∈ ∂O(t)

Domain is D := {(t, x, y) : (x, y) ∈ O(t)}. Assumption : D ∈ C 1,2 (or intersection of C 1,2 domains). Take δ ∈ C 1,2 such that δ > 0 in int(D), δ = 0 on ∂D and δ < 0 elsewhere. The state constraints imposes dδ(t, Z L

t,z(t)) ≥ 0 if (t, z) ∈ ∂D.

As above it implies : either LZδ(t, x, y) ≥ 0 and Dδ(t, x, y)σZ(x, y) = 0

slide-68
SLIDE 68

PDE on the space boundary (x, y) ∈ ∂O(t)

Domain is D := {(t, x, y) : (x, y) ∈ O(t)}. Assumption : D ∈ C 1,2 (or intersection of C 1,2 domains). Take δ ∈ C 1,2 such that δ > 0 in int(D), δ = 0 on ∂D and δ < 0 elsewhere. The state constraints imposes dδ(t, Z L

t,z(t)) ≥ 0 if (t, z) ∈ ∂D.

As above it implies : or max{Dδ(t, x, y)βz(x, y)ℓ, ℓ ∈ ∆+} > 0 .

slide-69
SLIDE 69

PDE on the space boundary (x, y) ∈ ∂O(t)

The GDP and the need for a reflexion on the boundary leads to the definition of Ninv := {α ∈ Nv : Dδ(·, v)σZ(·, v) = 0} F inv := sup

α∈Ninv

min

  • µY (·, v) − Lα

X,Pv , LZδ(·, v)

  • G inv

:= max

ℓ∈∆+ min {[βY (·, v) − DxvβX]ℓ , Dδ(·, v)βz(·, v)ℓ}

slide-70
SLIDE 70

PDE on the space boundary (x, y) ∈ ∂O(t)

The GDP and the need for a reflexion on the boundary leads to the definition of Ninv := {α ∈ Nv : Dδ(·, v)σZ(·, v) = 0} F inv := sup

α∈Ninv

min

  • µY (·, v) − Lα

X,Pv , LZδ(·, v)

  • G inv

:= max

ℓ∈∆+ min {[βY (·, v) − DxvβX]ℓ , Dδ(·, v)βz(·, v)ℓ}

Then, the PDE on the boundary reads max{F in

0 v , G inv} = 0 on (t, x, v(t, x)) ∈ ∂D .

slide-71
SLIDE 71

Example Pricing of the WVAP-guaranteed liquidation contract

slide-72
SLIDE 72

The VWAP guaranted pricing problem

✷ K stocks to liquidate.

slide-73
SLIDE 73

The VWAP guaranted pricing problem

✷ K stocks to liquidate. ✷ Has an impact on prices

slide-74
SLIDE 74

The VWAP guaranted pricing problem

✷ K stocks to liquidate. ✷ Has an impact on prices ✷ Ensure that will guarantee a mean selling price of γ × the mean selling price of the market.

slide-75
SLIDE 75

The VWAP guaranted pricing problem

✷ K stocks to liquidate. ✷ Has an impact on prices ✷ Ensure that will guarantee a mean selling price of γ × the mean selling price of the market. ✷ What is the price of the guarantee ?

slide-76
SLIDE 76

The VWAP guaranted pricing problem

✷ Controls : L ↑ adapted and continuous. Lt = # of sold stocks.

slide-77
SLIDE 77

The VWAP guaranted pricing problem

✷ Controls : L ↑ adapted and continuous. Lt = # of sold stocks. ✷ Price dynamics : dX L,1 = X L,1µ(X L,1)dt + X L,1σ(X L,1)dWt − X L,1β(X L,1(t))dLt

slide-78
SLIDE 78

The VWAP guaranted pricing problem

✷ Controls : L ↑ adapted and continuous. Lt = # of sold stocks. ✷ Price dynamics : dX L,1 = X L,1µ(X L,1)dt + X L,1σ(X L,1)dWt − X L,1β(X L,1(t))dLt ✷ Cumulated gain from liquidation : dY L = X L,1dLt

slide-79
SLIDE 79

The VWAP guaranted pricing problem

✷ Controls : L ↑ adapted and continuous. Lt = # of sold stocks. ✷ Price dynamics : dX L,1 = X L,1µ(X L,1)dt + X L,1σ(X L,1)dWt − X L,1β(X L,1(t))dLt ✷ Cumulated gain from liquidation : dY L = X L,1dLt ✷ Volume weighted market price : dX L,2 = X L,1dϑ.

slide-80
SLIDE 80

The VWAP guaranted pricing problem

✷ Controls : L ↑ adapted and continuous. Lt = # of sold stocks. ✷ Price dynamics : dX L,1 = X L,1µ(X L,1)dt + X L,1σ(X L,1)dWt − X L,1β(X L,1(t))dLt ✷ Cumulated gain from liquidation : dY L = X L,1dLt ✷ Volume weighted market price : dX L,2 = X L,1dϑ. ✷ Cumulated # of sold stocks : X L,3 := L ∈ [Λ, ¯ Λ] → {K}

slide-81
SLIDE 81

The VWAP guaranted pricing problem

✷ Controls : L ↑ adapted and continuous. Lt = # of sold stocks. ✷ Price dynamics : dX L,1 = X L,1µ(X L,1)dt + X L,1σ(X L,1)dWt − X L,1β(X L,1(t))dLt ✷ Cumulated gain from liquidation : dY L = X L,1dLt ✷ Volume weighted market price : dX L,2 = X L,1dϑ. ✷ Cumulated # of sold stocks : X L,3 := L ∈ [Λ, ¯ Λ] → {K} ✷ Risk constraint (with γ ∈ (0, 1)) X L,3

t,x ∈ [Λ, Λ] and E

  • Y L

t,x,y(T) − KγX L,2 t,x (T)

  • ≥ p} .
slide-82
SLIDE 82

The VWAP guaranted pricing problem

✷ Controls : L ↑ adapted and continuous. Lt = # of sold stocks. ✷ Price dynamics : dX L,1 = X L,1µ(X L,1)dt + X L,1σ(X L,1)dWt − X L,1β(X L,1(t))dLt ✷ Cumulated gain from liquidation : dY L = X L,1dLt ✷ Volume weighted market price : dX L,2 = X L,1dϑ. ✷ Cumulated # of sold stocks : X L,3 := L ∈ [Λ, ¯ Λ] → {K} ✷ Pricing function (with Ψ(x, y) = ℓ(y − γKx2), γ > 0) v(t, x, p) := inf{y ≥ 0 : ∃L s.t. X L,3

t,x ∈ [Λ, Λ] , E

  • Ψ(Z L

t,x,y(T))

  • ≥ p} .
slide-83
SLIDE 83

PDE characterization

Proposition Under “good assumptions”, v∗ is a viscosity supersolution on [0, T) of max

  • Fϕ , x1 + x1βDx1ϕ − Dx3ϕ
  • = 0 if Λ ≤ x3 ≤ Λ

and v∗ is a subsolution on [0, T) of min

  • ϕ , max
  • Fϕ , x1 + x1βDx1ϕ − Dx3ϕ
  • = 0

if Λ < x3 < Λ min

  • ϕ , x1 + βDx1ϕ − Dx3ϕ
  • = 0

if Λ = x3 min {ϕ , Fϕ} = 0 if x3 = Λ , where Fϕ := −LXϕ−(x1σ)2 2

  • |Dx1ϕ/Dpϕ|2D2

pϕ − 2(Dx1ϕ/Dpϕ)D2 (x1,p)ϕ

  • .

Moreover, v∗(T, x, p) = v∗(T, x, p) = Ψ−1(x, p).

slide-84
SLIDE 84

PDE characterization

Proposition Under “good assumptions”, v∗ is a viscosity supersolution on [0, T) of max

  • Fϕ , x1 + x1βDx1ϕ − Dx3ϕ
  • = 0 if Λ ≤ x3 ≤ Λ

and v∗ is a subsolution on [0, T) of min

  • ϕ , max
  • Fϕ , x1 + x1βDx1ϕ − Dx3ϕ
  • = 0

if Λ < x3 < Λ min

  • ϕ , x1 + βDx1ϕ − Dx3ϕ
  • = 0

if Λ = x3 min {ϕ , Fϕ} = 0 if x3 = Λ , where Fϕ := −LXϕ−(x1σ)2 2

  • |Dx1ϕ/Dpϕ|2D2

pϕ − 2(Dx1ϕ/Dpϕ)D2 (x1,p)ϕ

  • .

Moreover, v∗(T, x, p) = v∗(T, x, p) = Ψ−1(x, p).

slide-85
SLIDE 85

The “good assumptions”

✷ On Λ, Λ : Λ, Λ ∈ C 1, Λ < ¯ Λ on [0, T), DΛ, DΛ ∈ (0, M]

slide-86
SLIDE 86

The “good assumptions”

✷ On Λ, Λ : Λ, Λ ∈ C 1, Λ < ¯ Λ on [0, T), DΛ, DΛ ∈ (0, M] ✷ On the loss function ℓ : ∃ ǫ > 0 s.t. ǫ ≤ D−ℓ , D+ℓ ≤ ǫ−1 , and lim

r→∞ D+ℓ(r) = lim r→∞ D−ℓ(r) .

slide-87
SLIDE 87

Control on the gradients

✷ Proposition v∗ is a viscosity supersolution of min {Dpϕ − ǫ , (Dx1ϕ − CDpϕ)1x1>0 , −Dx1ϕ + CDpϕ} = 0 (∗) and v∗ is a viscosity subsolution of max {−Dpϕ + ǫ , (Dx1ϕ − CDpϕ)1x1>0 , −Dx1ϕ + CDpϕ} = 0 . (∗∗) where C is continuous and depends only on x.

slide-88
SLIDE 88

Control on the gradients

✷ Proposition v∗ is a viscosity supersolution of min {Dpϕ − ǫ , (Dx1ϕ − CDpϕ)1x1>0 , −Dx1ϕ + CDpϕ} = 0 (∗) and v∗ is a viscosity subsolution of max {−Dpϕ + ǫ , (Dx1ϕ − CDpϕ)1x1>0 , −Dx1ϕ + CDpϕ} = 0 . (∗∗) where C is continuous and depends only on x. ✷ Provides a control on the ratio Dx1ϕ/Dpϕ in Fϕ := −LXϕ−(x1σ)2 2

  • |Dx1ϕ/Dpϕ|2D2

pϕ − 2(Dx1ϕ/Dpϕ)D2 (x1,p)ϕ

  • .
slide-89
SLIDE 89

More controls on v

slide-90
SLIDE 90

More controls on v

✷ It also implies that ∃ η > 0 s.t. 0 ≤ v(t, x, p) ≤ ǫ−1|p − ℓ(0)| + γη(1 + |x|) ,

slide-91
SLIDE 91

More controls on v

✷ It also implies that ∃ η > 0 s.t. 0 ≤ v(t, x, p) ≤ ǫ−1|p − ℓ(0)| + γη(1 + |x|) , ✷ and that for (tn, xn, pn)n s.t. (tn, xn) → (t, x) : lim

n→∞ v∗(tn, xn, pn) = lim n→∞ v∗(tn, xn, pn) = 0 if pn → −∞ ,

lim

n→∞ v∗(tn,xn,pn) pn

= lim

n→∞ v∗(tn,xn,pn) pn

=

1 Dℓ(∞) if pn → ∞ .

slide-92
SLIDE 92

More controls on v

✷ It also implies that ∃ η > 0 s.t. 0 ≤ v(t, x, p) ≤ ǫ−1|p − ℓ(0)| + γη(1 + |x|) , ✷ and that for (tn, xn, pn)n s.t. (tn, xn) → (t, x) : lim

n→∞ v∗(tn, xn, pn) = lim n→∞ v∗(tn, xn, pn) = 0 if pn → −∞ ,

lim

n→∞ v∗(tn,xn,pn) pn

= lim

n→∞ v∗(tn,xn,pn) pn

=

1 Dℓ(∞) if pn → ∞ .

✷ A little more : v is continuous in p and x3.

slide-93
SLIDE 93

Uniqueness

✷ Want a comparison resul in the class of function with the above limit and growth conditions.

slide-94
SLIDE 94

Uniqueness

✷ Want a comparison resul in the class of function with the above limit and growth conditions. ✷ Recall that Fϕ := −LXϕ−(x1σ)2 2

  • |Dx1ϕ/Dpϕ|2D2

pϕ − 2(Dx1ϕ/Dpϕ)D2 (x1,p)ϕ

  • .
slide-95
SLIDE 95

Uniqueness

✷ Want a comparison resul in the class of function with the above limit and growth conditions. ✷ Recall that Fϕ := −LXϕ−(x1σ)2 2

  • |Dx1ϕ/Dpϕ|2D2

pϕ − 2(Dx1ϕ/Dpϕ)D2 (x1,p)ϕ

  • .

✷ We now control Dx1ϕ/Dpϕ. This is not enough... If we need to penalize in x1 (stock price) then the therm |Dx1ϕ/Dpϕ|2D2

pϕ will blow up as n → ∞, where n

comes from the usual penalisation n|x1

1 − x1 2|2 du to the doubling of

constants.

slide-96
SLIDE 96

Uniqueness

✷ Want a comparison resul in the class of function with the above limit and growth conditions. ✷ Recall that Fϕ := −LXϕ−(x1σ)2 2

  • |Dx1ϕ/Dpϕ|2D2

pϕ − 2(Dx1ϕ/Dpϕ)D2 (x1,p)ϕ

  • .

✷ We now control Dx1ϕ/Dpϕ. This is not enough... If we need to penalize in x1 (stock price) then the term |Dx1ϕ/Dpϕ|2D2

pϕ will blow up as n → ∞, where n comes

from the usual penalisation n|x1

1 − x1 2|2 due to the doubling of

constants.

slide-97
SLIDE 97

Uniqueness

✷ Want a comparison resul in the class of function with the above limit and growth conditions. ✷ Recall that Fϕ := −LXϕ−(x1σ)2 2

  • |Dx1ϕ/Dpϕ|2D2

pϕ − 2(Dx1ϕ/Dpϕ)D2 (x1,p)ϕ

  • .

✷ We now control Dx1ϕ/Dpϕ. Assumption : ∃ ˆ x1 > 0 s.t. µ(ˆ x1) ≤ 0 = σ(ˆ x1) .

slide-98
SLIDE 98

Uniqueness

✷ Want a comparison resul in the class of function with the above limit and growth conditions. ✷ Recall that Fϕ := −LXϕ−(x1σ)2 2

  • |Dx1ϕ/Dpϕ|2D2

pϕ − 2(Dx1ϕ/Dpϕ)D2 (x1,p)ϕ

  • .

✷ We now control Dx1ϕ/Dpϕ. Assumption : ∃ ˆ x1 > 0 s.t. µ(ˆ x1) ≤ 0 = σ(ˆ x1) . ✷ Bound on the stock price...

slide-99
SLIDE 99

Comparison

✷ Theorem : Let U (resp. V ) be a non-negative super- and subsolutions which are continuous in x3. Assume that U(t, x, p) ≥ V (t, x, p) if t = T or x1 ∈ {0, 2ˆ x1}, and that ∃ c+ > 0 and c− ∈ R s.t. lim sup

(t′,x′,p′)→(t,x,∞)

V (t′, x′, p′)/p′ ≤ c+ ≤ lim inf

(t′,y′,p′)→(t,y,∞) U(t′, y′, p′)/p′ ,

lim sup

(t′,x′,p′)→(t,x,−∞)

V (t′, x′, p′) ≤ c− ≤ lim inf

(t′,y′,p′)→(t,y,−∞) U(t′, y′, p′) .

If either U is a supersolution of (*) which is continuous in p, or V is a subsolution of (**) which is continuous in p, then U ≥ V .

slide-100
SLIDE 100

Additional remarks

slide-101
SLIDE 101

Optimal management under shortfall constraints

✷ Serves as a building block for problems of the form sup

φ∈At,z

E

  • U(X φ

t,x(T), Y φ t,z(T))

  • with At,z := {φ ∈ A : Z φ

t,z ∈ O on [t, T]} .

slide-102
SLIDE 102

Optimal management under shortfall constraints

✷ Serves as a building block for problems of the form sup

φ∈At,z

E

  • U(X φ

t,x(T), Y φ t,z(T))

  • with At,z := {φ ∈ A : Z φ

t,z ∈ O on [t, T]} .

✷ Amongs to say that Y φ

t,z ≥ v(·, X φ t,x)

where v(t, x) := inf

  • y : ∃ φ ∈ A s.t. Z φ

t,z ∈ O on [t, T]

  • ,

see B., Elie and Imbert (2010).

slide-103
SLIDE 103

BSDE with moment conditions

✷ Look for the minimal solution (Y , Z) of Yt = YT + T

t

f (s, Ys, Zs)ds − T

t

ZsdWs such that E [G(YT, ξ)] ≥ p .

slide-104
SLIDE 104

BSDE with moment conditions

✷ Look for the minimal solution (Y , Z) of Yt = YT + T

t

f (s, Ys, Zs)ds − T

t

ZsdWs such that E [G(YT, ξ)] ≥ p . ✷ Can use the same approach : for α ∈ A set Y α

t = G −1(Pα T, ξ) +

T

t

f (s, Y α

s , Z α s )ds −

T

t

Z α

s dWs

slide-105
SLIDE 105

BSDE with moment conditions

✷ Look for the minimal solution (Y , Z) of Yt = YT + T

t

f (s, Ys, Zs)ds − T

t

ZsdWs such that E [G(YT, ξ)] ≥ p . ✷ Can use the same approach : for α ∈ A set Y α

t = G −1(Pα T, ξ) +

T

t

f (s, Y α

s , Z α s )ds −

T

t

Z α

s dWs

✷ The minimal solution is (formally) given by Y = essinf

α Y α .

slide-106
SLIDE 106

Optimal control vs stochastic targets

✷ Consider the control problem : w := inf

φ E

  • U(X φ(T))
slide-107
SLIDE 107

Optimal control vs stochastic targets

✷ Consider the control problem : w := inf

φ E

  • U(X φ(T))
  • ✷ Then, it can be written as a stochastic target problem

w = v := inf

  • p : ∃ (φ, α) s.t. U(X φ(T)) ≤ Pα

p (T)

  • with Pα

p := p +

·

0 αsdWs.

slide-108
SLIDE 108

Optimal control vs stochastic targets

✷ Consider the control problem : w := inf

φ E

  • U(X φ(T))
  • ✷ Then, it can be written as a stochastic target problem

w = v := inf

  • p : ∃ (φ, α) s.t. U(X φ(T)) ≤ Pα

p (T)

  • with Pα

p := p +

·

0 αsdWs.

✷ Allows for a unified approach (obviously obtains -immediately- the same HJB PDE)