Mean Field Games and. Systemic Risk

Size: px
Start display at page:

Download "Mean Field Games and. Systemic Risk"

Transcription

1 Mean Field Games and Sysemic Risk Jean-Pierre Fouque Universiy of California Sana Barbara Financial Mahemaics Tuorials IPAM-UCLA March 10-11, 2015

2 2010: Dodd-Frank Bill includes he creaion of he Office of Financial Research (OFR) Ediors: J.-P. Fouque and J. Langsam Cambridge Universiy Press (2013)

3 Coupled Diffusions: Liquidiy Risk X (i), i = 1,...,N denoe log-moneary reserves of N banks dx (i) = b (i) d + σ (i) dw (i) i = 1,...,N, which are non-radable quaniies. Assume independen Brownian moions W (i), i = 1,...,N and idenical consan volailiies σ (i) = σ Model borrowing and lending hrough he drifs: dx (i) = α N j=1 (X (j) X (i) ) d + σdw (i), i = 1,...,N. The overall rae of borrowing and lending α/n has been normalized by he number of banks and we assume α > 0

4 Coupled Diffusions: Liquidiy Risk X (i), i = 1,...,N denoe log-moneary reserves of N banks dx (i) = b (i) d + σ (i) dw (i) i = 1,...,N, which are non-radable quaniies. Assume independen Brownian moions W (i), i = 1,...,N and idenical consan volailiies σ (i) = σ Model borrowing and lending hrough he drifs: dx (i) = α N j=1 (X (j) X (i) ) d + σdw (i), i = 1,...,N. The overall rae of borrowing and lending α/n has been normalized by he number of banks and we assume α > 0

5 Coupled Diffusions: Liquidiy Risk X (i), i = 1,...,N denoe log-moneary reserves of N banks dx (i) = b (i) d + σ (i) dw (i) i = 1,...,N, which are non-radable quaniies. Assume independen Brownian moions W (i), i = 1,...,N and idenical consan volailiies σ (i) = σ Model borrowing and lending hrough he drifs: dx (i) = a N j=1 (X (j) X (i) ) d + σdw (i), i = 1,...,N. The overall rae of borrowing and lending a/n has been normalized by he number of banks.

6 Fully Conneced Symmeric Nework dx (i) = a N j=1 (X (j) X (i) ) d + σdw (i), i = 1,...,N. N=10 Denoe he defaul level by D < 0 and simulae he sysem for various values of a: 0, 1, 10, 100 wih fixed σ = 1

7 One realizaion of he rajecories of he coupled diffusions X (i) wih a = 1 (lef plo) and rajecories of he independen Brownian moions (a = 0) (righ plo) using he same Gaussian incremens. Solid horizonal line: defaul level D = 0.7

8 One realizaion of he rajecories of he coupled diffusions X (i) wih a = 10 (lef plo) and rajecories of he independen Brownian moions (a = 0) (righ plo) using he same Gaussian incremens. Solid horizonal line: defaul level D = 0.7

9 One realizaion of he rajecories of he coupled diffusions X (i) wih a = 100 (lef plo) and rajecories of he independen Brownian moions (a = 0) (righ plo) using he same Gaussian incremens. Solid horizonal line: defaul level D = 0.7

10 These simulaions show ha STABILITY is creaed by increasing he rae of borrowing and lending. Nex, we compare he loss disribuions for he coupled and independen cases. We compue hese loss disribuions by Mone Carlo mehod using 10 4 simulaions, and wih he same parameers as previously. In he independen case, he loss disribuion is Binomial(N, p) wih parameer p given by ( ) p = IP min (σw ) η 0 T ( ) η = 2Φ σ, T where Φ denoes he N(0, 1)-cdf, and we used he disribuion of he minimum of a Brownian moion (see Karazas-Shreve 2000 for insance). Wih our choice of parameers, we have p 0.5

11 These simulaions show ha STABILITY is creaed by increasing he rae of borrowing and lending. Nex, we compare he loss disribuions for he coupled and independen cases. We compue hese loss disribuions by Mone Carlo mehod using 10 4 simulaions, and wih he same parameers as previously. In he independen case, he loss disribuion is Binomial(N, p) wih parameer p given by ( ) p = IP min (σw ) D 0 T ( ) D = 2Φ σ, T where Φ denoes he N(0, 1)-cdf, and we used he disribuion of he minimum of a Brownian moion (see Karazas-Shreve 2000 for insance). Wih our choice of parameers, we have p 0.5

12 These simulaions show ha STABILITY is creaed by increasing he rae of borrowing and lending. Nex, we compare he loss disribuions for he coupled and independen cases. We compue hese loss disribuions by Mone Carlo mehod using 10 4 simulaions, and wih he same parameers as previously. In he independen case, he loss disribuion is Binomial(N, p) wih parameer p given by ( ) p = IP min (σw ) D 0 T ( ) D = 2Φ σ, T where Φ denoes he N(0, 1) cdf. Wih our choice of parameers, we have p 0.5

13 prob of # of defaul prob of # of defaul # of defaul # of defaul On he lef, we show plos of he loss disribuion for he coupled diffusions wih a = 1 (solid line) and for he independen Brownian moions (dashed line). The plos on he righ show he corresponding ail probabiliies.

14 prob of # of defaul prob of # of defaul # of defaul # of defaul On he lef, we show plos of he loss disribuion for he coupled diffusions wih a = 10 (solid line) and for he independen Brownian moions (dashed line). The plos on he righ show he corresponding ail probabiliies.

15 1 0.2 prob of # of defaul prob of # of defaul # of defaul # of defaul On he lef, we show plos of he loss disribuion for he coupled diffusions wih a = 100 (solid line) and for he independen Brownian moions (dashed line). The plos on he righ show he corresponding ail probabiliies.

16 Rewrie he dynamics as: dx (i) = a N j=1 = a 1 N Mean-field Limi (X (j) j=1 X (i) ) d + σdw (i) X (j) X (i) d + σdw (i). The processes X (i) s are OUs mean-revering o he ensemble average which saisfies ( ) ( ) 1 d X (i) σ = d W (i). N N i=1 i=1

17 Rewrie he dynamics as: dx (i) = a N j=1 = a 1 N Mean-field Limi (X (j) j=1 X (i) ) d + σdw (i) X (j) X (i) d + σdw (i). The processes X (i) s are OUs mean-revering o he ensemble average which saisfies ( ) ( ) 1 d X (i) σ = d W (i). N N i=1 i=1

18 Assuming for insance ha x (i) 0 = 0, i = 1,...,N, we obain 1 N dx (i) i=1 X (i) = σ N = a σ N j=1 i=1 W (i), and consequenly W (j) X (i) d + σdw (i). Noe ha he ensemble average is disribued as a Brownian moion wih diffusion coefficien σ/ N. In he limi N, he srong law of large numbers gives 1 N j=1 W (j) 0 a.s., and herefore, he processes X (i) s converge o independen OU processes wih long-run mean zero.

19 Assuming for insance ha x (i) 0 = 0, i = 1,...,N, we obain 1 N dx (i) i=1 X (i) = σ N = a σ N j=1 i=1 W (i), and consequenly W (j) X (i) d + σdw (i). Noe ha he ensemble average is disribued as a Brownian moion wih diffusion coefficien σ/ N. In he limi N, he srong law of large numbers gives 1 N j=1 W (j) 0 a.s., and herefore, he processes X (i) s converge o independen OU processes wih long-run mean zero.

20 Assuming for insance ha x (i) 0 = 0, i = 1,...,N, we obain 1 N dx (i) i=1 X (i) = σ N = a σ N j=1 i=1 W (i), and consequenly W (j) X (i) d + σdw (i). Noe ha he ensemble average is disribued as a Brownian moion wih diffusion coefficien σ/ N. In he limi N, he srong law of large numbers gives 1 N j=1 W (j) 0 a.s., and herefore, he processes X (i) s converge o independen OU processes wih long-run mean zero.

21 In fac, X (i) X (i) = σ N j=1 is given explicily by W (j) +σe a 0 e as dw s (i) σ N (e a j=1 0 ) e as dw s (j), and herefore, X (i) converges o σe a 0 eas dw s (i) independen OU processes. which are This is a simple example of a mean-field limi and propagaion of chaos sudied in general by Szniman (1991).

22 Sysemic Risk Using classical equivalen for he Gaussian cumulaive disribuion funcion, we obain he large deviaion esimae ( ( ) ) lim 1 σ log IP min W (i) D = D2 N N 0 T N 2σ 2 T. For a large number of banks, he probabiliy ha ( he ensemble ) average reaches he defaul barrier is of order exp η2 N 2σ 2 T { Since min 0 T ( σ N 1 N i=1 i=1 X (i) X (i) ) = σ N η } i=1 i=1 W (i), we idenify as a sysemic even Observe ha his even does no depend on α > 0

23 Sysemic Risk Using classical equivalen for he Gaussian cumulaive disribuion funcion, we obain he large deviaion esimae ( ( ) ) lim 1 σ log IP min W (i) D = D2 N N 0 T N 2σ 2 T. For a large number of banks, he probabiliy ha ( he ensemble ) average reaches he defaul barrier is of order exp D2 N 2σ 2 T { Since min 0 T ( σ N 1 N i=1 i=1 X (i) X (i) ) = σ N η } i=1 i=1 W (i), we idenify as a sysemic even Observe ha his even does no depend on α > 0

24 Sysemic Risk Using classical equivalen for he Gaussian cumulaive disribuion funcion, we obain he large deviaion esimae ( ( ) ) lim 1 σ log IP min W (i) D = D2 N N 0 T N 2σ 2 T. For a large number of banks, he probabiliy ha ( he ensemble ) average reaches he defaul barrier is of order exp D2 N 2σ 2 T { Since min 0 T ( 1 N 1 N i=1 i=1 X (i) X (i) ) = σ N D } i=1 i=1 W (i), we idenify as a sysemic even Observe ha his even does no depend on a > 0

25 The probabiliy exp ( D2 N 2σ 2 T of a sysemic even does no depend on a > 0, in oher words: Increasing sabiliy by increasing he rae of borrowing and lending does no preven a sysemic even where a large number of banks defaul In fac, once in his even, increasing a creaes even more defauls by flocking o defaul. This is illusraed in he simulaion wih a = 100 where he probabiliy of sysemic risk is roughly 3%. )

