Optimal investment to minimize the probability of drawdown

Size: px
Start display at page:

Download "Optimal investment to minimize the probability of drawdown"

Transcription

1 Optial investent to iniize the probability of drawdown Bahan Angoshtari Joint work with E. Bayraktar and V. R. Young Financial/Actuarial Matheatics Seinar University of Michigan Noveber 2 nd, 2016

2 Drawdown dd t = ax W s W t =: M t W t s [0,t]

3 Drawdown dd t = ax W s W t =: M t W t s [0,t] Max. drawdown ax dd t t [0,T ] is a conservative easure for the potential loss of a portfolio

4 Drawdown dd t = ax W s W t =: M t W t s [0,t] Max. drawdown ax dd t t [0,T ] is a conservative easure for the potential loss of a portfolio Max. drawdown duration ax t [0,T ] { } t arg ax W s s [0,t] is a conservative easure of how long a loss lasts

5 Related Literature Drawdown constraint: Grossan and Zhou (1993), Cvitanic and Karatzas (1995),..., Cherny and Ob lój (2013), Kardaras et al. (2014),...

6 Related Literature Drawdown constraint: Grossan and Zhou (1993), Cvitanic and Karatzas (1995),..., Cherny and Ob lój (2013), Kardaras et al. (2014),... Goal-seeking probles: Typically to iniize probability of ruin or to axiize probability of reaching a bequest Dubins and Savage (1965, 1975), Pestien and Sudderth (1985), Karatzas (1997), Browne (1995, 1997, 1999a,b), Young (2004), Proislow and Young (2005), Bayraktar and Young (2007), Bäuerle and Bayraktar (2014), Bayraktar and Young (2016),... drift Maxiizing, axiizes the prob. of reaching b before reaching a < b volatility2

7 Related Literature Drawdown constraint: Grossan and Zhou (1993), Cvitanic and Karatzas (1995),..., Cherny and Ob lój (2013), Kardaras et al. (2014),... Goal-seeking probles: Typically to iniize probability of ruin or to axiize probability of reaching a bequest Dubins and Savage (1965, 1975), Pestien and Sudderth (1985), Karatzas (1997), Browne (1995, 1997, 1999a,b), Young (2004), Proislow and Young (2005), Bayraktar and Young (2007), Bäuerle and Bayraktar (2014), Bayraktar and Young (2016),... drift Maxiizing, axiizes the prob. of reaching b before reaching a < b volatility2 Miniizing probability of drawdown ( a fraction of the running axiu): Bäuerle and Bayraktar (2014): the optiizer is the sae as the ruin/bequest proble if the axiized ratio is independent of the state variable Chen et al. (2015), Angoshtari et al. (2016a), Angoshtari et al. (2016b)

8 Proble stateent A riskless with short-rate r > 0 and a stock ds t = µs tdt + σs tdb t

9 Proble stateent A riskless with short-rate r > 0 and a stock ds t = µs tdt + σs tdb t W t the value of the fund, and π t the aount invested in the stock

10 Proble stateent A riskless with short-rate r > 0 and a stock ds t = µs tdt + σs tdb t W t the value of the fund, and π t the aount invested in the stock The fund pays out at at deterinist rate c(w t) 0, e.g. c(w t) = c W t c(w t) c or

11 Proble stateent A riskless with short-rate r > 0 and a stock ds t = µs tdt + σs tdb t W t the value of the fund, and π t the aount invested in the stock The fund pays out at at deterinist rate c(w t) 0, e.g. c(w t) = c W t c(w t) c or The budget constraint: dw t = [r W t + (µ r)π t c(w t)] dt + σπ tdb t We assue (π t) to be progressively easurable and t 0 π2 sds < a.s.