26 dx i = a 1 N Sysemic Risk and Common Noise X j X i d+σ j=1 ( ρdw 0 + ) 1 ρ 2 dw i, i = 1,,N, The ensemble average: ( 1 X i = σ 1 ρ W i = σ ρw N N N i=1 i=1 i=1 = (in D) σ ρ 2 + (1 ρ2 ) N B, The probabiliy of he sysemic even becomes ( ) ( ) 1 ( ) IP min Xs i D < D = 2Φ 0 s T N σ N D 2Φ T Nρ 2 + (1 ρ 2 ) σ ρ T i=1 W i )

27 dx i = a 1 N Sysemic Risk and Common Noise X j X i d+σ j=1 ( ρdw 0 + ) 1 ρ 2 dw i, i = 1,,N, The ensemble average: ( 1 X i = σ 1 ρ W i = σ ρw N N N i=1 i=1 i=1 = (in D) σ ρ 2 + (1 ρ2 ) N B, The probabiliy of he sysemic even becomes ( ) ( ) 1 ( ) IP min Xs i D < D = 2Φ 0 s T N σ N D 2Φ T Nρ 2 + (1 ρ 2 ) σ ρ T i=1 W i )

28 dx i = a 1 N Sysemic Risk and Common Noise X j X i d+σ j=1 ( ρdw 0 + ) 1 ρ 2 dw i, i = 1,,N, The ensemble average: ( 1 X i = σ 1 ρ W i = σ ρw N N N i=1 i=1 i=1 = (in D) σ ρ 2 + (1 ρ2 ) N B, The probabiliy of he sysemic even becomes ( ) ( ) 1 ( ) IP min Xs i D < D = 2Φ 0 s T N σ N D 2Φ T Nρ 2 + (1 ρ 2 ) σ ρ T i=1 W i )

29 ρ = 0 ρ = 0.5

30 So far we have seen ha: Lending and borrowing improves sabiliy bu also conribues o sysemic risk bf Bu how abou if he banks compee? bf (minimizing coss, maximizing profis,...) Can we find an equilibrium in which he previous analysis can sill be performed? Can we find and characerize a Nash equilibrium? Wha follows is a work in progress wih René Carmona

31 So far we have seen ha: Lending and borrowing improves sabiliy bu also conribues o sysemic risk Bu how abou if he banks compee? (minimizing coss, maximizing profis,...) Can we find an equilibrium in which he previous analysis can sill be performed? Can we find and characerize a Nash equilibrium? Wha follows is from Mean Field Games and Sysemic Risk R. Carmona, J. P. Fouque and L.-H. Sun

32 So far we have seen ha: Lending and borrowing improves sabiliy bu also conribues o sysemic risk Bu how abou if he banks compee? (minimizing coss, maximizing profis,...) Can we find an equilibrium in which he previous analysis can sill be performed? Can we find and characerize a Nash equilibrium? Wha follows is a work in progress wih René Carmona

33 So far we have seen ha: Lending and borrowing improves sabiliy bu also conribues o sysemic risk Bu how abou if he banks compee? (minimizing coss, maximizing profis,...) Can we find an equilibrium in which he previous analysis can sill be performed? Can we find and characerize a Nash equilibrium? Wha follows is from Mean Field Games and Sysemic Risk by R. Carmona, J.-P. Fouque and L.-H. Sun (2013)

34 Mean Field Game Banks are borrowing from and lending o a cenral bank: dx i = α i d + σdw i, i = 1,,N where α i is he conrol of bank i which wans o minimize { } T J i (α 1,,α N ) = IE f i (X, α)d i + g i (X T ), 0 wih running cos [ 1 f i (x, α i ) = 2 (αi ) 2 qα i (x x i ) + ǫ ] 2 (x xi ) 2, q 2 ǫ, and erminal cos g i (x) = c 2 ( x x i ) 2. This is an example of Mean Field Game (MFG) sudied exensively by P.L. Lions and collaboraors (see also he recen work of R. Carmona and F. Delarue).

35 Nash Equilibria (FBSDE Approach) The Hamilonian: H i (x, y i,1,,y i,n, α 1 (, x),,α, i,α N (, x)) = α k (, x)y i,k + α i y i,i k i (αi ) 2 qα i (x x i ) + ǫ 2 (x xi ) 2, Minimizing H i over α i gives he choices: ˆα i = y i,i + q(x x i ), i = 1,,N, Ansaz: Y i,j = η ( 1 N δ i,j ) (X X i ), where η is a deerminisic funcion saisfying he erminal condiion η T = c.

36 Nash Equilibria (FBSDE Approach) The Hamilonian: H i (x, y i,1,,y i,n, α 1 (, x),,α, i,α N (, x)) = α k (, x)y i,k + α i y i,i k i (αi ) 2 qα i (x x i ) + ǫ 2 (x xi ) 2, Minimizing H i over α i gives he choices: ˆα i = y i,i + q(x x i ), i = 1,,N, Ansaz: Y i,j = η ( 1 N δ i,j ) (X X i ), where η is a deerminisic funcion saisfying he erminal condiion η T = c.

37 Nash Equilibria (FBSDE Approach) The Hamilonian: H i (x, y i,1,,y i,n, α 1 (, x),,α, i,α N (, x)) = α k (, x)y i,k + α i y i,i k i (αi ) 2 qα i (x x i ) + ǫ 2 (x xi ) 2, Minimizing H i over α i gives he choices: ˆα i = y i,i + q(x x i ), i = 1,,N, Ansaz: Y i,j = η ( 1 N δ i,j ) (X X i ), where η is a deerminisic funcion saisfying he erminal condiion η T = c.

38 Forward Equaion: Forward-Backward Equaions dx i = y i,ih i d + σdw i [ = q + (1 1 ] N )η (X X)d i + σdw i, wih iniial condiions X i 0 = x i 0. Backward Equaion: dy i,j = x jh i d + k=1 Z i,j,k dw k = ( 1 [ N δ i,j)(x X) i (a + q)η 1 N ( 1 ] N 1)η2 + q 2 ǫ d + k=1 Z i,j,k dw k, Y i,j T = c( 1 N δ i,j)(x T X i T).

39 Forward Equaion: Forward-Backward Equaions dx i = y i,ih i d + σdw i [ = q + (1 1 ] N )η (X X)d i + σdw i, wih iniial condiions X i 0 = x i 0. Backward Equaion: dy i,j = x jh i d + k=1 Z i,j,k dw k = ( 1 [ N δ i,j)(x X) i qη 1 N ( 1 ] N 1)η2 + q 2 ǫ d + k=1 Z i,j,k dw k, Y i,j T = c( 1 N δ i,j)(x T X i T).

40 Soluion o he Forward-Backward Equaions By summaion of he forward equaions: dx = σ N N k=1 dw k. ( Differeniaing he ansaz Y i,j = η dy i,j = 1 N δ i,j ) (X X i ), we ge: ( ) [ 1 N δ i,j (X X) i η η (a + q + (1 1 ) ] N )η d +η ( 1 N δ i,j)σ ( 1 N δ i,k)dw k. k=1 Idenifying wih he backward equaions: Z i,j,k = η σ 1 ρ 2 ( 1 N δ i,j)( 1 N δ i,k) for k = 1,,N, and η mus saisfy he Riccai equaion η = 2(a + q)η + (1 1 N 2 )η2 (ǫ q 2 ), wih he erminal condiion η T = c.

41 Soluion o he Forward-Backward Equaions By summaion of he forward equaions: dx = σ N N k=1 dw k. ( Differeniaing he ansaz Y i,j = η dy i,j = 1 N δ i,j ) (X X i ), we ge: ( ) [ 1 N δ i,j (X X) i η η (q + (1 1 ) ] N )η d +η ( 1 N δ i,j)σ ( 1 N δ i,k)dw k. k=1 Idenifying wih he backward equaions: Z i,j,k = η σ( 1 N δ i,j)( 1 N δ i,k) for k = 1,,N, and η mus saisfy he Riccai equaion η = 2(a + q)η + (1 1 N 2 )η2 (ǫ q 2 ), wih he erminal condiion η T = c.

42 Soluion o he Forward-Backward Equaions By summaion of he forward equaions: dx = σ N N k=1 dw k. ( Differeniaing he ansaz Y i,j = η dy i,j = 1 N δ i,j ) (X X i ), we ge: ( ) [ 1 N δ i,j (X X) i η η (q + (1 1 ) ] N )η d +η ( 1 N δ i,j)σ ( 1 N δ i,k)dw k. k=1 Idenifying wih he backward equaions: Z i,j,k = η σ( 1 N δ i,j)( 1 N δ i,k) for k = 1,,N, and η mus saisfy he Riccai equaion η = 2(a + q)η + (1 1 N 2 )η2 (ǫ q 2 ), wih he erminal condiion η T = c.

43 Soluion o he Forward-Backward Equaions By summaion of he forward equaions: dx = σ N N k=1 dw k. ( Differeniaing he ansaz Y i,j = η dy i,j = 1 N δ i,j ) (X X i ), we ge: ( ) [ 1 N δ i,j (X X) i η η (q + (1 1 ) ] N )η d +η ( 1 N δ i,j)σ ( 1 N δ i,k)dw k. k=1 Idenifying wih he backward equaions: Z i,j,k = η σ( 1 N δ i,j)( 1 N δ i,k) for k = 1,,N, and η mus saisfy he Riccai equaion η = 2qη + (1 1 N 2 )η2 (ǫ q 2 ), wih he erminal condiion η T = c.

44 η = Soluion o he Riccai Equaion ( ) ) (ǫ q 2 ) e (δ+ δ )(T ) 1 c (δ + e (δ+ δ )(T ) δ ( δ e (δ+ δ )(T ) δ +) c(1 1 N ) ( e 2 (δ+ δ )(T ) 1 ), wih he noaions δ ± = q ± R, ( R = q ) N 2 (ǫ q 2 ) > 0. Observe ha η is well defined for any T since he denominaor can be wrien as ( ) ( ( e (δ+ δ )(T ) + 1 R a + q + c 1 1 )) ( N 2 e (δ+ δ )(T ) 1), which says negaive because δ + δ = 2 R > 0. In fac, using q 2 ǫ, we see ha η is posiive wih η T = c.

45 η = Soluion o he Riccai Equaion ( ) ) (ǫ q 2 ) e (δ+ δ )(T ) 1 c (δ + e (δ+ δ )(T ) δ ( δ e (δ+ δ )(T ) δ +) c(1 1 N ) ( e 2 (δ+ δ )(T ) 1 ), wih he noaions δ ± = q ± R, ( R = q) ) N 2 (ǫ q 2 ) > 0. Observe ha η is well defined for any T since he denominaor can be wrien as ( ) ( ( e (δ+ δ )(T ) + 1 R q + c 1 1 )) ( N 2 e (δ+ δ )(T ) 1), which says negaive because δ + δ = 2 R > 0, and in fac, using q 2 ǫ, we see ha η is posiive wih η T = c.

46 Financial Implicaions 1. Once he funcion η has been obained, bank i implemens is sraegy by using is conrol [ ˆα i = Y i,i + q(x X) i = q + (1 1 ] N )η (X X), i I requires is own log-reserve X i bu also he average reserve X which may or may no be known o he individual bank i. Observe ha he average X is given by dx = σ N N k=1 dw k, and is idenical o he average found in he unconrolled case. Therefore, sysemic risk occurs in he same manner as in he case of unconrolled dynamics. However, he conrol affecs he rae of borrowing and lending by adding he ime-varying componen q + (1 1 N )η o he unconrolled rae a.

47 Financial Implicaions 1. Once he funcion η has been obained, bank i implemens is sraegy by using is conrol [ ˆα i = Y i,i + q(x X) i = q + (1 1 ] N )η (X X), i I requires is own log-reserve X i bu also he average reserve X which may or may no be known o he individual bank i. Observe ha he average X is given by dx = σ N N k=1 dw k, and is idenical o he average found in he unconrolled case. Therefore, sysemic risk occurs in he same manner as in he case of unconrolled dynamics. However, he conrol affecs he rae of borrowing and lending by adding he ime-varying componen q + (1 1 N )η o he unconrolled rae a.

48 Financial Implicaions 2. In fac, he conrolled dynamics can be rewrien dx i = ( q + (1 1 ) 1 N )η N (X j X)d i + σdw i. The effec of he banks using heir opimal sraegies corresponds o iner-bank borrowing and lending a he effecive rae j=1 A := q + (1 1 N )η. Under his equilibrium, he cenral bank is simply a clearing house, and he sysem is operaing as if banks were borrowing from and lending o each oher a he rae A, and he ne effec is creaing liquidiy quanified by he rae of lending/borrowing.

49 Financial Implicaions 2. In fac, he conrolled dynamics can be rewrien dx i = ( q + (1 1 ) 1 N )η N (X j X)d i + σdw i. The effec of he banks using heir opimal sraegies corresponds o iner-bank borrowing and lending a he effecive rae j=1 A := q + (1 1 N )η. Under his equilibrium, he cenral bank is simply a clearing house, and he sysem is operaing as if banks were borrowing from and lending o each oher a he rae A, and he ne effec is creaing liquidiy quanified by he rae of lending/borrowing.

50 Financial Implicaions 3. For T large (mos of he ime T large), η is mainly consan. For insance, wih c = 0, lim T η = ǫ q2 δ := η Plos of η wih c = 0, q = 1, ǫ = 2 and T = 1 on he lef, T = 100 on he righ wih η 0.24 (here we used 1/N 0). A := a + q + (1 1 N )η.

51 Financial Implicaions 3. For T large (mos of he ime T large), η is mainly consan. For insance, wih c = 0, lim T η = ǫ q2 δ := η Plos of η wih c = 0, q = 1, ǫ = 2 and T = 1 on he lef, T = 100 on he righ wih η 0.24 (here we used 1/N 0). Therefore, in his infinie-horizon equilibrium, banks are borrowing and lending o each oher a he consan rae A := q + (1 1 N )η = q + η in he Mean Field Limi.

52 Equilibrium: Fully Conneced Symmeric Nework dx (i) = A N j=1 (X (j) ( X (i) ) d+σ ρdw ρ 2 dw (i) ), i = 1,...,N. N=10 Bu, how o generae a cenrally conneced nework?

53 Game wih a Cenral Bank Banks (i = 2,,N) are borrowing from and lending o a cenral bank (i = 1): ( dx i = αd i + σ ρdw 0 + ) 1 ρ 2 dw i, i = 2,,N ( N ( ) dx 1 = α )d i + σ 1 ρ 1 dw ρ 2 1 dw 1 i=2 where α i is he conrol of bank i which wans o minimize { } T J i (α 2,,α N ) = IE f i (X, α)d i + g i (X T ), 0 wih running cos [ 1 f i (x, α i ) = 2 (αi ) 2 qα i (x 1 x i ) + ǫ ] 2 (x1 x i ) 2, q 2 ǫ, and erminal cos g i (x) = c 2 ( x 1 x i) 2.