12 Proble stateent A riskless with short-rate r > 0 and a stock ds t = µs tdt + σs tdb t W t the value of the fund, and π t the aount invested in the stock The fund pays out at at deterinist rate c(w t) 0, e.g. c(w t) = c W t c(w t) c or The budget constraint: dw t = [r W t + (µ r)π t c(w t)] dt + σπ tdb t We assue (π t) to be progressively easurable and t 0 π2 sds < a.s. The running axiu (or the } high-water-ark ): M t = ax {M 0, sup 0 s t W t

13 Proble stateent A riskless with short-rate r > 0 and a stock ds t = µs tdt + σs tdb t W t the value of the fund, and π t the aount invested in the stock The fund pays out at at deterinist rate c(w t) 0, e.g. c(w t) = c W t c(w t) c or The budget constraint: dw t = [r W t + (µ r)π t c(w t)] dt + σπ tdb t We assue (π t) to be progressively easurable and t 0 π2 sds < a.s. The running axiu (or the } high-water-ark ): M t = ax {M 0, sup 0 s t W t W 0 = w and M 0 = are given, where 0 < w

14 Proble stateent, cont w Given a constant 0 < α < 1, drawdown happens if W t α M t

15 Proble stateent, cont w Given a constant 0 < α < 1, drawdown happens if W t α M t Define τ α = inf{t 0 : W t α M t}

16 Proble stateent, cont w Given a constant 0 < α < 1, drawdown happens if W t α M t Define τ α = inf{t 0 : W t α M t} Miniu probability of (eternal) drawdown φ(w, ) = inf π P w, (τ α < ); 0 < w

17 Proble stateent, cont w Given a constant 0 < α < 1, drawdown happens if W t α M t Define τ α = inf{t 0 : W t α M t} Miniu probability of (eternal) drawdown φ(w, ) = inf π P w, (τ α < ); 0 < w

18 Proble stateent, cont w Given a constant 0 < α < 1, drawdown happens if W t α M t Define τ α = inf{t 0 : W t α M t} Miniu probability of (eternal) drawdown φ(w, ) = inf π P w, (τ α < ); 0 < w

19 Safe level w s w Assuption: c(w) is continuous, non-negative and non-decreasing There is a 0 < w s + such that { r w < c(w); w < ws r w > c(w); w > w s w s

20 Safe level w s w Assuption: c(w) is continuous, non-negative and non-decreasing There is a 0 < w s + such that { r w < c(w); w < ws r w > c(w); w > w s Exaple: c(w) c w s = c r c(w) = c w, c > r w s = + w s

21 Safe level w s w Assuption: c(w) is continuous, non-negative and non-decreasing There is a 0 < w s + such that { r w < c(w); w < ws r w > c(w); w > w s Exaple: c(w) c w s = c r c(w) = c w, c > r w s = + w s If W t w s, the consuption can be financed by investing risk-free For w s w, we have φ(w, ) = 0 and π 0

22 w s and α < w < w s w Drawdown is equivalent to hitting α = iniizing probability of ruin w s

23 w s and α < w < w s w Drawdown is equivalent to hitting α = iniizing probability of ruin Bäuerle and Bayraktar (2014)- The optiizer is obtain by axiizing r w + (µ r)π c(w) σ 2 π 2 which yields π (w) = 2( c(w) r w ) independent of and α µ r w s

24 w s and α < w < w s w Drawdown is equivalent to hitting α = iniizing probability of ruin Bäuerle and Bayraktar (2014)- The optiizer is obtain by axiizing r w + (µ r)π c(w) σ 2 π 2 which yields π (w) = 2( c(w) r w ) independent of and α µ r w s The optial wealth { } dw t = (c(w t) rw t) dt + 2σ µ r dbt and the in. prob. of ruin/drawdown is φ(w, ) = 1 g(w,) g(w, ) = w α exp ( y α ) δ du c(u) ru dy, δ := 1 2 where g(w s,) ) 2 ( µ r σ

25 < w s and α < w < w s w Drawdown ay happen at a level higher than α w s

26 < w s and α < w < w s w Drawdown ay happen at a level higher than α drift The axiu volatility 2 is (µ r) 2 4σ 2( c(w) r w ) not independent of w = Bäuerle and Bayraktar (2014) does not apply to the drawdown proble w s

27 < w s and α < w < w s w Drawdown ay happen at a level higher than α drift The axiu volatility 2 is (µ r) 2 4σ 2( c(w) r w ) not independent of w = Bäuerle and Bayraktar (2014) does not apply to the drawdown proble w s Let L π f(w, ) = [ r w + (µ r)π c(w) ] f w(w, ) σ2 π 2 f ww(w, ) and D = {(w, ) : 0 < α w in(, w s)}

28 Theore (Verification for the eternal proble) If h : D R is bounded and continuous and satisfies: (i) h(, ) C 2 is non-increasing and convex (ii) h(w, ) is continuously differentiable, except possibly at w s where it has right and left derivative (iii) h (, ) 0 if < w s (iv) h(α, ) = 1 (v) h(w s, ) = 0 if > w s w (vi) L π h 0 for all π Then, h(w, ) φ(w, ) on D w s

29 Theore (Verification for the eternal proble) If h : D R is bounded and continuous and satisfies: (i) h(, ) C 2 is non-increasing and convex (ii) h(w, ) is continuously differentiable, except possibly at w s where it has right and left derivative (iii) h (, ) 0 if < w s (iv) h(α, ) = 1 (v) h(w s, ) = 0 if > w s w (vi) L π h 0 for all π Then, h(w, ) φ(w, ) on D w s Proof: φ(w, ) = inf π E w, (1 {τα< }), apply Itô s forula to h(w π τ n, M π τ n )...

30 < w s : HJB equation For N w s and α w N sup L h N = ( r w c(w) ) h N w δ (hn w ) 2 π h N ww h N (α, ) = 1, h N (, ) = 0 h N (N, N) = 0 = 0; (BVP) Proposition The solution of (BVP) is h N (w, ) = 1 e N f(y)dy g(w, ) g(n, N) [ ] 1 where f() = α g(, ) δ. c(α) rα

31 < w s : The optial strategy h ws is the iniu probability of drawdown on α w w s Extra care if w s = +

32 < w s : The optial strategy h ws is the iniu probability of drawdown on α w w s Extra care if w s = + The optial strategy is π (w) = µ r h ws w = 2( c(w) r w ) σ 2 h ws ww µ r The sae as the one for probability of ruin!

33 < w s : The optial strategy h ws is the iniu probability of drawdown on α w w s Extra care if w s = + The optial strategy is π (w) = µ r σ 2 The sae as the one for probability of ruin! h ws w = 2( c(w) r w ) h ws ww µ r Note that for < w s, we have π () > 0 The optial strategy allows for the running ax to increase to w s

34 The optial strategy Theore The optial strategy is 0; W t w s π (W t) = ( ) 2 c(w) r w ; α < W µ r t < w s the iniu probability of drawdown is g(w, ) 1 g(w s, ), φ(w, ) = 1 e ws f(y)dy g(w,), g(w s,w s) w w s if α w ws, ws, if α w < ws,

35 The optial strategy Theore The optial strategy is 0; W t w s π (W t) = ( ) 2 c(w) r w ; α < W µ r t < w s the iniu probability of drawdown is g(w, ) 1 g(w s, ), φ(w, ) = 1 e ws f(y)dy g(w,), g(w s,w s) w w s if α w ws, ws, if α w < ws, The optial strategy is: independent of α and M t for w < w s, it is optial to let M t to increase up to w s

36 The lifetie drawdown proble The sae arket setting as before Introduce tie of death of the investor τ d Exp(λ)

37 The lifetie drawdown proble The sae arket setting as before Introduce tie of death of the investor τ d Exp(λ) Miniu probability of lifetie drawdown φ(w, ) = inf π P w, (τ α < τ d ); 0 < w

38 The lifetie drawdown proble The sae arket setting as before Introduce tie of death of the investor τ d Exp(λ) w Miniu probability of lifetie drawdown φ(w, ) = inf π P w, (τ α < τ d ); 0 < w Chen et al. (2015) considered the case of proportional consuption c(w) = κ w for κ > r = w s =

39 The lifetie drawdown proble The sae arket setting as before Introduce tie of death of the investor τ d Exp(λ) w Miniu probability of lifetie drawdown φ(w, ) = inf π P w, (τ α < τ d ); 0 < w Chen et al. (2015) considered the case of proportional consuption c(w) = κ w for κ > r = w s = They showed that it is not optial for M t to increase

40 The lifetie drawdown proble The sae arket setting as before Introduce tie of death of the investor τ d Exp(λ) w Miniu probability of lifetie drawdown φ(w, ) = inf π P w, (τ α < τ d ); 0 < w Chen et al. (2015) considered the case of proportional consuption c(w) = κ w for κ > r = w s = They showed that it is not optial for M t to increase We consider constant consuption rate: c(w) = c > 0

41 > c r w The safe level is c r : c < r w w > c r For W t c r, we have π t = 0 and ϕ(w, ) = 0 c r

42 > c r w The safe level is c r : c < r w w > c r For W t c r, we have π t = 0 and ϕ(w, ) = 0 For w < c r Drawdown is equivalent to hitting α = iniizing probability of lifetie ruin Young (2004)- πt = µ r 1 ( c ) σ 2 γ 1 r W t π independent of and α γ = 1 [ (r + λ + δ) + ] (r + λ + δ) 2r 2 4rλ > 1, δ = 1 2 c r ( µ r ) 2 σ

43 > c r w The safe level is c r : c < r w w > c r For W t c r, we have π t = 0 and ϕ(w, ) = 0 For w < c r Drawdown is equivalent to hitting α = iniizing probability of lifetie ruin Young (2004)- πt = µ r 1 ( c ) σ 2 γ 1 r W t π independent of and α γ = 1 [ (r + λ + δ) + ] (r + λ + δ) 2r 2 4rλ > 1, δ = 1 2 The optial wealth: dwt π = ( c W ) {( π 2δ r t the in. prob. of ruin/drawdown: φ(w, ) = γ 1 r ) ( c/r w c/r α dt + µ r σ ) γ c r ( µ r ) 2 σ } 1 γ 1 dbt

44 0 < c r : Main result w There exists a critical high-water-ark (0, c ) such that: r c r

45 0 < c r : Main result w There exists a critical high-water-ark (0, c ) such that: r (i) For (, c ), the optial strategy r lets M to increase above c r

46 0 < c r : Main result w There exists a critical high-water-ark (0, c ) such that: r (i) For (, c ), the optial strategy r lets M to increase above c r (ii) For (0, ], the optial strategy keeps M t =

47 Theore (Verification for the lifetie proble) If h : D R is bounded and continuous and satisfies: (i) h(, ) C 2 is non-increasing and convex (ii) h(w, ) is continuously differentiable, except possibly at finitely any points where it has right and left derivative (iii) h (, ) 0 if < w s (iv) h(α, ) = 1 (v) h(w s, ) = 0 if > w s w (vi) L π h λ h 0 for all π Then, h(w, ) φ(w, ) on D c r

48 Theore (Verification for the lifetie proble) If h : D R is bounded and continuous and satisfies: (i) h(, ) C 2 is non-increasing and convex (ii) h(w, ) is continuously differentiable, except possibly at finitely any points where it has right and left derivative (iii) h (, ) 0 if < w s (iv) h(α, ) = 1 (v) h(w s, ) = 0 if > w s w (vi) L π h λ h 0 for all π Then, h(w, ) φ(w, ) on D c r [ ] Proof: φ(w, ) = inf E w, 1 [ ] π {τα<t}λ e λ t dt = inf E w, e λ τα 0 π apply Itô s forula to e λ τn h(wτ π n, Mτ π n )...

49 For an arbitrary 0 (0, c/r), consider the BVP on 0 c/r and α w sup L h = (r w c)h w δ h2 w = λ h π h ww h(α, ) = 1, h (, ) = 0 li c/r h(, ) = 0 (BVP)

50 For an arbitrary 0 (0, c/r), consider the BVP on 0 c/r and α w sup L h = (r w c)h w δ h2 w = λ h π h ww h(α, ) = 1, h (, ) = 0 li c/r h(, ) = 0 Legendre transfor: φ(y, ) = in {h(w, ) + w y} w δy 2 φyy (r λ)y φ y λ φ + cy = 0 φ(ỹ α(), ) = 1 + α ỹ α(), φy(ỹ α(), ) = α φ y(ỹ (), ) =, φ(ỹ (), ) = 0 li φ (ỹ (), ) = c ( c ) c/r r ỹ r li φ y (ỹ (), ) = c c/r r (BVP) (FBP)

51 Ansatz: φ(y, ) = D1()y B 1 + D 2()y B 2 + c y r [ B 1 = 1 (r λ + δ) + ] (r λ + δ) 2δ 2 + 4λδ = γ > 1 γ 1 [ B 2 = 1 (r λ + δ) ] (r λ + δ) 2δ 2 + 4λδ < 0 Proposition (solution of FBP) Assue that z g 1(z)(c/r ) + g 0(z) () = h 2(z)(c/r ) 2 + h 1(z)(c/r ) + h 0(z) z(c/r) = 0 (ODE) has a solution on z : [ 0, c/r] [0, 1]. Here, g i and h i are known functions.

52 Proposition (solution of FBP, cont ) Then, the solution of (FBP) for (y, ) [ỹ (), ỹ α()] [ 0, c/r] is ) B1 φ(y, ) = c [ r y B ( 2 c ) ] ( 1 + B 1 B 2 r α B2 y ỹ α() B 1 B 2 ỹ α() [ B ( 1 c ) ] ( ) B2 + B 1 B 2 r α B1 1 y ỹ α(), B 1 B 2 ỹ α() where the free boundaries are 1 B ( 1B ) 2 z() B1 1 z() B 2 1 ỹ α() B 1 B 2 ( c ) = r and ỹ = z()ỹ α() ( c r α ) [ B 1(1 B 2) B 1 B 2 z() B ] B2(B1 1) z() B 2 1 B 1 B 2

53 z g 1(z)(c/r ) + g 0(z) () = h 2(z)(c/r ) 2 + h 1(z)(c/r ) + h 0(z) z(c/r) = 0 (ODE) A solution of (ODE) on [ 0, c/r] yields φ(w, ) for 0 c/r and α w

54 z g 1(z)(c/r ) + g 0(z) () = h 2(z)(c/r ) 2 + h 1(z)(c/r ) + h 0(z) z(c/r) = 0 (ODE) A solution of (ODE) on [ 0, c/r] yields φ(w, ) for 0 c/r and α w The inverse of z() satisfies an Able equation Any chance for a closed for solution? Functions g i and h i are too coplicated...

55 The auxiliary functions g 0(z) = (1 α) c r (zb2 z B1 ) [(B 2 1)z B 1 1 (B 1 1)z B 2 1] [ g 1(z) = (z B2 z B1 ) B 1 B 2 + α(b 2 1)z B 1 1 ] α(b 1 1)z B α(b 1 1)(B 2 1)(z B 1 1 z B 2 1 ) ( ) c 2 h 0(z) = (1 α) 2 (B 1 B 2)z B 1 +B 2 2[ (B 1 1)z B 2 1 (B 2 1)z B 1 1] r h 1(z) = (1 α) c r { [ (B 2 1)z B 1 1 (B 1 1)z B 2 1] [(B 1 1)z B 1 1 (B 2 1)z B 2 1 α(b 1 B 2)z B 1 +B 2 2] (B 1 B 2)z B 1 +B 2 2[ B 1 B 2 + α(b 2 1)z B 1 1 α(b 1 1)z B 2 1]} h 2(z) = [ (B 1 1)z B 1 1 (B 2 1)z B 2 1 α(b 1 B 2)z B 1 +B 2 2] [B 1 B 2 + α(b 2 1)z B 1 1 α(b 1 1)z B 2 1]

56 z Motivation & Lit. The Eternal Proble The Lifetie Proble Conclusion References z g 1(z)(c/r ) + g 0(z) G(, z) () = =: h 2(z)(c/r ) 2 + h 1(z)(c/r ) + h 0(z) H(, z) z(c/r) = 0 (ODE) ( ) 1 H, 0 for a known x() functions x() Sign of F (; z) = G(; z)=h(; z) 0.8 = 9(z) 1=x( b) z = 1 x() 0 0 b c r

57 z Motivation & Lit. The Eternal Proble The Lifetie Proble Conclusion References z g 1(z)(c/r ) + g 0(z) G(, z) () = =: h 2(z)(c/r ) 2 + h 1(z)(c/r ) + h 0(z) H(, z) z(c/r) = 0 (ODE) ( ) 1 H, 0 for a known x() functions x() G (ξ(z), z) 0 for a known functions ξ(z) = 9(z) Sign of F (; z) = G(; z)=h(; z) 1=x( b) z = 1 x() 0 0 b c r

58 z Motivation & Lit. The Eternal Proble The Lifetie Proble Conclusion References z g 1(z)(c/r ) + g 0(z) G(, z) () = =: h 2(z)(c/r ) 2 + h 1(z)(c/r ) + h 0(z) H(, z) z(c/r) = 0 (ODE) ( ) 1 H, 0 for a known x() functions x() G (ξ(z), z) 0 for a known functions ξ(z) = 9(z) Sign of F (; z) = G(; z)=h(; z) ( ) 1 (ξ(z), z) and, x() ( ) 1 intersect at, ˆ where x( ˆ) ˆ (0, c/r) 1=x( b) z = 1 x() 0 0 b c r

59 z Motivation & Lit. The Eternal Proble The Lifetie Proble Conclusion References z g 1(z)(c/r ) + g 0(z) G(, z) () = =: h 2(z)(c/r ) 2 + h 1(z)(c/r ) + h 0(z) H(, z) z(c/r) = 0 (ODE) ( ) 1 H, 0 for a known x() functions x() Integral Curves G (ξ(z), z) 0 for a known functions ξ(z) 0.8 ( ) 1 (ξ(z), z) and, x() ( ) 1 intersect at, ˆ where x( ˆ) ˆ (0, c/r) 1=x( b) b c r

60 z Motivation & Lit. The Eternal Proble The Lifetie Proble Conclusion References z g 1(z)(c/r ) + g 0(z) G(, z) () = =: h 2(z)(c/r ) 2 + h 1(z)(c/r ) + h 0(z) H(, z) z(c/r) = 0 (ODE) ( ) 1 H, 0 for a known x() functions x() The solution of BVP (5.22) G (ξ(z), z) 0 for a known functions ξ(z) ( ) 1 (ξ(z), z) and, x() ( ) 1 intersect at, ˆ where x( ˆ) ˆ (0, c/r) 0.8 1=x( $ ) 1=x( b) $ b c r

61 z Motivation & Lit. The Eternal Proble The Lifetie Proble Conclusion References Proposition (solution of ODE) Assue that there exist solutions z() and z() of (ODE) in D 0 such that z (respectively, z) satisfies the terinal condition z( 0) = z 0 for ( 0, z 0) D 0 (respectively, ( 0, z 0) + D 0) and extends on the left to D 0\ {(, 1/x( ) )}. Let (respectively, ) be the value of where z (respectively, z) intercepts D 0. Then, there exists a unique solution z() of (ODE) in D 0 satisfying the terinal condition z(c/r) = 0 and extending on the left to the boundary D 0 such that z( ) = 1/x( ) for soe (, ). In particular, z() is not defined on (0, ) =x( b) D 0 D 0 + D b c r

62 z Motivation & Lit. The Eternal Proble The Lifetie Proble Conclusion References Proposition (solution of ODE) Assue that there exist solutions z() and z() of (ODE) in D 0 such that z (respectively, z) satisfies the terinal condition z( 0) = z 0 for ( 0, z 0) D 0 (respectively, ( 0, z 0) + D 0) and extends on the left to D 0\ {(, 1/x( ) )}. Let (respectively, ) be the value of where z (respectively, z) intercepts D 0. Then, there exists a unique solution z() of (ODE) in D 0 satisfying the terinal condition z(c/r) = 0 and extending on the left to the boundary D 0 such that z( ) = 1/x( ) for soe (, ). In particular, z() is not defined on (0, ) =x( b) b c r

63 z Motivation & Lit. The Eternal Proble The Lifetie Proble Conclusion References Proposition (solution of ODE) Assue that there exist solutions z() and z() of (ODE) in D 0 such that z (respectively, z) satisfies the terinal condition z( 0) = z 0 for ( 0, z 0) D 0 (respectively, ( 0, z 0) + D 0) and extends on the left to D 0\ {(, 1/x( ) )}. Let (respectively, ) be the value of where z (respectively, z) intercepts D 0. Then, there exists a unique solution z() of (ODE) in D 0 satisfying the terinal condition z(c/r) = 0 and extending on the left to the boundary D 0 such that z( ) = 1/x( ) for soe (, ). In particular, z() is not defined on (0, ) =x( $ ) 1=x( b) $ b c r

64 Proposition (Miniu probability of DD for c r ) Assue that z() is the solution of (ODE) on [, c/r] Then, for α w and c/r φ(w, ) = B1 1 [ ( c ) ] ( B 2 + B 1 B 2 r α y(w) (1 B 2) ỹ α() ỹ α() + 1 B2 B 1 B 2 [ B 1 ( c r α ) (B 1 1) ỹ α() ) B1 ] ( y(w) ỹ α() where y(w) [ỹ (), ỹ α()] uniquely solves [ c r w = B 1 B ( 2 c ) ] ( y(w) B 1 B 2 ỹ + α() r α (1 B 2) ỹ α() [ B 2 B ( 1 c ) ] ( y(w) B 1 B 2 ỹ α() r α (B 1 1) ỹ α() ) B1 1 ) B2 ) B2 1

65 : $ (; ) Motivation & Lit. The Eternal Proble The Lifetie Proble Conclusion References For α w and c/r π (w, ) = µ r [ B 1(B 1 1) B ( 2 c ) σ 2 B 1 B 2 ỹ + α() r α + µ r [ B 2(1 B 2) σ 2 B 1 B 2 ] ( (1 B 2) B ( 1 c ) ỹ α() r α (B 1 1) y ỹ α() ] ( y ỹ α() ) B1 1 ) B2 1 w $ c r c r

66 z Motivation & Lit. The Eternal Proble The Lifetie Proble Conclusion References 0 < < : The restricted proble No solution for (ODE) on 0 < < =x( $ ) 1=x( b) $ b c r

67 0 < < : The restricted proble No solution for (ODE) on 0 < < w However, it sees that π (, ) = 0 for 0 < c r

68 0 < < : The restricted proble No solution for (ODE) on 0 < < w However, it sees that π (, ) = 0 for 0 < Consider the restricted proble where M is not allowed to increase sup L h = (r w c)h w δ h2 w = λ h h ww π h(α, ) = 1, h w(w, ) li w h ww(w, ) = 0 c r

69 0 < < : The restricted proble No solution for (ODE) on 0 < < w However, it sees that π (, ) = 0 for 0 < Consider the restricted proble where M is not allowed to increase sup L h = (r w c)h w δ h2 w = λ h h ww π h(α, ) = 1, h w(w, ) li w h ww(w, ) = 0 c r The dual FBP corresponds to an optial controller-stopper proble This is where we got the ansatz...

70 0 < < : The restricted proble No solution for (ODE) on 0 < < w However, it sees that π (, ) = 0 for 0 < Consider the restricted proble where M is not allowed to increase sup L h = (r w c)h w δ h2 w = λ h h ww π h(α, ) = 1, h w(w, ) li w h ww(w, ) = 0 c r The dual FBP corresponds to an optial controller-stopper proble This is where we got the ansatz... The dual proble reduces to an ODE = its solution is 1 x()!

71 The solution for 0 < c r The equations for φ(w, ) and π (w, ) in the restricted proble are the sae as the one for [, c/r], expect that we replace z() with 1 x()!

72 The solution for 0 < c r The equations for φ(w, ) and π (w, ) in the restricted proble are the sae as the one for [, c/r], expect that we replace z() with Let us glue the solutions of the two probles 1 x()!

73 z Motivation & Lit. The Eternal Proble The Lifetie Proble Conclusion References The solution for 0 < c r The equations for φ(w, ) and π (w, ) in the restricted proble are the sae as the one for [, c/r], expect that we replace z() with Let us glue the solutions of the two probles 1 x()! { 1/x(), 0 η() = z(), c/r =x( $ ) 1=x( b) $ b c r

74 The solution for 0 < c r The equations for φ(w, ) and π (w, ) in the restricted proble are the sae as the one for [, c/r], expect that we replace z() with Let us glue the solutions of the two probles { 1/x(), 0 η() = z(), c/r The free boundary : 1 B ( 1B ) 2 η() B1 1 η() B 2 1 y α() B 1 B 2 ( c ) = r ( c r α ) [ B 1(1 B 2) B 1 B 2 η() B x()! ] B2(B1 1) η() B 2 1 B 1 B 2

75 Theore (Miniu probability of DD for 0 < c r ) Assue that z() is the solution of (ODE) on [, c/r] and define η and y α. Then, for α w and 0 < c/r φ(w, ) = B1 1 [ ( c ) ] ( B 2 + B 1 B 2 r α y(w) (1 B 2) y α() y α() ] ( y(w) + 1 B2 B 1 B 2 [ B 1 ( c r α ) (B 1 1) y α() y α() where y(w) [y (), y α()] uniquely solves [ c r w = B 1 B ( 2 c ) ] ( y(w) B 1 B 2 y + α() r α (1 B 2) y α() [ B 2 B ( 1 c ) ] ( y(w) B 1 B 2 y α() r α (B 1 1) y α() ) B1 ) B1 1 ) B2 ) B2 1

76 For α w and 0 < c/r π (w, ) = µ r [ B 1(B 1 1) B ( 2 c ) σ 2 B 1 B 2 y + α() r α + µ r [ B 2(1 B 2) σ 2 B 1 B 2 ] ( (1 B 2) B ( 1 c ) y α() r α (B 1 1) y y α() ] ( y y α() ) B1 1 ) B2 1

77 : $ (; ) Motivation & Lit. The Eternal Proble The Lifetie Proble Conclusion References For α w and 0 < c/r π (w, ) = µ r [ B 1(B 1 1) B ( 2 c ) σ 2 B 1 B 2 y + α() r α + µ r [ B 2(1 B 2) σ 2 B 1 B 2 ] ( (1 B 2) B ( 1 c ) y α() r α (B 1 1) y y α() ] ( y y α() ) B1 1 ) B2 1 w $ c r c r

78 : $ (w; ) Motivation & Lit. The Eternal Proble The Lifetie Proble Conclusion References For α w and 0 < c/r π (w, ) = µ r [ B 1(B 1 1) B ( 2 c ) σ 2 B 1 B 2 y + α() r α + µ r [ B 2(1 B 2) σ 2 B 1 B 2 ] ( (1 B 2) B ( 1 c ) y α() r α (B 1 1) y y α() ] ( y y α() ) B1 1 ) B w w c r c r $ 0 c r

79 ?(w; ) Motivation & Lit. The Eternal Proble The Lifetie Proble Conclusion References w 20 c r c r $ 0

80 ?(w; ) Motivation & Lit. The Eternal Proble The Lifetie Proble Conclusion References w c 10 5 c 20 $ r r

81 Conclusion We deterined the optial strategy to iniize the probability of drawdown in two scenarios For the infinite tie horizon proble, the optial strategy is the sae as the one for infinite tie ruin proble For the lifetie proble with constant consuption, there is a trade-off in allowing the high-water-ark to increase 0 < : increasing high-water-ark level akes DD ore probable (0 < ) < < c/r: letting wealth increase helps fund the consuption, thus reducing the probability of DD Will this behavior exist for other types of consuption where w s <? Adding trade-off between risk and return?

82 Thank you for your attention! Angoshtari, B., E. Bayraktar, and V. R. Young: Miniizing the probability of lifetie drawdown under constant consuption. Insurance: Matheatics and Econoics (2016a). Optial investent to iniize the probability of drawdown. Stochastics, pp (2016b).

83 Bäuerle, N. and E. Bayraktar: A note on applications of stochastic ordering to control probles in insurance and finance. Stochastics An International Journal of Probability and Stochastic Processes, volue 86, no. 2: pp (2014). Bayraktar, E. and V. R. Young: Correspondence between lifetie iniu wealth and utility of consuption. Finance and Stochastics, volue 11, no. 2: pp (2007). Optially investing to reach a bequest goal. Insurance: Matheatics and Econoics, volue 70: pp (2016). Browne, S.: Optial investent policies for a fir with a rando risk process: exponential utility and iniizing the probability of ruin. Matheatics of operations research, volue 20, no. 4: pp (1995). Survival and growth with a liability: Optial portfolio strategies in continuous tie. Matheatics of Operations Research, volue 22, no. 2: pp (1997). Beating a oving target: Optial portfolio strategies for outperforing a stochastic benchark. Finance and Stochastics, volue 3, no. 3: pp (1999a).

84 Reaching goals by a deadline: Digital options and continuous-tie active portfolio anageent. Advances in Applied Probability, volue 31, no. 2: pp (1999b). Chen, X., D. Landriault, B. Li, and D. Li: On iniizing drawdown risks of lifetie investents. Insurance: Matheatics and Econoics, volue 65: pp (2015). Cherny, V. and J. Ob lój: Portfolio optiisation under non-linear drawdown constraints in a seiartingale financial odel. Finance and Stochastics, volue 17, no. 4: pp (2013). Cvitanic, J. and I. Karatzas: On portfolio optiization under drawdown constraints. IMA Volues in Matheatics and its Applications, volue 65: pp (1995). Dubins, L. E. and L. J. Savage: How to gable if you ust: Inequalities for stochastic processes edition McGraw-Hill, New York edition Dover, New York (1965, 1975). Grossan, S. J. and Z. Zhou: Optial investent strategies for controlling drawdowns. Matheatical finance, volue 3, no. 3: pp (1993).

85 Karatzas, I.: Adaptive control of a diffusion to a goal and a parabolic onge-apere-type equation. Asian Journal of Matheatics, volue 1: pp (1997). Kardaras, C., J. Ob lój, and E. Platen: The nuéraire property and long-ter growth optiality for drawdown-constrained investents. Matheatical Finance (2014). Pestien, V. C. and W. D. Sudderth: Continuous-tie red and black: How to control a diffusion to a goal. Matheatics of Operations Research, volue 10, no. 4: pp (1985). Proislow, D. S. and V. R. Young: Miniizing the probability of ruin when clais follow brownian otion with drift. North Aerican Actuarial Journal, volue 9, no. 3: pp (2005). Young, V. R.: Optial investent strategy to iniize the probability of lifetie ruin. North Aerican Actuarial Journal, volue 8, no. 4: pp (2004).

Proving the Regularity of the Minimal Probability of Ruin via a Game of Stopping and Control

Proving the Regularity of the Minimal Probability of Ruin via a Game of Stopping and Control Proving the Regularity of the Minimal Probability of Ruin via a Game of Stopping and Control Erhan Bayraktar University of Michigan joint work with Virginia R. Young, University of Michigan K αρλoβασi,

More information

Course Notes for EE227C (Spring 2018): Convex Optimization and Approximation

Course Notes for EE227C (Spring 2018): Convex Optimization and Approximation Course Notes for EE7C (Spring 018: Convex Optiization and Approxiation Instructor: Moritz Hardt Eail: hardt+ee7c@berkeley.edu Graduate Instructor: Max Sichowitz Eail: sichow+ee7c@berkeley.edu October 15,

More information

Course Notes for EE227C (Spring 2018): Convex Optimization and Approximation

Course Notes for EE227C (Spring 2018): Convex Optimization and Approximation Course Notes for EE227C (Spring 2018): Convex Optiization and Approxiation Instructor: Moritz Hardt Eail: hardt+ee227c@berkeley.edu Graduate Instructor: Max Sichowitz Eail: sichow+ee227c@berkeley.edu October

More information

1 Identical Parallel Machines

1 Identical Parallel Machines FB3: Matheatik/Inforatik Dr. Syaantak Das Winter 2017/18 Optiizing under Uncertainty Lecture Notes 3: Scheduling to Miniize Makespan In any standard scheduling proble, we are given a set of jobs J = {j

More information

Convergence of Option Values under Incompleteness

Convergence of Option Values under Incompleteness Projektbereich B Discussion Paper No. B 333 Convergence of Option Values under Incopleteness by Wolfgang J. Runggaldier Martin Schweizer Noveber 1995 Financial support by Deutsche Forschungsgeeinschaft,

More information

Some Aspects of Universal Portfolio

Some Aspects of Universal Portfolio 1 Some Aspects of Universal Portfolio Tomoyuki Ichiba (UC Santa Barbara) joint work with Marcel Brod (ETH Zurich) Conference on Stochastic Asymptotics & Applications Sixth Western Conference on Mathematical

More information

A Note on Scheduling Tall/Small Multiprocessor Tasks with Unit Processing Time to Minimize Maximum Tardiness

A Note on Scheduling Tall/Small Multiprocessor Tasks with Unit Processing Time to Minimize Maximum Tardiness A Note on Scheduling Tall/Sall Multiprocessor Tasks with Unit Processing Tie to Miniize Maxiu Tardiness Philippe Baptiste and Baruch Schieber IBM T.J. Watson Research Center P.O. Box 218, Yorktown Heights,

More information

On the Multi-Dimensional Controller and Stopper Games

On the Multi-Dimensional Controller and Stopper Games On the Multi-Dimensional Controller and Stopper Games Joint work with Yu-Jui Huang University of Michigan, Ann Arbor June 7, 2012 Outline Introduction 1 Introduction 2 3 4 5 Consider a zero-sum controller-and-stopper

More information

Optimum Value of Poverty Measure Using Inverse Optimization Programming Problem

Optimum Value of Poverty Measure Using Inverse Optimization Programming Problem International Journal of Conteporary Matheatical Sciences Vol. 14, 2019, no. 1, 31-42 HIKARI Ltd, www.-hikari.co https://doi.org/10.12988/ijcs.2019.914 Optiu Value of Poverty Measure Using Inverse Optiization

More information

Model Fitting. CURM Background Material, Fall 2014 Dr. Doreen De Leon

Model Fitting. CURM Background Material, Fall 2014 Dr. Doreen De Leon Model Fitting CURM Background Material, Fall 014 Dr. Doreen De Leon 1 Introduction Given a set of data points, we often want to fit a selected odel or type to the data (e.g., we suspect an exponential

More information

A new approach for investment performance measurement. 3rd WCMF, Santa Barbara November 2009

A new approach for investment performance measurement. 3rd WCMF, Santa Barbara November 2009 A new approach for investment performance measurement 3rd WCMF, Santa Barbara November 2009 Thaleia Zariphopoulou University of Oxford, Oxford-Man Institute and The University of Texas at Austin 1 Performance

More information

Prof. Erhan Bayraktar (University of Michigan)

Prof. Erhan Bayraktar (University of Michigan) September 17, 2012 KAP 414 2:15 PM- 3:15 PM Prof. (University of Michigan) Abstract: We consider a zero-sum stochastic differential controller-and-stopper game in which the state process is a controlled

More information

ASSIGNMENT BOOKLET Bachelor s Degree Programme (B.Sc./B.A./B.Com.) MATHEMATICAL MODELLING

ASSIGNMENT BOOKLET Bachelor s Degree Programme (B.Sc./B.A./B.Com.) MATHEMATICAL MODELLING ASSIGNMENT BOOKLET Bachelor s Degree Prograe (B.Sc./B.A./B.Co.) MTE-14 MATHEMATICAL MODELLING Valid fro 1 st January, 18 to 1 st Deceber, 18 It is copulsory to subit the Assignent before filling in the

More information

Revealed Preference with Stochastic Demand Correspondence

Revealed Preference with Stochastic Demand Correspondence Revealed Preference with Stochastic Deand Correspondence Indraneel Dasgupta School of Econoics, University of Nottingha, Nottingha NG7 2RD, UK. E-ail: indraneel.dasgupta@nottingha.ac.uk Prasanta K. Pattanaik

More information

The Methods of Solution for Constrained Nonlinear Programming

The Methods of Solution for Constrained Nonlinear Programming Research Inventy: International Journal Of Engineering And Science Vol.4, Issue 3(March 2014), PP 01-06 Issn (e): 2278-4721, Issn (p):2319-6483, www.researchinventy.co The Methods of Solution for Constrained

More information

Kernel Methods and Support Vector Machines

Kernel Methods and Support Vector Machines Intelligent Systes: Reasoning and Recognition Jaes L. Crowley ENSIAG 2 / osig 1 Second Seester 2012/2013 Lesson 20 2 ay 2013 Kernel ethods and Support Vector achines Contents Kernel Functions...2 Quadratic

More information

e-companion ONLY AVAILABLE IN ELECTRONIC FORM

e-companion ONLY AVAILABLE IN ELECTRONIC FORM OPERATIONS RESEARCH doi 10.1287/opre.1070.0427ec pp. ec1 ec5 e-copanion ONLY AVAILABLE IN ELECTRONIC FORM infors 07 INFORMS Electronic Copanion A Learning Approach for Interactive Marketing to a Custoer

More information

March 16, Abstract. We study the problem of portfolio optimization under the \drawdown constraint" that the

March 16, Abstract. We study the problem of portfolio optimization under the \drawdown constraint that the ON PORTFOLIO OPTIMIZATION UNDER \DRAWDOWN" CONSTRAINTS JAKSA CVITANIC IOANNIS KARATZAS y March 6, 994 Abstract We study the problem of portfolio optimization under the \drawdown constraint" that the wealth

More information

Computational and Statistical Learning Theory

Computational and Statistical Learning Theory Coputational and Statistical Learning Theory TTIC 31120 Prof. Nati Srebro Lecture 2: PAC Learning and VC Theory I Fro Adversarial Online to Statistical Three reasons to ove fro worst-case deterinistic

More information

Support Vector Machines MIT Course Notes Cynthia Rudin

Support Vector Machines MIT Course Notes Cynthia Rudin Support Vector Machines MIT 5.097 Course Notes Cynthia Rudin Credit: Ng, Hastie, Tibshirani, Friedan Thanks: Şeyda Ertekin Let s start with soe intuition about argins. The argin of an exaple x i = distance

More information

Symmetrization of Lévy processes and applications 1

Symmetrization of Lévy processes and applications 1 Syetrization of Lévy processes and applications 1 Pedro J. Méndez Hernández Universidad de Costa Rica July 2010, resden 1 Joint work with R. Bañuelos, Purdue University Pedro J. Méndez (UCR Syetrization

More information

Generalized Hypothesis Testing and Maximizing the Success Probability in Financial Markets

Generalized Hypothesis Testing and Maximizing the Success Probability in Financial Markets Generalized Hypothesis Testing and Maximizing the Success Probability in Financial Markets Tim Leung 1, Qingshuo Song 2, and Jie Yang 3 1 Columbia University, New York, USA; leung@ieor.columbia.edu 2 City

More information

HJB equations. Seminar in Stochastic Modelling in Economics and Finance January 10, 2011

HJB equations. Seminar in Stochastic Modelling in Economics and Finance January 10, 2011 Department of Probability and Mathematical Statistics Faculty of Mathematics and Physics, Charles University in Prague petrasek@karlin.mff.cuni.cz Seminar in Stochastic Modelling in Economics and Finance

More information

Thomas Knispel Leibniz Universität Hannover

Thomas Knispel Leibniz Universität Hannover Optimal long term investment under model ambiguity Optimal long term investment under model ambiguity homas Knispel Leibniz Universität Hannover knispel@stochastik.uni-hannover.de AnStAp0 Vienna, July

More information

A Simple Regression Problem

A Simple Regression Problem A Siple Regression Proble R. M. Castro March 23, 2 In this brief note a siple regression proble will be introduced, illustrating clearly the bias-variance tradeoff. Let Y i f(x i ) + W i, i,..., n, where

More information

Introduction to Optimization Techniques. Nonlinear Programming

Introduction to Optimization Techniques. Nonlinear Programming Introduction to Optiization echniques Nonlinear Prograing Optial Solutions Consider the optiization proble in f ( x) where F R n xf Definition : x F is optial (global iniu) for this proble, if f( x ) f(

More information

Probability and Stochastic Processes: A Friendly Introduction for Electrical and Computer Engineers Roy D. Yates and David J.

Probability and Stochastic Processes: A Friendly Introduction for Electrical and Computer Engineers Roy D. Yates and David J. Probability and Stochastic Processes: A Friendly Introduction for Electrical and oputer Engineers Roy D. Yates and David J. Goodan Proble Solutions : Yates and Goodan,1..3 1.3.1 1.4.6 1.4.7 1.4.8 1..6

More information

Intelligent Systems: Reasoning and Recognition. Perceptrons and Support Vector Machines

Intelligent Systems: Reasoning and Recognition. Perceptrons and Support Vector Machines Intelligent Systes: Reasoning and Recognition Jaes L. Crowley osig 1 Winter Seester 2018 Lesson 6 27 February 2018 Outline Perceptrons and Support Vector achines Notation...2 Linear odels...3 Lines, Planes

More information

Revealed Preference and Stochastic Demand Correspondence: A Unified Theory

Revealed Preference and Stochastic Demand Correspondence: A Unified Theory Revealed Preference and Stochastic Deand Correspondence: A Unified Theory Indraneel Dasgupta School of Econoics, University of Nottingha, Nottingha NG7 2RD, UK. E-ail: indraneel.dasgupta@nottingha.ac.uk

More information

Stochastic Areas and Applications in Risk Theory

Stochastic Areas and Applications in Risk Theory Stochastic Areas and Applications in Risk Theory July 16th, 214 Zhenyu Cui Department of Mathematics Brooklyn College, City University of New York Zhenyu Cui 49th Actuarial Research Conference 1 Outline

More information

A problem of portfolio/consumption choice in a. liquidity risk model with random trading times

A problem of portfolio/consumption choice in a. liquidity risk model with random trading times A problem of portfolio/consumption choice in a liquidity risk model with random trading times Huyên PHAM Special Semester on Stochastics with Emphasis on Finance, Kick-off workshop, Linz, September 8-12,

More information

Ştefan ŞTEFĂNESCU * is the minimum global value for the function h (x)

Ştefan ŞTEFĂNESCU * is the minimum global value for the function h (x) 7Applying Nelder Mead s Optiization Algorith APPLYING NELDER MEAD S OPTIMIZATION ALGORITHM FOR MULTIPLE GLOBAL MINIMA Abstract Ştefan ŞTEFĂNESCU * The iterative deterinistic optiization ethod could not

More information

Bayes Decision Rule and Naïve Bayes Classifier

Bayes Decision Rule and Naïve Bayes Classifier Bayes Decision Rule and Naïve Bayes Classifier Le Song Machine Learning I CSE 6740, Fall 2013 Gaussian Mixture odel A density odel p(x) ay be ulti-odal: odel it as a ixture of uni-odal distributions (e.g.

More information

Optimal Pigouvian Taxation when Externalities Affect Demand

Optimal Pigouvian Taxation when Externalities Affect Demand Optial Pigouvian Taxation when Externalities Affect Deand Enda Patrick Hargaden Departent of Econoics University of Michigan enda@uich.edu Version of August 2, 2015 Abstract Purchasing a network good such

More information

Lost-Sales Problems with Stochastic Lead Times: Convexity Results for Base-Stock Policies

Lost-Sales Problems with Stochastic Lead Times: Convexity Results for Base-Stock Policies OPERATIONS RESEARCH Vol. 52, No. 5, Septeber October 2004, pp. 795 803 issn 0030-364X eissn 1526-5463 04 5205 0795 infors doi 10.1287/opre.1040.0130 2004 INFORMS TECHNICAL NOTE Lost-Sales Probles with

More information

Now multiply the left-hand-side by ω and the right-hand side by dδ/dt (recall ω= dδ/dt) to get:

Now multiply the left-hand-side by ω and the right-hand side by dδ/dt (recall ω= dδ/dt) to get: Equal Area Criterion.0 Developent of equal area criterion As in previous notes, all powers are in per-unit. I want to show you the equal area criterion a little differently than the book does it. Let s

More information

Graphical Models in Local, Asymmetric Multi-Agent Markov Decision Processes

Graphical Models in Local, Asymmetric Multi-Agent Markov Decision Processes Graphical Models in Local, Asyetric Multi-Agent Markov Decision Processes Ditri Dolgov and Edund Durfee Departent of Electrical Engineering and Coputer Science University of Michigan Ann Arbor, MI 48109

More information

Utility maximization problem with transaction costs - Shadow price approach

Utility maximization problem with transaction costs - Shadow price approach Utility maimization problem with transaction costs - Shadow price approach Jin Hyuk Choi joint work with Mihai Sîrbu and Gordan Žitković Department of Mathematics University of Teas at Austin Carnegie

More information

MSEC MODELING OF DEGRADATION PROCESSES TO OBTAIN AN OPTIMAL SOLUTION FOR MAINTENANCE AND PERFORMANCE

MSEC MODELING OF DEGRADATION PROCESSES TO OBTAIN AN OPTIMAL SOLUTION FOR MAINTENANCE AND PERFORMANCE Proceeding of the ASME 9 International Manufacturing Science and Engineering Conference MSEC9 October 4-7, 9, West Lafayette, Indiana, USA MSEC9-8466 MODELING OF DEGRADATION PROCESSES TO OBTAIN AN OPTIMAL

More information

Fixed-to-Variable Length Distribution Matching

Fixed-to-Variable Length Distribution Matching Fixed-to-Variable Length Distribution Matching Rana Ali Ajad and Georg Böcherer Institute for Counications Engineering Technische Universität München, Gerany Eail: raa2463@gail.co,georg.boecherer@tu.de

More information

TEST OF HOMOGENEITY OF PARALLEL SAMPLES FROM LOGNORMAL POPULATIONS WITH UNEQUAL VARIANCES

TEST OF HOMOGENEITY OF PARALLEL SAMPLES FROM LOGNORMAL POPULATIONS WITH UNEQUAL VARIANCES TEST OF HOMOGENEITY OF PARALLEL SAMPLES FROM LOGNORMAL POPULATIONS WITH UNEQUAL VARIANCES S. E. Ahed, R. J. Tokins and A. I. Volodin Departent of Matheatics and Statistics University of Regina Regina,

More information

Theoretical Tutorial Session 2

Theoretical Tutorial Session 2 1 / 36 Theoretical Tutorial Session 2 Xiaoming Song Department of Mathematics Drexel University July 27, 216 Outline 2 / 36 Itô s formula Martingale representation theorem Stochastic differential equations

More information

Introduction to Robotics (CS223A) (Winter 2006/2007) Homework #5 solutions

Introduction to Robotics (CS223A) (Winter 2006/2007) Homework #5 solutions Introduction to Robotics (CS3A) Handout (Winter 6/7) Hoework #5 solutions. (a) Derive a forula that transfors an inertia tensor given in soe frae {C} into a new frae {A}. The frae {A} can differ fro frae

More information

ACCUMULATION OF FLUID FLOW ENERGY BY VIBRATIONS EXCITATION IN SYSTEM WITH TWO DEGREE OF FREEDOM

ACCUMULATION OF FLUID FLOW ENERGY BY VIBRATIONS EXCITATION IN SYSTEM WITH TWO DEGREE OF FREEDOM ENGINEERING FOR RURAL DEVELOPMENT Jelgava, 9.-.5.8. ACCUMULATION OF FLUID FLOW ENERGY BY VIBRATION EXCITATION IN YTEM WITH TWO DEGREE OF FREEDOM Maris Eiduks, Janis Viba, Lauris tals Riga Technical University,

More information

Optimal portfolio strategies under partial information with expert opinions

Optimal portfolio strategies under partial information with expert opinions 1 / 35 Optimal portfolio strategies under partial information with expert opinions Ralf Wunderlich Brandenburg University of Technology Cottbus, Germany Joint work with Rüdiger Frey Research Seminar WU

More information

Randomized Accuracy-Aware Program Transformations For Efficient Approximate Computations

Randomized Accuracy-Aware Program Transformations For Efficient Approximate Computations Randoized Accuracy-Aware Progra Transforations For Efficient Approxiate Coputations Zeyuan Allen Zhu Sasa Misailovic Jonathan A. Kelner Martin Rinard MIT CSAIL zeyuan@csail.it.edu isailo@it.edu kelner@it.edu

More information

arxiv: v1 [math.pr] 24 Sep 2018

arxiv: v1 [math.pr] 24 Sep 2018 A short note on Anticipative portfolio optimization B. D Auria a,b,1,, J.-A. Salmerón a,1 a Dpto. Estadística, Universidad Carlos III de Madrid. Avda. de la Universidad 3, 8911, Leganés (Madrid Spain b

More information

Bayesian inference for stochastic differential mixed effects models - initial steps

Bayesian inference for stochastic differential mixed effects models - initial steps Bayesian inference for stochastic differential ixed effects odels - initial steps Gavin Whitaker 2nd May 2012 Supervisors: RJB and AG Outline Mixed Effects Stochastic Differential Equations (SDEs) Bayesian

More information

MULTIAGENT Resource Allocation (MARA) is the

MULTIAGENT Resource Allocation (MARA) is the EDIC RESEARCH PROPOSAL 1 Designing Negotiation Protocols for Utility Maxiization in Multiagent Resource Allocation Tri Kurniawan Wijaya LSIR, I&C, EPFL Abstract Resource allocation is one of the ain concerns

More information

U V. r In Uniform Field the Potential Difference is V Ed

U V. r In Uniform Field the Potential Difference is V Ed SPHI/W nit 7.8 Electric Potential Page of 5 Notes Physics Tool box Electric Potential Energy the electric potential energy stored in a syste k of two charges and is E r k Coulobs Constant is N C 9 9. E

More information

Algorithms for parallel processor scheduling with distinct due windows and unit-time jobs

Algorithms for parallel processor scheduling with distinct due windows and unit-time jobs BULLETIN OF THE POLISH ACADEMY OF SCIENCES TECHNICAL SCIENCES Vol. 57, No. 3, 2009 Algoriths for parallel processor scheduling with distinct due windows and unit-tie obs A. JANIAK 1, W.A. JANIAK 2, and

More information

Computational and Statistical Learning Theory

Computational and Statistical Learning Theory Coputational and Statistical Learning Theory Proble sets 5 and 6 Due: Noveber th Please send your solutions to learning-subissions@ttic.edu Notations/Definitions Recall the definition of saple based Radeacher

More information

arxiv: v1 [cs.ds] 3 Feb 2014

arxiv: v1 [cs.ds] 3 Feb 2014 arxiv:40.043v [cs.ds] 3 Feb 04 A Bound on the Expected Optiality of Rando Feasible Solutions to Cobinatorial Optiization Probles Evan A. Sultani The Johns Hopins University APL evan@sultani.co http://www.sultani.co/

More information

The Simplex Method is Strongly Polynomial for the Markov Decision Problem with a Fixed Discount Rate

The Simplex Method is Strongly Polynomial for the Markov Decision Problem with a Fixed Discount Rate The Siplex Method is Strongly Polynoial for the Markov Decision Proble with a Fixed Discount Rate Yinyu Ye April 20, 2010 Abstract In this note we prove that the classic siplex ethod with the ost-negativereduced-cost

More information

On the Communication Complexity of Lipschitzian Optimization for the Coordinated Model of Computation

On the Communication Complexity of Lipschitzian Optimization for the Coordinated Model of Computation journal of coplexity 6, 459473 (2000) doi:0.006jco.2000.0544, available online at http:www.idealibrary.co on On the Counication Coplexity of Lipschitzian Optiization for the Coordinated Model of Coputation

More information

Quantum algorithms (CO 781, Winter 2008) Prof. Andrew Childs, University of Waterloo LECTURE 15: Unstructured search and spatial search

Quantum algorithms (CO 781, Winter 2008) Prof. Andrew Childs, University of Waterloo LECTURE 15: Unstructured search and spatial search Quantu algoriths (CO 781, Winter 2008) Prof Andrew Childs, University of Waterloo LECTURE 15: Unstructured search and spatial search ow we begin to discuss applications of quantu walks to search algoriths

More information

Optimal Consumption, Investment and Insurance Problem in Infinite Time Horizon

Optimal Consumption, Investment and Insurance Problem in Infinite Time Horizon Optimal Consumption, Investment and Insurance Problem in Infinite Time Horizon Bin Zou and Abel Cadenillas Department of Mathematical and Statistical Sciences University of Alberta August 213 Abstract

More information

ALEKSANDAR MIJATOVIĆ AND MIKHAIL URUSOV

ALEKSANDAR MIJATOVIĆ AND MIKHAIL URUSOV DETERMINISTIC CRITERIA FOR THE ABSENCE OF ARBITRAGE IN DIFFUSION MODELS ALEKSANDAR MIJATOVIĆ AND MIKHAIL URUSOV Abstract. We obtain a deterministic characterisation of the no free lunch with vanishing

More information

a a a a a a a m a b a b

a a a a a a a m a b a b Algebra / Trig Final Exa Study Guide (Fall Seester) Moncada/Dunphy Inforation About the Final Exa The final exa is cuulative, covering Appendix A (A.1-A.5) and Chapter 1. All probles will be ultiple choice

More information

Supplementary to Learning Discriminative Bayesian Networks from High-dimensional Continuous Neuroimaging Data

Supplementary to Learning Discriminative Bayesian Networks from High-dimensional Continuous Neuroimaging Data Suppleentary to Learning Discriinative Bayesian Networks fro High-diensional Continuous Neuroiaging Data Luping Zhou, Lei Wang, Lingqiao Liu, Philip Ogunbona, and Dinggang Shen Proposition. Given a sparse

More information

Principles of Optimal Control Spring 2008

Principles of Optimal Control Spring 2008 MIT OpenCourseWare http://ocw.it.edu 16.323 Principles of Optial Control Spring 2008 For inforation about citing these aterials or our Ters of Use, visit: http://ocw.it.edu/ters. 16.323 Lecture 10 Singular

More information

Determining OWA Operator Weights by Mean Absolute Deviation Minimization

Determining OWA Operator Weights by Mean Absolute Deviation Minimization Deterining OWA Operator Weights by Mean Absolute Deviation Miniization Micha l Majdan 1,2 and W lodziierz Ogryczak 1 1 Institute of Control and Coputation Engineering, Warsaw University of Technology,

More information

The Simplex and Policy-Iteration Methods are Strongly Polynomial for the Markov Decision Problem with a Fixed Discount Rate

The Simplex and Policy-Iteration Methods are Strongly Polynomial for the Markov Decision Problem with a Fixed Discount Rate The Siplex and Policy-Iteration Methods are Strongly Polynoial for the Markov Decision Proble with a Fixed Discount Rate Yinyu Ye April 20, 2010; revised Noveber 30, 2010 Abstract We prove that the classic

More information

Poisson Jumps in Credit Risk Modeling: a Partial Integro-differential Equation Formulation

Poisson Jumps in Credit Risk Modeling: a Partial Integro-differential Equation Formulation Poisson Jumps in Credit Risk Modeling: a Partial Integro-differential Equation Formulation Jingyi Zhu Department of Mathematics University of Utah zhu@math.utah.edu Collaborator: Marco Avellaneda (Courant

More information

1 Proof of learning bounds

1 Proof of learning bounds COS 511: Theoretical Machine Learning Lecturer: Rob Schapire Lecture #4 Scribe: Akshay Mittal February 13, 2013 1 Proof of learning bounds For intuition of the following theore, suppose there exists a

More information

Approximation in Stochastic Scheduling: The Power of LP-Based Priority Policies

Approximation in Stochastic Scheduling: The Power of LP-Based Priority Policies Approxiation in Stochastic Scheduling: The Power of -Based Priority Policies Rolf Möhring, Andreas Schulz, Marc Uetz Setting (A P p stoch, r E( w and (B P p stoch E( w We will assue that the processing

More information

A Theoretical Analysis of a Warm Start Technique

A Theoretical Analysis of a Warm Start Technique A Theoretical Analysis of a War Start Technique Martin A. Zinkevich Yahoo! Labs 701 First Avenue Sunnyvale, CA Abstract Batch gradient descent looks at every data point for every step, which is wasteful

More information

Concentration of ground states in stationary Mean-Field Games systems: part I

Concentration of ground states in stationary Mean-Field Games systems: part I Concentration of ground states in stationary Mean-Field Gaes systes: part I Annalisa Cesaroni and Marco Cirant June 9, 207 Abstract In this paper we provide the existence of classical solutions to soe

More information

DEPARTMENT OF ECONOMETRICS AND BUSINESS STATISTICS

DEPARTMENT OF ECONOMETRICS AND BUSINESS STATISTICS ISSN 1440-771X AUSTRALIA DEPARTMENT OF ECONOMETRICS AND BUSINESS STATISTICS An Iproved Method for Bandwidth Selection When Estiating ROC Curves Peter G Hall and Rob J Hyndan Working Paper 11/00 An iproved

More information

Sharp Time Data Tradeoffs for Linear Inverse Problems

Sharp Time Data Tradeoffs for Linear Inverse Problems Sharp Tie Data Tradeoffs for Linear Inverse Probles Saet Oyak Benjain Recht Mahdi Soltanolkotabi January 016 Abstract In this paper we characterize sharp tie-data tradeoffs for optiization probles used

More information

Chapter 6: Economic Inequality

Chapter 6: Economic Inequality Chapter 6: Econoic Inequality We are interested in inequality ainly for two reasons: First, there are philosophical and ethical grounds for aversion to inequality per se. Second, even if we are not interested

More information

All Excuses must be taken to 233 Loomis before 4:15, Monday, April 30.

All Excuses must be taken to 233 Loomis before 4:15, Monday, April 30. Miscellaneous Notes he end is near don t get behind. All Excuses ust be taken to 233 Loois before 4:15, Monday, April 30. he PHYS 213 final exa ties are * 8-10 AM, Monday, May 7 * 8-10 AM, uesday, May

More information

CS Lecture 13. More Maximum Likelihood

CS Lecture 13. More Maximum Likelihood CS 6347 Lecture 13 More Maxiu Likelihood Recap Last tie: Introduction to axiu likelihood estiation MLE for Bayesian networks Optial CPTs correspond to epirical counts Today: MLE for CRFs 2 Maxiu Likelihood

More information

4 = (0.02) 3 13, = 0.25 because = 25. Simi-

4 = (0.02) 3 13, = 0.25 because = 25. Simi- Theore. Let b and be integers greater than. If = (. a a 2 a i ) b,then for any t N, in base (b + t), the fraction has the digital representation = (. a a 2 a i ) b+t, where a i = a i + tk i with k i =

More information

2. Electric Current. E.M.F. of a cell is defined as the maximum potential difference between the two electrodes of the

2. Electric Current. E.M.F. of a cell is defined as the maximum potential difference between the two electrodes of the 2. Electric Current The net flow of charges through a etallic wire constitutes an electric current. Do you know who carries current? Current carriers In solid - the electrons in outerost orbit carries

More information

Physics 140 D100 Midterm Exam 2 Solutions 2017 Nov 10

Physics 140 D100 Midterm Exam 2 Solutions 2017 Nov 10 There are 10 ultiple choice questions. Select the correct answer for each one and ark it on the bubble for on the cover sheet. Each question has only one correct answer. (2 arks each) 1. An inertial reference

More information

Sensitivity analysis of the expected utility maximization problem with respect to model perturbations

Sensitivity analysis of the expected utility maximization problem with respect to model perturbations Sensitivity analysis of the expected utility maximization problem with respect to model perturbations Mihai Sîrbu, The University of Texas at Austin based on joint work with Oleksii Mostovyi University

More information

List Scheduling and LPT Oliver Braun (09/05/2017)

List Scheduling and LPT Oliver Braun (09/05/2017) List Scheduling and LPT Oliver Braun (09/05/207) We investigate the classical scheduling proble P ax where a set of n independent jobs has to be processed on 2 parallel and identical processors (achines)

More information

Optimal Stopping Problems and American Options

Optimal Stopping Problems and American Options Optimal Stopping Problems and American Options Nadia Uys A dissertation submitted to the Faculty of Science, University of the Witwatersrand, in fulfilment of the requirements for the degree of Master

More information

Bootstrapping Dependent Data

Bootstrapping Dependent Data Bootstrapping Dependent Data One of the key issues confronting bootstrap resapling approxiations is how to deal with dependent data. Consider a sequence fx t g n t= of dependent rando variables. Clearly

More information

Utility Maximization in Hidden Regime-Switching Markets with Default Risk

Utility Maximization in Hidden Regime-Switching Markets with Default Risk Utility Maximization in Hidden Regime-Switching Markets with Default Risk José E. Figueroa-López Department of Mathematics and Statistics Washington University in St. Louis figueroa-lopez@wustl.edu pages.wustl.edu/figueroa

More information

Worst Case Portfolio Optimization and HJB-Systems

Worst Case Portfolio Optimization and HJB-Systems Worst Case Portfolio Optimization and HJB-Systems Ralf Korn and Mogens Steffensen Abstract We formulate a portfolio optimization problem as a game where the investor chooses a portfolio and his opponent,

More information

On the quantiles of the Brownian motion and their hitting times.

On the quantiles of the Brownian motion and their hitting times. On the quantiles of the Brownian motion and their hitting times. Angelos Dassios London School of Economics May 23 Abstract The distribution of the α-quantile of a Brownian motion on an interval [, t]

More information

Multi-dimensional Stochastic Singular Control Via Dynkin Game and Dirichlet Form

Multi-dimensional Stochastic Singular Control Via Dynkin Game and Dirichlet Form Multi-dimensional Stochastic Singular Control Via Dynkin Game and Dirichlet Form Yipeng Yang * Under the supervision of Dr. Michael Taksar Department of Mathematics University of Missouri-Columbia Oct

More information

Curious Bounds for Floor Function Sums

Curious Bounds for Floor Function Sums 1 47 6 11 Journal of Integer Sequences, Vol. 1 (018), Article 18.1.8 Curious Bounds for Floor Function Sus Thotsaporn Thanatipanonda and Elaine Wong 1 Science Division Mahidol University International

More information

LAB MECH8.COMP From Physics with Computers, Vernier Software & Technology, 2003.

LAB MECH8.COMP From Physics with Computers, Vernier Software & Technology, 2003. LAB MECH8.COMP Fro Physics with Coputers, Vernier Software & Technology, 003. INTRODUCTION You have probably watched a ball roll off a table and strike the floor. What deterines where it will land? Could

More information

International Journal on Recent and Innovation Trends in Computing and Communication ISSN: Volume: 5 Issue:

International Journal on Recent and Innovation Trends in Computing and Communication ISSN: Volume: 5 Issue: Optial Specially Structured N X 2 Flow Shop Scheduling To Miniize Total Waiting Tie of Jobs ncluding Job Block Concept with Processing Tie Separated Fro Set up Tie Dr Deepak Gupta Professor & Head Departent

More information

Portfolio Optimization with unobservable Markov-modulated drift process

Portfolio Optimization with unobservable Markov-modulated drift process Portfolio Optimization with unobservable Markov-modulated drift process Ulrich Rieder Department of Optimization and Operations Research University of Ulm, Germany D-89069 Ulm, Germany e-mail: rieder@mathematik.uni-ulm.de

More information

EXPLOSIONS AND ARBITRAGE IOANNIS KARATZAS. Joint work with Daniel FERNHOLZ and Johannes RUF. Talk at the University of Michigan

EXPLOSIONS AND ARBITRAGE IOANNIS KARATZAS. Joint work with Daniel FERNHOLZ and Johannes RUF. Talk at the University of Michigan EXPLOSIONS AND ARBITRAGE IOANNIS KARATZAS Department of Mathematics, Columbia University, New York INTECH Investment Management LLC, Princeton Joint work with Daniel FERNHOLZ and Johannes RUF Talk at the

More information

Topic 5a Introduction to Curve Fitting & Linear Regression

Topic 5a Introduction to Curve Fitting & Linear Regression /7/08 Course Instructor Dr. Rayond C. Rup Oice: A 337 Phone: (95) 747 6958 E ail: rcrup@utep.edu opic 5a Introduction to Curve Fitting & Linear Regression EE 4386/530 Coputational ethods in EE Outline

More information

Understanding Machine Learning Solution Manual

Understanding Machine Learning Solution Manual Understanding Machine Learning Solution Manual Written by Alon Gonen Edited by Dana Rubinstein Noveber 17, 2014 2 Gentle Start 1. Given S = ((x i, y i )), define the ultivariate polynoial p S (x) = i []:y

More information

An Introduction to Malliavin calculus and its applications

An Introduction to Malliavin calculus and its applications An Introduction to Malliavin calculus and its applications Lecture 3: Clark-Ocone formula David Nualart Department of Mathematics Kansas University University of Wyoming Summer School 214 David Nualart

More information

EN40: Dynamics and Vibrations. Midterm Examination Tuesday March

EN40: Dynamics and Vibrations. Midterm Examination Tuesday March EN4: Dynaics and ibrations Midter Exaination Tuesday Marc 4 14 Scool of Engineering Brown University NAME: General Instructions No collaboration of any kind is peritted on tis exaination. You ay bring

More information

Some Proofs: This section provides proofs of some theoretical results in section 3.

Some Proofs: This section provides proofs of some theoretical results in section 3. Testing Jups via False Discovery Rate Control Yu-Min Yen. Institute of Econoics, Acadeia Sinica, Taipei, Taiwan. E-ail: YMYEN@econ.sinica.edu.tw. SUPPLEMENTARY MATERIALS Suppleentary Materials contain

More information

Soft Computing Techniques Help Assign Weights to Different Factors in Vulnerability Analysis

Soft Computing Techniques Help Assign Weights to Different Factors in Vulnerability Analysis Soft Coputing Techniques Help Assign Weights to Different Factors in Vulnerability Analysis Beverly Rivera 1,2, Irbis Gallegos 1, and Vladik Kreinovich 2 1 Regional Cyber and Energy Security Center RCES

More information

E0 370 Statistical Learning Theory Lecture 5 (Aug 25, 2011)

E0 370 Statistical Learning Theory Lecture 5 (Aug 25, 2011) E0 370 Statistical Learning Theory Lecture 5 Aug 5, 0 Covering Nubers, Pseudo-Diension, and Fat-Shattering Diension Lecturer: Shivani Agarwal Scribe: Shivani Agarwal Introduction So far we have seen how

More information

Support Vector Machine Classification of Uncertain and Imbalanced data using Robust Optimization

Support Vector Machine Classification of Uncertain and Imbalanced data using Robust Optimization Recent Researches in Coputer Science Support Vector Machine Classification of Uncertain and Ibalanced data using Robust Optiization RAGHAV PAT, THEODORE B. TRAFALIS, KASH BARKER School of Industrial Engineering

More information

Ruin probabilities of the Parisian type for small claims

Ruin probabilities of the Parisian type for small claims Ruin probabilities of the Parisian type for small claims Angelos Dassios, Shanle Wu October 6, 28 Abstract In this paper, we extend the concept of ruin in risk theory to the Parisian type of ruin. For

More information

The degree of a typical vertex in generalized random intersection graph models

The degree of a typical vertex in generalized random intersection graph models Discrete Matheatics 306 006 15 165 www.elsevier.co/locate/disc The degree of a typical vertex in generalized rando intersection graph odels Jerzy Jaworski a, Michał Karoński a, Dudley Stark b a Departent

More information

Support Vector Machines. Machine Learning Series Jerry Jeychandra Blohm Lab

Support Vector Machines. Machine Learning Series Jerry Jeychandra Blohm Lab Support Vector Machines Machine Learning Series Jerry Jeychandra Bloh Lab Outline Main goal: To understand how support vector achines (SVMs) perfor optial classification for labelled data sets, also a

More information