54 Equilibrium (skipping deails of he derivaion) dx i = A(X 1 X i )d + σ dx 1 = A ( X i X 1 i=2 ( ρdw 0 + ) 1 ρ 2 dw i, i = 2,,N ) ) d + σ1 ( ρ 1 dw ρ 2 1 dw 1 N=10

55 Comparison using Sysemic Risk Measures Join work in progress wih F. Biagini, M. Frielli and T. Meyer-Brandis Le X = (X 1,, X N ) be a risky posiion. Aggregae firs versus Allocae firs Aggregae firs: ρ(x) = inf { } m IR Λ 1 ( X i + m) A γ. i=1 For insance: Λ 1 (Y ) = (Y d) and A γ = {Z L 0 IE(Z) γ}. Allocae firs: { N } ρ(x) = inf m i Λ(X + m), m = (m 1,,m N ) IR N. i=1

56 Comparison using Sysemic Risk Measures Join work in progress wih F. Biagini, M. Frielli and T. Meyer-Brandis Le X = (X 1,, X N ) be a risky posiion. Aggregae firs versus Allocae firs Aggregae firs: ρ(x) = inf { m IR Λ 1 ( For insance: Λ 1 (Y ) = (Y d) } X i + m) A γ. i=1 and A γ = {Z L 0 IE(Z) γ}. Allocae firs: { N } ρ(x) = inf m i Λ(X + m), m = (m 1,,m N ) IR N. i=1 For insance: Λ(Y ) = (Y i d i ) and A γ = {Z L 0 IE(Z) γ}. i=1

57 Comparison using Sysemic Risk Measures Join work in progress wih F. Biagini, M. Frielli and T. Meyer-Brandis Le X = (X 1,, X N ) be a risky posiion. Aggregae firs versus Allocae firs Aggregae firs: ρ(x) = inf { m IR Λ 1 ( For insance: Λ 1 (Y ) = (Y d) } X i + m) A γ. i=1 and A γ = {Z L 0 IE(Z) γ}. Allocae firs: { N } ρ(x) = inf m i Λ(X + m) A γ, m = (m 1,,m N ) IR N. i=1 For insance: Λ(Y ) = (Y i d i ) and A γ = {Z L 0 IE(Z) γ}. i=1

58 The Gaussian Case Le X = (X 1,, X N ) be a Gaussian vecor wih marginal disribuions N(µ i, s 2 i), hen by allocaing firs we ge: ρ(x) = inf { N m i i=1 i=1 } IE[(X i + m i d i ) ] γ. = i=1 Ψ(m) := IE[(X i + m i d i ) ] i=1 [ s i exp ( (d i µ i m i ) 2 ) ( )] di µ i m i + (d i µ i m i )Φ. 2π 2s 2 i s i

59 Noing ha Opimal Allocaion Ψ(m) m i ( ) di µ i m i = Φ, a direc compuaion via Lagrange muliplier gives: where R solves s i m i = d i µ i s i R P(R) := 1 exp( R 2 /2) RΦ(R) = γ 2π N i=1 s i Noe ha his allocae firs approach gives a way o rank banks in erms of heir conribuions o sysemic risk. A direc analysis of m i µ i and m i σ i and increases wih s i. shows ha m i decreases wih µ i

60 Fully Conneced Symmeric Nework Here we consider he fully homogeneous case where x i 0 = x 0, p i,j = a/n, σ i = σ, ρ i = ρ, d i = d, so ha he model becomes dx i = a ( (X j X i N ) d+σ ρdw 0 + ) 1 ρ 2 dw i, i = 1,,N, j=1 N=10

61 Fully Conneced Symmeric Nework (coninued) X = (X 1,,X N ) is Gaussian wih marginal disribuions characerized by he means µ i = IE(X i ) = x 0, and he variances s 2 i = σ 2 (1 ρ 2 )(1 1 ( ) 1 e 2a N ) + σ (ρ ) ρ2. 2a N

62 Cenral Clearing Symmeric Nework dx i = a(x 1 X i )d + σ dx 1 = a ( X i X 1 i=2 ( ρdw 0 + ) 1 ρ 2 dw i, i = 2,,N ) ) d + σ1 ( ρ 1 dw ρ 2 1 dw 1 N=10

63 Cenral Clearing Symmeric Nework (coninued) X = (X 1,,X N ) is again Gaussian. Assuming X0 i = x 0, i = 1,,N, a edious compuaion gives IE(X ) i = x 0 and he marginal variances for i 2: s 2 i = σ 2 (1 ρ 2 )(1 1 ( ) 1 e 2a N ) + σ (ρ ) ρ2 2a N + 2σρ N [σ 1ρ 1 σρ] + O( 1 N 2 ), which shows ha he sign of [σ 1 ρ 1 σρ] decides which nework is more risky (a leas a he order 1/N).

64 Mean Field Game (N ) In mos cases he finie player game will no be solved explicily. For insance, wih a sligh generalizaion such as: dx i = a(x ) α i d + σdw i, i = 1,,N This is where MFG is needed.

65 Mean Field Game (N ) wih Common Noise 1. Fix (m ) 0 (he limi of X as N which depends on W 0 ) 1. Solve he conrol problem { T [ 1 2 (α ) 2 qα (m X ) + ǫ ] } 2 (m X ) 2 d + c 2 (m T X T ) 2 inf IE (α ) 0 subjec o: dx = [a(m X ) + α ]d + σ (ρdw 0 + ) 1 ρ 2 dw 2. Find m so ha m = IE[X (W 0 s ) s ] for all. Hamilonian: H(, x, y, α) = [a(m x) + α] y α2 qα(m x) H α ˆα = q(m x) y

66 Mean Field Game (N ) Fix (m ) 0 (he limi of X as N which depends on W 0 ) Solve he conrol problem { T [ 1 2 (α ) 2 qα (m X ) + ǫ ] } 2 (m X ) 2 d + c 2 (m T X T ) 2 inf IE (α ) 0 subjec o: dx = α d + σ (ρdw 0 + ) 1 ρ 2 dw Find m so ha m = IE[X (W 0 s ) s ] for all. Hamilonian: H(, x, y, α) = [a(m x) + α] y α2 qα(m x) H α ˆα = q(m x) y

67 Mean Field Game (N ) Fix (m ) 0 (he limi of X as N which depends on W 0 ) Solve he conrol problem { T [ 1 2 (α ) 2 qα (m X ) + ǫ ] } 2 (m X ) 2 d + c 2 (m T X T ) 2 inf IE (α ) 0 subjec o: dx = α d + σ (ρdw 0 + ) 1 ρ 2 dw Find m so ha m = IE[X (W 0 s ) s ] for all. Hamilonian: H(, x, y, α) = [a(m x) + α] y α2 qα(m x) H α ˆα = q(m x) y

68 Mean Field Game (N ) Fix (m ) 0 (he limi of X as N which depends on W 0 ) Solve he conrol problem { T [ 1 2 (α ) 2 qα (m X ) + ǫ ] } 2 (m X ) 2 d + c 2 (m T X T ) 2 inf IE (α ) 0 subjec o: dx = α d + σ (ρdw 0 + ) 1 ρ 2 dw Find m so ha m = IE[X (W 0 s ) s ] for all. Hamilonian: H(, x, y, α) = αy α2 qα(m x) + ǫ 2 (m x) 2 H α ˆα = q(m x) y See also he recen paper by Carmona-Delarue-Lacker.

69 Adjoin Equaions dx = [q(m X ) Y ]d + σ (ρdw 0 + ) 1 ρ 2 dw, X 0 = ξ dy = H x d + Z0 dw 0 + Z dw, Y T = c(x T m T ) = [ qy + (ǫ q 2 )(m X ) ] d + Z 0 dw 0 + Z dw. Use he noaion m X = IE[X (W 0 s ) s ], m Y = IE[Y (W 0 s ) s ]. Taking condiional expecaion given (Ws 0 ) s in he second equaion and using m = m X for all T and consequenly m Y T = c(mx T m T) = 0, gives: m Y = T e (a+q)(s ) Z 0 sdw 0 s. Then, aking condiional expecaions in he firs equaion gives: dm X = m Y d + ρσdw 0.

70 Adjoin Equaions dx = [q(m X ) Y ]d + σ (ρdw 0 + ) 1 ρ 2 dw, X 0 = ξ dy = H x d + Z0 dw 0 + Z dw, Y T = c(x T m T ) = [ qy + (ǫ q 2 )(m X ) ] d + Z 0 dw 0 + Z dw. Use he noaion m X = IE[X (W 0 s ) s ], m Y = IE[Y (W 0 s ) s ]. Taking condiional expecaion given (Ws 0 ) s in he second equaion and using m = m X for all T and consequenly m Y T = c(mx T m T) = 0, gives: m Y = T e (a+q)(s ) Z 0 sdw 0 s. Then, aking condiional expecaions in he firs equaion gives: dm X = m Y d + ρσdw 0.

71 Adjoin Equaions dx = [q(m X ) Y ]d + σ (ρdw 0 + ) 1 ρ 2 dw, X 0 = ξ dy = H x d + Z0 dw 0 + Z dw, Y T = c(x T m T ) = [ qy + (ǫ q 2 )(m X ) ] d + Z 0 dw 0 + Z dw. Use he noaion m X = IE[X (W 0 s ) s ], m Y = IE[Y (W 0 s ) s ]. Taking condiional expecaion given (Ws 0 ) s in he second equaion and using m = m X for all T and consequenly m Y T = c(mx T m T) = 0, gives: m Y = T e q(s ) Z 0 sdw 0 s. Then, aking condiional expecaions in he firs equaion gives: dm X = m Y d + ρσdw 0.

72 Adjoin Equaions dx = [q(m X ) Y ]d + σ (ρdw 0 + ) 1 ρ 2 dw, X 0 = ξ dy = H x d + Z0 dw 0 + Z dw, Y T = c(x T m T ) = [ qy + (ǫ q 2 )(m X ) ] d + Z 0 dw 0 + Z dw. Use he noaion m X = IE[X (W 0 s ) s ], m Y = IE[Y (W 0 s ) s ]. Taking condiional expecaion given (Ws 0 ) s in he second equaion and using m = m X for all T and consequenly m Y T = c(mx T m T) = 0, gives: m Y = T e q(s ) Z 0 sdw 0 s. Then, aking condiional expecaions in he firs equaion gives: dm X = m Y d + ρσdw 0.

73 Adjoin Equaions (coninued) Ansaz: Y = η (m X ) wih η deerminisic. Differeniaing his ansaz and using he forward equaion leads o dy = η (m X )d η d(m X ) = [ ( η + η (a + q + η )) (m X ) + η m Y ] d + η σ 1 ρ 2 dw. Plugging he ansaz in he backward equaion gives dy = [ (a + q)η + (ǫ q 2 ) ] (m X )d + Z 0 dw 0 + Z dw. Idenifying he wo Iô decomposiions, we deduce from he maringale erms ha Z 0 0 and Z = η σ 1 ρ 2. From m Y = T e (a+q)(s ) Z 0 sdw 0 s, we obain m Y = 0.

74 Adjoin Equaions (coninued) Ansaz: Y = η (m X ) wih η deerminisic. Differeniaing his ansaz and using he forward equaion leads o dy = η (m X )d η d(m X ) = [ ( η + η (q + η )) (m X ) + η m Y ] d + η σ 1 ρ 2 dw. Plugging he ansaz in he backward equaion gives dy = [ (a + q)η + (ǫ q 2 ) ] (m X )d + Z 0 dw 0 + Z dw. Idenifying he wo Iô decomposiions, we deduce from he maringale erms ha Z 0 0 and Z = η σ 1 ρ 2. From m Y = T e (a+q)(s ) Z 0 sdw 0 s, we obain m Y = 0.

75 Adjoin Equaions (coninued) Ansaz: Y = η (m X ) wih η deerminisic. Differeniaing his ansaz and using he forward equaion leads o dy = η (m X )d η d(m X ) = [ ( η + η (q + η )) (m X ) + η m Y ] d + η σ 1 ρ 2 dw. Plugging he ansaz in he backward equaion gives dy = [ qη + (ǫ q 2 ) ] (m X )d + Z 0 dw 0 + Z dw. Idenifying he wo Iô decomposiions, we deduce from he maringale erms ha Z 0 0 and Z = η σ 1 ρ 2. From m Y = T e (a+q)(s ) Z 0 sdw 0 s, we obain m Y = 0.

76 Adjoin Equaions (coninued) Ansaz: Y = η (m X ) wih η deerminisic. Differeniaing his ansaz and using he forward equaion leads o dy = η (m X )d η d(m X ) = [ ( η + η (q + η )) (m X ) + η m Y ] d + η σ 1 ρ 2 dw. Plugging he ansaz in he backward equaion gives dy = [ qη + (ǫ q 2 ) ] (m X )d + Z 0 dw 0 + Z dw. Idenifying he wo Iô decomposiions, we deduce from he maringale erms ha Z 0 0 and Z = η σ 1 ρ 2. From m Y = T e (a+q)(s ) Z 0 sdw 0 s, we obain m Y = 0.

77 Adjoin Equaions (coninued) Ansaz: Y = η (m X ) wih η deerminisic. Differeniaing his ansaz and using he forward equaion leads o dy = η (m X )d η d(m X ) = [ ( η + η (q + η )) (m X ) + η m Y ] d + η σ 1 ρ 2 dw. Plugging he ansaz in he backward equaion gives dy = [ qη + (ǫ q 2 ) ] (m X )d + Z 0 dw 0 + Z dw. Idenifying he wo Iô decomposiions, we deduce from he maringale erms ha Z 0 0 and Z = η σ 1 ρ 2. From m Y = T e q(s ) Z 0 sdw 0 s, we obain m Y = 0.

78 Mean Field Game Soluion Equaing he drifs in he wo Iô decomposiions, we ge η = η 2 + 2qη (ǫ q 2 ), η T = c, which is he same Riccai equaion as before bu wih N =. From m Y = 0, we deduce ha m X = IE(ξ) + ρσw 0 which will ener in he opimal conrol (q + η )(m X X ). Once a soluion o he MFG is found, on can use i o consruc approximae Nash equilibria for he finiely many players games. Here, if one assumes ha each player is given he informaion X, and if player i uses he sraegy α i = (q + η )(X X i ), which is he limi as N of he sraegy used in he finie players game, one sees how solving he limiing MFG problem can provide approximae Nash equilibria for which he financial implicaions are idenical as he ones given for he exac Nash equilibria.

79 Mean Field Game Soluion Equaing he drifs in he wo Iô decomposiions, we ge η = η 2 + 2qη (ǫ q 2 ), η T = c, which is he same Riccai equaion as before bu wih N =. From m Y = 0, we deduce ha m X = IE(ξ) + ρσw 0 which will ener in he opimal conrol (q + η )(m X X ). Once a soluion o he MFG is found, on can use i o consruc approximae Nash equilibria for he finiely many players games. Here, if one assumes ha each player is given he informaion X, and if player i uses he sraegy α i = (q + η )(X X), i which is he limi as N of he sraegy used in he finie players game, one sees how solving he limiing MFG problem can provide approximae Nash equilibria for which he financial implicaions are idenical as he ones given for he exac Nash equilibria.

80 Mean Field Game Soluion Equaing he drifs in he wo Iô decomposiions, we ge η = η 2 + 2qη (ǫ q 2 ), η T = c, which is he same Riccai equaion as before bu wih N =. From m Y = 0, we deduce ha m X = IE(ξ) + ρσw 0 which will ener in he opimal conrol (q + η )(m X X ). Once a soluion o he MFG is found, on can use i o consruc approximae Nash equilibria for he finiely many players games. Here, if one assumes ha each player is given he informaion X, and if player i uses he sraegy α i = (q + η )(X X i ), which is he limi as N of he sraegy used in he finie players game, one sees how solving he limiing MFG problem can provide approximae Nash equilibria for which he financial implicaions are idenical as he ones given for he exac Nash equilibria.

81 Mean Field Equilibrium As N, banks become independen, ˆα = q(0 x) y = (q + η)x, and hey follow he dynamics dx = (q + η )X d + σdw Bu observe ha he large deviaion probabiliy of sysemic risk has been los.

82 MFG wih Common Noise / HJB Approach For Markovian sraegies α(, x), he dynamics are given by dx = α(, X )d + σ (ρdw 0 + ) 1 ρ 2 dw. Forward equaion for he condiional densiy of X given W 0 : dp = { x [(a(m x) + α(, x)) p ] + 12 } σ2 (1 ρ 2 ) xx p d ρσ( x p )dw 0 wih α(, x) given and m = xp (x)dx. The condiional mean m of X given W 0 is Markovian wih infiniesimal generaor denoed by L m d + ρσ( m )dw 0.

83 MFG wih Common Noise / HJB Approach For Markovian sraegies α(, x), he dynamics are given by dx = α(, X )d + σ (ρdw 0 + ) 1 ρ 2 dw. Forward equaion for he condiional densiy of X given W 0 : dp = { x [α(, x)p ] + 12 } σ2 (1 ρ 2 ) xx p d ρσ( x p )dw 0 wih α(, x) given and m = xp (x)dx. The condiional mean m of X given W 0 is Markovian wih infiniesimal generaor denoed by L m d + ρσ( m )dw 0.

84 Sochasic HJB Equaion The HJB equaion for he value funcion V (, x, m) is [ ] 1 dv + 2 σ2 (1 ρ 2 ) xx V + L m d m, X V + ( xm V ) d d + inf {α x V + α2 α 2 qα(m x) + ǫ } (m x)2 d 2 + ρσ( m V )dw 0 + ρσ( x V )dw 0 = 0. Minimize in α o ge ˆα = q(m x) x V Make he ansaz V (, x, m) = η 2 (m x) 2 + µ Plug in he forward equaion for p, muliply by x, and inegrae wih respec o x gives: dm = ρσdw 0

85 Mean Field Game Soluion Therefore, condiionally in W 0, L m V = 0 and d m, X = 0. Then, verifying ha he ansaz saisfies he HJB equaion, by canceling erms in (m x) 2 we obain ha η mus saisfy he same Riccai equaion as before (no affeced by ρ): η = η 2 + 2qη (ǫ q 2 ), η T = 0. Canceling sae-independen erms leads o µ = 1 2 σ2 (1 ρ 2 )η and herefore µ = 1 2 σ2 (1 ρ 2 ) T η s ds.

86 THANKS FOR YOUR ATTENTION

Systemic Risk and Stochastic Games with Delay

Systemic Risk and Stochastic Games with Delay Systemic Risk and Stochastic Games with Delay Jean-Pierre Fouque (with René Carmona, Mostafa Mousavi and Li-Hsien Sun) PDE and Probability Methods for Interactions Sophia Antipolis (France) - March 30-31,

More information

Systemic Risk and Stochastic Games with Delay

Systemic Risk and Stochastic Games with Delay Systemic Risk and Stochastic Games with Delay Jean-Pierre Fouque Collaborators: R. Carmona, M. Mousavi, L.-H. Sun, N. Ning and Z. Zhang Mean Field Games 2017 IPAM at UCLA JP Fouque (UC Santa Barbara) Stochastic

More information

Stochastic Modelling in Finance - Solutions to sheet 8

Stochastic Modelling in Finance - Solutions to sheet 8 Sochasic Modelling in Finance - Soluions o shee 8 8.1 The price of a defaulable asse can be modeled as ds S = µ d + σ dw dn where µ, σ are consans, (W ) is a sandard Brownian moion and (N ) is a one jump

More information

f(s)dw Solution 1. Approximate f by piece-wise constant left-continuous non-random functions f n such that (f(s) f n (s)) 2 ds 0.

f(s)dw Solution 1. Approximate f by piece-wise constant left-continuous non-random functions f n such that (f(s) f n (s)) 2 ds 0. Advanced Financial Models Example shee 3 - Michaelmas 217 Michael Tehranchi Problem 1. Le f : [, R be a coninuous (non-random funcion and W a Brownian moion, and le σ 2 = f(s 2 ds and assume σ 2

More information

Lecture 20: Riccati Equations and Least Squares Feedback Control

Lecture 20: Riccati Equations and Least Squares Feedback Control 34-5 LINEAR SYSTEMS Lecure : Riccai Equaions and Leas Squares Feedback Conrol 5.6.4 Sae Feedback via Riccai Equaions A recursive approach in generaing he marix-valued funcion W ( ) equaion for i for he

More information

Systemic Risk and Stochastic Games with Delay

Systemic Risk and Stochastic Games with Delay JOTA manuscrip No. (will be insered by he edior Sysemic Risk and Sochasic Games wih Delay René Carmona Jean-Pierre Fouque Seyyed Mosafa Mousavi Li-Hsien Sun Received: dae / Acceped: dae René Carmona ORFE,

More information

A general continuous auction system in presence of insiders

A general continuous auction system in presence of insiders A general coninuous aucion sysem in presence of insiders José M. Corcuera (based on join work wih G. DiNunno, G. Farkas and B. Oksendal) Faculy of Mahemaics Universiy of Barcelona BCAM, Basque Cener for

More information

An Introduction to Backward Stochastic Differential Equations (BSDEs) PIMS Summer School 2016 in Mathematical Finance.

An Introduction to Backward Stochastic Differential Equations (BSDEs) PIMS Summer School 2016 in Mathematical Finance. 1 An Inroducion o Backward Sochasic Differenial Equaions (BSDEs) PIMS Summer School 2016 in Mahemaical Finance June 25, 2016 Chrisoph Frei cfrei@ualbera.ca This inroducion is based on Touzi [14], Bouchard

More information

Physics 127b: Statistical Mechanics. Fokker-Planck Equation. Time Evolution

Physics 127b: Statistical Mechanics. Fokker-Planck Equation. Time Evolution Physics 7b: Saisical Mechanics Fokker-Planck Equaion The Langevin equaion approach o he evoluion of he velociy disribuion for he Brownian paricle migh leave you uncomforable. A more formal reamen of his

More information

Differential Equations

Differential Equations Mah 21 (Fall 29) Differenial Equaions Soluion #3 1. Find he paricular soluion of he following differenial equaion by variaion of parameer (a) y + y = csc (b) 2 y + y y = ln, > Soluion: (a) The corresponding

More information

Chapter 2. First Order Scalar Equations

Chapter 2. First Order Scalar Equations Chaper. Firs Order Scalar Equaions We sar our sudy of differenial equaions in he same way he pioneers in his field did. We show paricular echniques o solve paricular ypes of firs order differenial equaions.

More information

Predator - Prey Model Trajectories and the nonlinear conservation law

Predator - Prey Model Trajectories and the nonlinear conservation law Predaor - Prey Model Trajecories and he nonlinear conservaion law James K. Peerson Deparmen of Biological Sciences and Deparmen of Mahemaical Sciences Clemson Universiy Ocober 28, 213 Ouline Drawing Trajecories

More information

Solutions to Assignment 1

Solutions to Assignment 1 MA 2326 Differenial Equaions Insrucor: Peronela Radu Friday, February 8, 203 Soluions o Assignmen. Find he general soluions of he following ODEs: (a) 2 x = an x Soluion: I is a separable equaion as we

More information

Macroeconomic Theory Ph.D. Qualifying Examination Fall 2005 ANSWER EACH PART IN A SEPARATE BLUE BOOK. PART ONE: ANSWER IN BOOK 1 WEIGHT 1/3

Macroeconomic Theory Ph.D. Qualifying Examination Fall 2005 ANSWER EACH PART IN A SEPARATE BLUE BOOK. PART ONE: ANSWER IN BOOK 1 WEIGHT 1/3 Macroeconomic Theory Ph.D. Qualifying Examinaion Fall 2005 Comprehensive Examinaion UCLA Dep. of Economics You have 4 hours o complee he exam. There are hree pars o he exam. Answer all pars. Each par has

More information

Examples of Dynamic Programming Problems

Examples of Dynamic Programming Problems M.I.T. 5.450-Fall 00 Sloan School of Managemen Professor Leonid Kogan Examples of Dynamic Programming Problems Problem A given quaniy X of a single resource is o be allocaed opimally among N producion

More information

MEAN FIELD GAMES AND SYSTEMIC RISK

MEAN FIELD GAMES AND SYSTEMIC RISK MEA FIELD GAMES AD SYSTEMIC RISK REÉ CARMOA, JEA-PIERRE FOUQUE, AD LI-HSIE SU Abstract. We propose a simple model of inter-bank borrowing and lending where the evolution of the logmonetary reserves of

More information

t is a basis for the solution space to this system, then the matrix having these solutions as columns, t x 1 t, x 2 t,... x n t x 2 t...

t is a basis for the solution space to this system, then the matrix having these solutions as columns, t x 1 t, x 2 t,... x n t x 2 t... Mah 228- Fri Mar 24 5.6 Marix exponenials and linear sysems: The analogy beween firs order sysems of linear differenial equaions (Chaper 5) and scalar linear differenial equaions (Chaper ) is much sronger

More information

3.1.3 INTRODUCTION TO DYNAMIC OPTIMIZATION: DISCRETE TIME PROBLEMS. A. The Hamiltonian and First-Order Conditions in a Finite Time Horizon

3.1.3 INTRODUCTION TO DYNAMIC OPTIMIZATION: DISCRETE TIME PROBLEMS. A. The Hamiltonian and First-Order Conditions in a Finite Time Horizon 3..3 INRODUCION O DYNAMIC OPIMIZAION: DISCREE IME PROBLEMS A. he Hamilonian and Firs-Order Condiions in a Finie ime Horizon Define a new funcion, he Hamilonian funcion, H. H he change in he oal value of

More information

Two Popular Bayesian Estimators: Particle and Kalman Filters. McGill COMP 765 Sept 14 th, 2017

Two Popular Bayesian Estimators: Particle and Kalman Filters. McGill COMP 765 Sept 14 th, 2017 Two Popular Bayesian Esimaors: Paricle and Kalman Filers McGill COMP 765 Sep 14 h, 2017 1 1 1, dx x Bel x u x P x z P Recall: Bayes Filers,,,,,,, 1 1 1 1 u z u x P u z u x z P Bayes z = observaion u =

More information

EXERCISES FOR SECTION 1.5

EXERCISES FOR SECTION 1.5 1.5 Exisence and Uniqueness of Soluions 43 20. 1 v c 21. 1 v c 1 2 4 6 8 10 1 2 2 4 6 8 10 Graph of approximae soluion obained using Euler s mehod wih = 0.1. Graph of approximae soluion obained using Euler

More information

T L. t=1. Proof of Lemma 1. Using the marginal cost accounting in Equation(4) and standard arguments. t )+Π RB. t )+K 1(Q RB

T L. t=1. Proof of Lemma 1. Using the marginal cost accounting in Equation(4) and standard arguments. t )+Π RB. t )+K 1(Q RB Elecronic Companion EC.1. Proofs of Technical Lemmas and Theorems LEMMA 1. Le C(RB) be he oal cos incurred by he RB policy. Then we have, T L E[C(RB)] 3 E[Z RB ]. (EC.1) Proof of Lemma 1. Using he marginal

More information

Stability and Bifurcation in a Neural Network Model with Two Delays

Stability and Bifurcation in a Neural Network Model with Two Delays Inernaional Mahemaical Forum, Vol. 6, 11, no. 35, 175-1731 Sabiliy and Bifurcaion in a Neural Nework Model wih Two Delays GuangPing Hu and XiaoLing Li School of Mahemaics and Physics, Nanjing Universiy

More information

Simulating models with heterogeneous agents

Simulating models with heterogeneous agents Simulaing models wih heerogeneous agens Wouer J. Den Haan London School of Economics c by Wouer J. Den Haan Individual agen Subjec o employmen shocks (ε i, {0, 1}) Incomplee markes only way o save is hrough

More information

The Arcsine Distribution

The Arcsine Distribution The Arcsine Disribuion Chris H. Rycrof Ocober 6, 006 A common heme of he class has been ha he saisics of single walker are ofen very differen from hose of an ensemble of walkers. On he firs homework, we

More information

Physics 235 Chapter 2. Chapter 2 Newtonian Mechanics Single Particle

Physics 235 Chapter 2. Chapter 2 Newtonian Mechanics Single Particle Chaper 2 Newonian Mechanics Single Paricle In his Chaper we will review wha Newon s laws of mechanics ell us abou he moion of a single paricle. Newon s laws are only valid in suiable reference frames,

More information

CHAPTER 12 DIRECT CURRENT CIRCUITS

CHAPTER 12 DIRECT CURRENT CIRCUITS CHAPTER 12 DIRECT CURRENT CIUITS DIRECT CURRENT CIUITS 257 12.1 RESISTORS IN SERIES AND IN PARALLEL When wo resisors are conneced ogeher as shown in Figure 12.1 we said ha hey are conneced in series. As

More information

Chapter 6. Systems of First Order Linear Differential Equations

Chapter 6. Systems of First Order Linear Differential Equations Chaper 6 Sysems of Firs Order Linear Differenial Equaions We will only discuss firs order sysems However higher order sysems may be made ino firs order sysems by a rick shown below We will have a sligh

More information

OPTIMAL CONTROL OF MCKEAN-VLASOV DYNAMICS

OPTIMAL CONTROL OF MCKEAN-VLASOV DYNAMICS OPTIMAL CONTROL OF MCKEAN-VLASOV DYNAMICS René Carmona Deparmen of Operaions Research & Financial Engineering Bendheim Cener for Finance Princeon Universiy CMU, June 3, 2015 Seve Shreve s 65h Birhday CREDITS

More information

Optimal Investment Strategy Insurance Company

Optimal Investment Strategy Insurance Company Opimal Invesmen Sraegy for a Non-Life Insurance Company Łukasz Delong Warsaw School of Economics Insiue of Economerics Division of Probabilisic Mehods Probabiliy space Ω I P F I I I he filraion saisfies

More information

AMartingaleApproachforFractionalBrownian Motions and Related Path Dependent PDEs

AMartingaleApproachforFractionalBrownian Motions and Related Path Dependent PDEs AMaringaleApproachforFracionalBrownian Moions and Relaed Pah Dependen PDEs Jianfeng ZHANG Universiy of Souhern California Join work wih Frederi VIENS Mahemaical Finance, Probabiliy, and PDE Conference

More information

Modeling Economic Time Series with Stochastic Linear Difference Equations

Modeling Economic Time Series with Stochastic Linear Difference Equations A. Thiemer, SLDG.mcd, 6..6 FH-Kiel Universiy of Applied Sciences Prof. Dr. Andreas Thiemer e-mail: andreas.hiemer@fh-kiel.de Modeling Economic Time Series wih Sochasic Linear Difference Equaions Summary:

More information

Utility maximization in incomplete markets

Utility maximization in incomplete markets Uiliy maximizaion in incomplee markes Marcel Ladkau 27.1.29 Conens 1 Inroducion and general seings 2 1.1 Marke model....................................... 2 1.2 Trading sraegy.....................................

More information

The Optimal Stopping Time for Selling an Asset When It Is Uncertain Whether the Price Process Is Increasing or Decreasing When the Horizon Is Infinite

The Optimal Stopping Time for Selling an Asset When It Is Uncertain Whether the Price Process Is Increasing or Decreasing When the Horizon Is Infinite American Journal of Operaions Research, 08, 8, 8-9 hp://wwwscirporg/journal/ajor ISSN Online: 60-8849 ISSN Prin: 60-8830 The Opimal Sopping Time for Selling an Asse When I Is Uncerain Wheher he Price Process

More information

Vehicle Arrival Models : Headway

Vehicle Arrival Models : Headway Chaper 12 Vehicle Arrival Models : Headway 12.1 Inroducion Modelling arrival of vehicle a secion of road is an imporan sep in raffic flow modelling. I has imporan applicaion in raffic flow simulaion where

More information

An Introduction to Malliavin calculus and its applications

An Introduction to Malliavin calculus and its applications An Inroducion o Malliavin calculus and is applicaions Lecure 5: Smoohness of he densiy and Hörmander s heorem David Nualar Deparmen of Mahemaics Kansas Universiy Universiy of Wyoming Summer School 214

More information

Introduction to Probability and Statistics Slides 4 Chapter 4

Introduction to Probability and Statistics Slides 4 Chapter 4 Inroducion o Probabiliy and Saisics Slides 4 Chaper 4 Ammar M. Sarhan, asarhan@mahsa.dal.ca Deparmen of Mahemaics and Saisics, Dalhousie Universiy Fall Semeser 8 Dr. Ammar Sarhan Chaper 4 Coninuous Random

More information

An introduction to the theory of SDDP algorithm

An introduction to the theory of SDDP algorithm An inroducion o he heory of SDDP algorihm V. Leclère (ENPC) Augus 1, 2014 V. Leclère Inroducion o SDDP Augus 1, 2014 1 / 21 Inroducion Large scale sochasic problem are hard o solve. Two ways of aacking

More information

Stochastic models and their distributions

Stochastic models and their distributions Sochasic models and heir disribuions Couning cusomers Suppose ha n cusomers arrive a a grocery a imes, say T 1,, T n, each of which akes any real number in he inerval (, ) equally likely The values T 1,,

More information

Online Appendix to Solution Methods for Models with Rare Disasters

Online Appendix to Solution Methods for Models with Rare Disasters Online Appendix o Soluion Mehods for Models wih Rare Disasers Jesús Fernández-Villaverde and Oren Levinal In his Online Appendix, we presen he Euler condiions of he model, we develop he pricing Calvo block,

More information

LECTURE 1: GENERALIZED RAY KNIGHT THEOREM FOR FINITE MARKOV CHAINS

LECTURE 1: GENERALIZED RAY KNIGHT THEOREM FOR FINITE MARKOV CHAINS LECTURE : GENERALIZED RAY KNIGHT THEOREM FOR FINITE MARKOV CHAINS We will work wih a coninuous ime reversible Markov chain X on a finie conneced sae space, wih generaor Lf(x = y q x,yf(y. (Recall ha q

More information

On a Fractional Stochastic Landau-Ginzburg Equation

On a Fractional Stochastic Landau-Ginzburg Equation Applied Mahemaical Sciences, Vol. 4, 1, no. 7, 317-35 On a Fracional Sochasic Landau-Ginzburg Equaion Nguyen Tien Dung Deparmen of Mahemaics, FPT Universiy 15B Pham Hung Sree, Hanoi, Vienam dungn@fp.edu.vn

More information

= ( ) ) or a system of differential equations with continuous parametrization (T = R

= ( ) ) or a system of differential equations with continuous parametrization (T = R XIII. DIFFERENCE AND DIFFERENTIAL EQUATIONS Ofen funcions, or a sysem of funcion, are paramerized in erms of some variable, usually denoed as and inerpreed as ime. The variable is wrien as a funcion of

More information

u(x) = e x 2 y + 2 ) Integrate and solve for x (1 + x)y + y = cos x Answer: Divide both sides by 1 + x and solve for y. y = x y + cos x

u(x) = e x 2 y + 2 ) Integrate and solve for x (1 + x)y + y = cos x Answer: Divide both sides by 1 + x and solve for y. y = x y + cos x . 1 Mah 211 Homework #3 February 2, 2001 2.4.3. y + (2/x)y = (cos x)/x 2 Answer: Compare y + (2/x) y = (cos x)/x 2 wih y = a(x)x + f(x)and noe ha a(x) = 2/x. Consequenly, an inegraing facor is found wih

More information

An random variable is a quantity that assumes different values with certain probabilities.

An random variable is a quantity that assumes different values with certain probabilities. Probabiliy The probabiliy PrA) of an even A is a number in [, ] ha represens how likely A is o occur. The larger he value of PrA), he more likely he even is o occur. PrA) means he even mus occur. PrA)

More information

R t. C t P t. + u t. C t = αp t + βr t + v t. + β + w t

R t. C t P t. + u t. C t = αp t + βr t + v t. + β + w t Exercise 7 C P = α + β R P + u C = αp + βr + v (a) (b) C R = α P R + β + w (c) Assumpions abou he disurbances u, v, w : Classical assumions on he disurbance of one of he equaions, eg. on (b): E(v v s P,

More information

Hamilton- J acobi Equation: Explicit Formulas In this lecture we try to apply the method of characteristics to the Hamilton-Jacobi equation: u t

Hamilton- J acobi Equation: Explicit Formulas In this lecture we try to apply the method of characteristics to the Hamilton-Jacobi equation: u t M ah 5 2 7 Fall 2 0 0 9 L ecure 1 0 O c. 7, 2 0 0 9 Hamilon- J acobi Equaion: Explici Formulas In his lecure we ry o apply he mehod of characerisics o he Hamilon-Jacobi equaion: u + H D u, x = 0 in R n

More information

Testing for a Single Factor Model in the Multivariate State Space Framework

Testing for a Single Factor Model in the Multivariate State Space Framework esing for a Single Facor Model in he Mulivariae Sae Space Framework Chen C.-Y. M. Chiba and M. Kobayashi Inernaional Graduae School of Social Sciences Yokohama Naional Universiy Japan Faculy of Economics

More information

THE MYSTERY OF STOCHASTIC MECHANICS. Edward Nelson Department of Mathematics Princeton University

THE MYSTERY OF STOCHASTIC MECHANICS. Edward Nelson Department of Mathematics Princeton University THE MYSTERY OF STOCHASTIC MECHANICS Edward Nelson Deparmen of Mahemaics Princeon Universiy 1 Classical Hamilon-Jacobi heory N paricles of various masses on a Euclidean space. Incorporae he masses in he

More information

Handout: Power Laws and Preferential Attachment

Handout: Power Laws and Preferential Attachment CS224W: Analysis of Neworks Fall 2017 Handou: Power Laws and Preferenial Aachmen 1 Preferenial Aachmen Empirical sudies of real world neworks revealed ha degree disribuion ofen follows a heavyailed disribuion,

More information

20. Applications of the Genetic-Drift Model

20. Applications of the Genetic-Drift Model 0. Applicaions of he Geneic-Drif Model 1) Deermining he probabiliy of forming any paricular combinaion of genoypes in he nex generaion: Example: If he parenal allele frequencies are p 0 = 0.35 and q 0

More information

Stochastic Model for Cancer Cell Growth through Single Forward Mutation

Stochastic Model for Cancer Cell Growth through Single Forward Mutation Journal of Modern Applied Saisical Mehods Volume 16 Issue 1 Aricle 31 5-1-2017 Sochasic Model for Cancer Cell Growh hrough Single Forward Muaion Jayabharahiraj Jayabalan Pondicherry Universiy, jayabharahi8@gmail.com

More information

Lecture 4: Processes with independent increments

Lecture 4: Processes with independent increments Lecure 4: Processes wih independen incremens 1. A Wienner process 1.1 Definiion of a Wienner process 1.2 Reflecion principle 1.3 Exponenial Brownian moion 1.4 Exchange of measure (Girsanov heorem) 1.5

More information

d 1 = c 1 b 2 - b 1 c 2 d 2 = c 1 b 3 - b 1 c 3

d 1 = c 1 b 2 - b 1 c 2 d 2 = c 1 b 3 - b 1 c 3 and d = c b - b c c d = c b - b c c This process is coninued unil he nh row has been compleed. The complee array of coefficiens is riangular. Noe ha in developing he array an enire row may be divided or

More information

k B 2 Radiofrequency pulses and hardware

k B 2 Radiofrequency pulses and hardware 1 Exra MR Problems DC Medical Imaging course April, 214 he problems below are harder, more ime-consuming, and inended for hose wih a more mahemaical background. hey are enirely opional, bu hopefully will

More information

Introduction D P. r = constant discount rate, g = Gordon Model (1962): constant dividend growth rate.

Introduction D P. r = constant discount rate, g = Gordon Model (1962): constant dividend growth rate. Inroducion Gordon Model (1962): D P = r g r = consan discoun rae, g = consan dividend growh rae. If raional expecaions of fuure discoun raes and dividend growh vary over ime, so should he D/P raio. Since

More information

Section 3.5 Nonhomogeneous Equations; Method of Undetermined Coefficients

Section 3.5 Nonhomogeneous Equations; Method of Undetermined Coefficients Secion 3.5 Nonhomogeneous Equaions; Mehod of Undeermined Coefficiens Key Terms/Ideas: Linear Differenial operaor Nonlinear operaor Second order homogeneous DE Second order nonhomogeneous DE Soluion o homogeneous

More information

8. Basic RL and RC Circuits

8. Basic RL and RC Circuits 8. Basic L and C Circuis This chaper deals wih he soluions of he responses of L and C circuis The analysis of C and L circuis leads o a linear differenial equaion This chaper covers he following opics

More information

BU Macro BU Macro Fall 2008, Lecture 4

BU Macro BU Macro Fall 2008, Lecture 4 Dynamic Programming BU Macro 2008 Lecure 4 1 Ouline 1. Cerainy opimizaion problem used o illusrae: a. Resricions on exogenous variables b. Value funcion c. Policy funcion d. The Bellman equaion and an

More information

Chapter 2. Models, Censoring, and Likelihood for Failure-Time Data

Chapter 2. Models, Censoring, and Likelihood for Failure-Time Data Chaper 2 Models, Censoring, and Likelihood for Failure-Time Daa William Q. Meeker and Luis A. Escobar Iowa Sae Universiy and Louisiana Sae Universiy Copyrigh 1998-2008 W. Q. Meeker and L. A. Escobar. Based

More information

6. Stochastic calculus with jump processes

6. Stochastic calculus with jump processes A) Trading sraegies (1/3) Marke wih d asses S = (S 1,, S d ) A rading sraegy can be modelled wih a vecor φ describing he quaniies invesed in each asse a each insan : φ = (φ 1,, φ d ) The value a of a porfolio

More information

7 The Itô/Stratonovich dilemma

7 The Itô/Stratonovich dilemma 7 The Iô/Sraonovich dilemma The dilemma: wha does he idealizaion of dela-funcion-correlaed noise mean? ẋ = f(x) + g(x)η() η()η( ) = κδ( ). (1) Previously, we argued by a limiing procedure: aking noise

More information

Algorithmic Trading: Optimal Control PIMS Summer School

Algorithmic Trading: Optimal Control PIMS Summer School Algorihmic Trading: Opimal Conrol PIMS Summer School Sebasian Jaimungal, U. Torono Álvaro Carea,U. Oxford many hanks o José Penalva,(U. Carlos III) Luhui Gan (U. Torono) Ryan Donnelly (Swiss Finance Insiue,

More information

CH Sean Han QF, NTHU, Taiwan BFS2010. (Joint work with T.-Y. Chen and W.-H. Liu)

CH Sean Han QF, NTHU, Taiwan BFS2010. (Joint work with T.-Y. Chen and W.-H. Liu) CH Sean Han QF, NTHU, Taiwan BFS2010 (Join work wih T.-Y. Chen and W.-H. Liu) Risk Managemen in Pracice: Value a Risk (VaR) / Condiional Value a Risk (CVaR) Volailiy Esimaion: Correced Fourier Transform

More information

Math 333 Problem Set #2 Solution 14 February 2003

Math 333 Problem Set #2 Solution 14 February 2003 Mah 333 Problem Se #2 Soluion 14 February 2003 A1. Solve he iniial value problem dy dx = x2 + e 3x ; 2y 4 y(0) = 1. Soluion: This is separable; we wrie 2y 4 dy = x 2 + e x dx and inegrae o ge The iniial

More information

Sophisticated Monetary Policies. Andrew Atkeson. V.V. Chari. Patrick Kehoe

Sophisticated Monetary Policies. Andrew Atkeson. V.V. Chari. Patrick Kehoe Sophisicaed Moneary Policies Andrew Akeson UCLA V.V. Chari Universiy of Minnesoa Parick Kehoe Federal Reserve Bank of Minneapolis and Universiy of Minnesoa Barro, Lucas-Sokey Approach o Policy Solve Ramsey

More information

Zürich. ETH Master Course: L Autonomous Mobile Robots Localization II

Zürich. ETH Master Course: L Autonomous Mobile Robots Localization II Roland Siegwar Margaria Chli Paul Furgale Marco Huer Marin Rufli Davide Scaramuzza ETH Maser Course: 151-0854-00L Auonomous Mobile Robos Localizaion II ACT and SEE For all do, (predicion updae / ACT),

More information

( ) a system of differential equations with continuous parametrization ( T = R + These look like, respectively:

( ) a system of differential equations with continuous parametrization ( T = R + These look like, respectively: XIII. DIFFERENCE AND DIFFERENTIAL EQUATIONS Ofen funcions, or a sysem of funcion, are paramerized in erms of some variable, usually denoed as and inerpreed as ime. The variable is wrien as a funcion of

More information

EE363 homework 1 solutions

EE363 homework 1 solutions EE363 Prof. S. Boyd EE363 homework 1 soluions 1. LQR for a riple accumulaor. We consider he sysem x +1 = Ax + Bu, y = Cx, wih 1 1 A = 1 1, B =, C = [ 1 ]. 1 1 This sysem has ransfer funcion H(z) = (z 1)

More information

4. The multiple use forestry maximum principle. This principle will be derived as in Heaps (1984) by considering perturbations

4. The multiple use forestry maximum principle. This principle will be derived as in Heaps (1984) by considering perturbations 4. The muliple use foresry maximum principle This principle will be derived as in Heaps (1984) by considering perurbaions H(; ) of a logging plan H() in A where H(; 0) = H() and H(; ) A is di ereniable

More information

Simulation-Solving Dynamic Models ABE 5646 Week 2, Spring 2010

Simulation-Solving Dynamic Models ABE 5646 Week 2, Spring 2010 Simulaion-Solving Dynamic Models ABE 5646 Week 2, Spring 2010 Week Descripion Reading Maerial 2 Compuer Simulaion of Dynamic Models Finie Difference, coninuous saes, discree ime Simple Mehods Euler Trapezoid

More information

L07. KALMAN FILTERING FOR NON-LINEAR SYSTEMS. NA568 Mobile Robotics: Methods & Algorithms

L07. KALMAN FILTERING FOR NON-LINEAR SYSTEMS. NA568 Mobile Robotics: Methods & Algorithms L07. KALMAN FILTERING FOR NON-LINEAR SYSTEMS NA568 Mobile Roboics: Mehods & Algorihms Today s Topic Quick review on (Linear) Kalman Filer Kalman Filering for Non-Linear Sysems Exended Kalman Filer (EKF)

More information

SZG Macro 2011 Lecture 3: Dynamic Programming. SZG macro 2011 lecture 3 1

SZG Macro 2011 Lecture 3: Dynamic Programming. SZG macro 2011 lecture 3 1 SZG Macro 2011 Lecure 3: Dynamic Programming SZG macro 2011 lecure 3 1 Background Our previous discussion of opimal consumpion over ime and of opimal capial accumulaion sugges sudying he general decision

More information

Homework 10 (Stats 620, Winter 2017) Due Tuesday April 18, in class Questions are derived from problems in Stochastic Processes by S. Ross.

Homework 10 (Stats 620, Winter 2017) Due Tuesday April 18, in class Questions are derived from problems in Stochastic Processes by S. Ross. Homework (Sas 6, Winer 7 Due Tuesday April 8, in class Quesions are derived from problems in Sochasic Processes by S. Ross.. A sochasic process {X(, } is said o be saionary if X(,..., X( n has he same

More information

Transform Techniques. Moment Generating Function

Transform Techniques. Moment Generating Function Transform Techniques A convenien way of finding he momens of a random variable is he momen generaing funcion (MGF). Oher ransform echniques are characerisic funcion, z-ransform, and Laplace ransform. Momen

More information

dy dx = xey (a) y(0) = 2 (b) y(1) = 2.5 SOLUTION: See next page

dy dx = xey (a) y(0) = 2 (b) y(1) = 2.5 SOLUTION: See next page Assignmen 1 MATH 2270 SOLUTION Please wrie ou complee soluions for each of he following 6 problems (one more will sill be added). You may, of course, consul wih your classmaes, he exbook or oher resources,

More information

Math 36. Rumbos Spring Solutions to Assignment #6. 1. Suppose the growth of a population is governed by the differential equation.

Math 36. Rumbos Spring Solutions to Assignment #6. 1. Suppose the growth of a population is governed by the differential equation. Mah 36. Rumbos Spring 1 1 Soluions o Assignmen #6 1. Suppose he growh of a populaion is governed by he differenial equaion where k is a posiive consan. d d = k (a Explain why his model predics ha he populaion

More information

Appendix to Creating Work Breaks From Available Idleness

Appendix to Creating Work Breaks From Available Idleness Appendix o Creaing Work Breaks From Available Idleness Xu Sun and Ward Whi Deparmen of Indusrial Engineering and Operaions Research, Columbia Universiy, New York, NY, 127; {xs2235,ww24}@columbia.edu Sepember

More information

Some Basic Information about M-S-D Systems

Some Basic Information about M-S-D Systems Some Basic Informaion abou M-S-D Sysems 1 Inroducion We wan o give some summary of he facs concerning unforced (homogeneous) and forced (non-homogeneous) models for linear oscillaors governed by second-order,

More information

Diebold, Chapter 7. Francis X. Diebold, Elements of Forecasting, 4th Edition (Mason, Ohio: Cengage Learning, 2006). Chapter 7. Characterizing Cycles

Diebold, Chapter 7. Francis X. Diebold, Elements of Forecasting, 4th Edition (Mason, Ohio: Cengage Learning, 2006). Chapter 7. Characterizing Cycles Diebold, Chaper 7 Francis X. Diebold, Elemens of Forecasing, 4h Ediion (Mason, Ohio: Cengage Learning, 006). Chaper 7. Characerizing Cycles Afer compleing his reading you should be able o: Define covariance

More information

Singular perturbation control problems: a BSDE approach

Singular perturbation control problems: a BSDE approach Singular perurbaion conrol problems: a BSDE approach Join work wih Francois Delarue Universié de Nice and Giuseppina Guaeri Poliecnico di Milano Le Mans 8h of Ocober 215 Conference in honour of Vlad Bally

More information

Representation of Stochastic Process by Means of Stochastic Integrals

Representation of Stochastic Process by Means of Stochastic Integrals Inernaional Journal of Mahemaics Research. ISSN 0976-5840 Volume 5, Number 4 (2013), pp. 385-397 Inernaional Research Publicaion House hp://www.irphouse.com Represenaion of Sochasic Process by Means of

More information

Class Meeting # 10: Introduction to the Wave Equation

Class Meeting # 10: Introduction to the Wave Equation MATH 8.5 COURSE NOTES - CLASS MEETING # 0 8.5 Inroducion o PDEs, Fall 0 Professor: Jared Speck Class Meeing # 0: Inroducion o he Wave Equaion. Wha is he wave equaion? The sandard wave equaion for a funcion

More information

From Particles to Rigid Bodies

From Particles to Rigid Bodies Rigid Body Dynamics From Paricles o Rigid Bodies Paricles No roaions Linear velociy v only Rigid bodies Body roaions Linear velociy v Angular velociy ω Rigid Bodies Rigid bodies have boh a posiion and

More information

Continuous Time. Time-Domain System Analysis. Impulse Response. Impulse Response. Impulse Response. Impulse Response. ( t) + b 0.

Continuous Time. Time-Domain System Analysis. Impulse Response. Impulse Response. Impulse Response. Impulse Response. ( t) + b 0. Time-Domain Sysem Analysis Coninuous Time. J. Robers - All Righs Reserved. Edied by Dr. Rober Akl 1. J. Robers - All Righs Reserved. Edied by Dr. Rober Akl 2 Le a sysem be described by a 2 y ( ) + a 1

More information

Most Probable Phase Portraits of Stochastic Differential Equations and Its Numerical Simulation

Most Probable Phase Portraits of Stochastic Differential Equations and Its Numerical Simulation Mos Probable Phase Porrais of Sochasic Differenial Equaions and Is Numerical Simulaion Bing Yang, Zhu Zeng and Ling Wang 3 School of Mahemaics and Saisics, Huazhong Universiy of Science and Technology,

More information

Lecture 4 Kinetics of a particle Part 3: Impulse and Momentum

Lecture 4 Kinetics of a particle Part 3: Impulse and Momentum MEE Engineering Mechanics II Lecure 4 Lecure 4 Kineics of a paricle Par 3: Impulse and Momenum Linear impulse and momenum Saring from he equaion of moion for a paricle of mass m which is subjeced o an

More information

System of Linear Differential Equations

System of Linear Differential Equations Sysem of Linear Differenial Equaions In "Ordinary Differenial Equaions" we've learned how o solve a differenial equaion for a variable, such as: y'k5$e K2$x =0 solve DE yx = K 5 2 ek2 x C_C1 2$y''C7$y

More information

A Dynamic Model of Economic Fluctuations

A Dynamic Model of Economic Fluctuations CHAPTER 15 A Dynamic Model of Economic Flucuaions Modified for ECON 2204 by Bob Murphy 2016 Worh Publishers, all righs reserved IN THIS CHAPTER, OU WILL LEARN: how o incorporae dynamics ino he AD-AS model

More information

2. Nonlinear Conservation Law Equations

2. Nonlinear Conservation Law Equations . Nonlinear Conservaion Law Equaions One of he clear lessons learned over recen years in sudying nonlinear parial differenial equaions is ha i is generally no wise o ry o aack a general class of nonlinear

More information

Notes on Kalman Filtering

Notes on Kalman Filtering Noes on Kalman Filering Brian Borchers and Rick Aser November 7, Inroducion Daa Assimilaion is he problem of merging model predicions wih acual measuremens of a sysem o produce an opimal esimae of he curren

More information

Problem Set on Differential Equations

Problem Set on Differential Equations Problem Se on Differenial Equaions 1. Solve he following differenial equaions (a) x () = e x (), x () = 3/ 4. (b) x () = e x (), x (1) =. (c) xe () = + (1 x ()) e, x () =.. (An asse marke model). Le p()

More information

ODEs II, Lecture 1: Homogeneous Linear Systems - I. Mike Raugh 1. March 8, 2004

ODEs II, Lecture 1: Homogeneous Linear Systems - I. Mike Raugh 1. March 8, 2004 ODEs II, Lecure : Homogeneous Linear Sysems - I Mike Raugh March 8, 4 Inroducion. In he firs lecure we discussed a sysem of linear ODEs for modeling he excreion of lead from he human body, saw how o ransform

More information

Simulation of BSDEs and. Wiener Chaos Expansions

Simulation of BSDEs and. Wiener Chaos Expansions Simulaion of BSDEs and Wiener Chaos Expansions Philippe Briand Céline Labar LAMA UMR 5127, Universié de Savoie, France hp://www.lama.univ-savoie.fr/ Workshop on BSDEs Rennes, May 22-24, 213 Inroducion

More information

Lecture Notes 3: Quantitative Analysis in DSGE Models: New Keynesian Model

Lecture Notes 3: Quantitative Analysis in DSGE Models: New Keynesian Model Lecure Noes 3: Quaniaive Analysis in DSGE Models: New Keynesian Model Zhiwei Xu, Email: xuzhiwei@sju.edu.cn The moneary policy plays lile role in he basic moneary model wihou price sickiness. We now urn

More information

Economics 8105 Macroeconomic Theory Recitation 6

Economics 8105 Macroeconomic Theory Recitation 6 Economics 8105 Macroeconomic Theory Reciaion 6 Conor Ryan Ocober 11h, 2016 Ouline: Opimal Taxaion wih Governmen Invesmen 1 Governmen Expendiure in Producion In hese noes we will examine a model in which

More information

Unit Root Time Series. Univariate random walk

Unit Root Time Series. Univariate random walk Uni Roo ime Series Univariae random walk Consider he regression y y where ~ iid N 0, he leas squares esimae of is: ˆ yy y y yy Now wha if = If y y hen le y 0 =0 so ha y j j If ~ iid N 0, hen y ~ N 0, he

More information

Failure of the work-hamiltonian connection for free energy calculations. Abstract

Failure of the work-hamiltonian connection for free energy calculations. Abstract Failure of he work-hamilonian connecion for free energy calculaions Jose M. G. Vilar 1 and J. Miguel Rubi 1 Compuaional Biology Program, Memorial Sloan-Keering Cancer Cener, 175 York Avenue, New York,

More information

10. State Space Methods

10. State Space Methods . Sae Space Mehods. Inroducion Sae space modelling was briefly inroduced in chaper. Here more coverage is provided of sae space mehods before some of heir uses in conrol sysem design are covered in he

More information

Final Spring 2007

Final Spring 2007 .615 Final Spring 7 Overview The purpose of he final exam is o calculae he MHD β limi in a high-bea oroidal okamak agains he dangerous n = 1 exernal ballooning-kink mode. Effecively, his corresponds o

More information

RANDOM LAGRANGE MULTIPLIERS AND TRANSVERSALITY

RANDOM LAGRANGE MULTIPLIERS AND TRANSVERSALITY ECO 504 Spring 2006 Chris Sims RANDOM LAGRANGE MULTIPLIERS AND TRANSVERSALITY 1. INTRODUCTION Lagrange muliplier mehods are sandard fare in elemenary calculus courses, and hey play a cenral role in economic

More information