Mean Field Games on networks
|
|
- Jasmine Anis Davidson
- 5 years ago
- Views:
Transcription
1 Mean Field Games on networks Claudio Marchi Università di Padova joint works with: S. Cacace (Rome) and F. Camilli (Rome) C. Marchi (Univ. of Padova) Mean Field Games on networks Roma, June 14 th, / 35
2 Outline Brief introduction Definition of networks Formal derivation of the MFG system on networks Study of the MFG system on networks A numerical scheme C. Marchi (Univ. of Padova) Mean Field Games on networks Roma, June 14 th, / 35
3 Model example on the torus T n [Lasry-Lions, 06] Consider a game with N rational and indistinguishable players. The i-th player s dynamics is dx i t = α i tdt + 2νdW i t, X i 0 = x i T n where ν > 0, W i are independent Brownian motions and α i is the control chosen so to minimize the cost functional 1 T lim inf T + T E x L(X i s, αs) i + V 1 δ j N 1 X ds s. 0 The Nash equilibria are characterized by a system of 2N equations. As N +, this system reduces to the following one: j i C. Marchi (Univ. of Padova) Mean Field Games on networks Roma, June 14 th, / 35
4 (MFG-T n ) ν u + H(x, Du) + ρ = V ([m]) in T n ( ) ν m + div m H p (x, Du) = 0 in T n T m dx = 1, m > 0 n T u dx = 0 n H(x, p) := sup q R n{ p q L(x, q)}; [m] means that V depends on m in a local or in a nonlocal way. Theorem [Lasry-Lions 06] There exists a smooth solution (u, m, ρ) to the above problem; Assume either V is strictly monotone in m (i.e. (V ([m T n 1 ]) V ([m 2 ])) (m 1 m 2 )dx 0 implies m 1 = m 2 ) or V is monotone in m (i.e. (V ([m T n 1 ]) V ([m 2 ]))(m 1 m 2 )dx 0) and H is strictly convex in p. Then the solution is unique. C. Marchi (Univ. of Padova) Mean Field Games on networks Roma, June 14 th, / 35
5 Basic References for MFG theory: Lasry-Lions, C.R. Math. Acad. Sci. Paris 343 (2006), Lasry-Lions, C.R. Math. Acad. Sci. Paris 343 (2006), Lasry-Lions, Jpn. J. Math. 2 (2007), Huang-Malhamé-Caines, Commun. Inf. Syst. 6 (2006), Lions course at College de France and Cardaliaguet, Notes on MFG (from Lions lectures at College de France), cardalia/ Achdou-Capuzzo Dolcetta, SIAM J. Num. Anal. 48 (2010), Achdou-Camilli-Capuzzo Dolcetta, SIAM J. Num. Anal. 51 (2013), MFG on graphs (i.e., agents have a finite number of states) Discrete time, finite state space: Gomes-Mohr-Souza, J. Math. Pures Appl. 93 (2010), Continuous time, finite state space: Gomes-Mohr-Souza, Appl. Math. Optim., 68 (2013), Guéant, Appl. Math. Optim. 72 (2015), C. Marchi (Univ. of Padova) Mean Field Games on networks Roma, June 14 th, / 35
6 Network A network is a connected set Γ consisting of vertices V := {v i } i I and edges E := {e j } j J connecting the vertices. We assume that the network is embedded in the Euclidian space R n and that any two edges can only have intersection at a vertex. (a) An example of network C. Marchi (Univ. of Padova) Mean Field Games on networks Roma, June 14 th, / 35
7 Some Notations Inc i := {j J : e j incident to v i } is the set of edges incident to the vertex v i. A vertex v i is a transition vertex if it has more than one incident edge. We denote by Γ T = {v i, i I T } the set of transition vertices. A vertex v i is a boundary vertex if it has only one incident edge. For simplicity, we assume that the set of boundary vertices is empty. Any edge e j is parametrized by a smooth function π j : [0, l j ] R n. For a function u : Γ R we denote by u j : [0, l j ] R its restriction to e j, i.e. u(x) = u j (y) for x e j, y = π 1 j (x). The derivative are considered w.r.t. the parametrization. The oriented derivative of a function u at a transition vertex v i is { limh 0 +(u j u(v i ) := j (h) u j (0))/h, if v i = π j (0) lim h 0 +(u j (l j h) u j (l j ))/h, if v i = π j (l j ). C. Marchi (Univ. of Padova) Mean Field Games on networks Roma, June 14 th, / 35
8 Some Notations Inc i := {j J : e j incident to v i } is the set of edges incident to the vertex v i. A vertex v i is a transition vertex if it has more than one incident edge. We denote by Γ T = {v i, i I T } the set of transition vertices. A vertex v i is a boundary vertex if it has only one incident edge. For simplicity, we assume that the set of boundary vertices is empty. Any edge e j is parametrized by a smooth function π j : [0, l j ] R n. For a function u : Γ R we denote by u j : [0, l j ] R its restriction to e j, i.e. u(x) = u j (y) for x e j, y = π 1 j (x). The derivative are considered w.r.t. the parametrization. The oriented derivative of a function u at a transition vertex v i is { limh 0 +(u j u(v i ) := j (h) u j (0))/h, if v i = π j (0) lim h 0 +(u j (l j h) u j (l j ))/h, if v i = π j (l j ). C. Marchi (Univ. of Padova) Mean Field Games on networks Roma, June 14 th, / 35
9 Some Notations Inc i := {j J : e j incident to v i } is the set of edges incident to the vertex v i. A vertex v i is a transition vertex if it has more than one incident edge. We denote by Γ T = {v i, i I T } the set of transition vertices. A vertex v i is a boundary vertex if it has only one incident edge. For simplicity, we assume that the set of boundary vertices is empty. Any edge e j is parametrized by a smooth function π j : [0, l j ] R n. For a function u : Γ R we denote by u j : [0, l j ] R its restriction to e j, i.e. u(x) = u j (y) for x e j, y = π 1 j (x). The derivative are considered w.r.t. the parametrization. The oriented derivative of a function u at a transition vertex v i is { limh 0 +(u j u(v i ) := j (h) u j (0))/h, if v i = π j (0) lim h 0 +(u j (l j h) u j (l j ))/h, if v i = π j (l j ). C. Marchi (Univ. of Padova) Mean Field Games on networks Roma, June 14 th, / 35
10 Some Notations Inc i := {j J : e j incident to v i } is the set of edges incident to the vertex v i. A vertex v i is a transition vertex if it has more than one incident edge. We denote by Γ T = {v i, i I T } the set of transition vertices. A vertex v i is a boundary vertex if it has only one incident edge. For simplicity, we assume that the set of boundary vertices is empty. Any edge e j is parametrized by a smooth function π j : [0, l j ] R n. For a function u : Γ R we denote by u j : [0, l j ] R its restriction to e j, i.e. u(x) = u j (y) for x e j, y = π 1 j (x). The derivative are considered w.r.t. the parametrization. The oriented derivative of a function u at a transition vertex v i is { limh 0 +(u j u(v i ) := j (h) u j (0))/h, if v i = π j (0) lim h 0 +(u j (l j h) u j (l j ))/h, if v i = π j (l j ). C. Marchi (Univ. of Padova) Mean Field Games on networks Roma, June 14 th, / 35
11 Some functional spaces u C q,α (Γ), for q N and α (0, 1], when u C 0 (Γ) and u j C q,α ([0, l j ]) for each j J. We set u (q+α) Γ = max u j (q+α) j J [0,l j ]. u L p (Γ), p 1 if u j L p (0, l j ) for each j J. We set u L p = ( j J u j p L p (e j ) )1/p. u W k,p (Γ), for k N, k 1 and p 1 if u C 0 (Γ) and u j W k,p (0, l j ) for each j J. We set u W k,p = ( j J u j p W k,p (e j ) )1/p. C. Marchi (Univ. of Padova) Mean Field Games on networks Roma, June 14 th, / 35
12 Formal derivation of MFG systems on networks Dynamics of a generic player. Inside each edge e j, the dynamics of a generic player is dx t = α t dt + 2ν j dw t where α is the control, ν j > 0 and W is an independent Brownian motions. At any internal vertex v i, the player spends zero time a.s. at v i and it enters in one of the incident edges, say e j, with probability β ij with β ij > 0, j Inc i β ij = 1. C. Marchi (Univ. of Padova) Mean Field Games on networks Roma, June 14 th, / 35
13 Formal derivation of MFG systems on networks Dynamics of a generic player. Inside each edge e j, the dynamics of a generic player is dx t = α t dt + 2ν j dw t where α is the control, ν j > 0 and W is an independent Brownian motions. At any internal vertex v i, the player spends zero time a.s. at v i and it enters in one of the incident edges, say e j, with probability β ij with β ij > 0, j Inc i β ij = 1. C. Marchi (Univ. of Padova) Mean Field Games on networks Roma, June 14 th, / 35
14 Discussion on the transition condition: probabilistic approach We consider the uncontrolled case. Fix a vertex v i. Rigorous definition of enters in one of the incident edges... For δ > 0, consider θ δ := inf{t > 0 dist(x t, v i ) = δ}. Then, lim P{X δ 0 + θ δ e j } = β ij. Fattening interpretation. Let M ε be the set in R n obtained enlarging each edge e j by a ball of radius εβ ij. One can obtain these dynamics as the limit as ε 0 + of a Brownian motion in M ε with normal reflection at the boundary. Itô s formula still holds true. See: [Freidlin-Wentzell, Ann. Prob. 93], [Freidlin-Sheu, PTRF 00]. C. Marchi (Univ. of Padova) Mean Field Games on networks Roma, June 14 th, / 35
15 Discussion on the transition condition: probabilistic approach We consider the uncontrolled case. Fix a vertex v i. Rigorous definition of enters in one of the incident edges... For δ > 0, consider θ δ := inf{t > 0 dist(x t, v i ) = δ}. Then, lim P{X δ 0 + θ δ e j } = β ij. Fattening interpretation. Let M ε be the set in R n obtained enlarging each edge e j by a ball of radius εβ ij. One can obtain these dynamics as the limit as ε 0 + of a Brownian motion in M ε with normal reflection at the boundary. Itô s formula still holds true. See: [Freidlin-Wentzell, Ann. Prob. 93], [Freidlin-Sheu, PTRF 00]. C. Marchi (Univ. of Padova) Mean Field Games on networks Roma, June 14 th, / 35
16 Discussion on the transition condition: probabilistic approach We consider the uncontrolled case. Fix a vertex v i. Rigorous definition of enters in one of the incident edges... For δ > 0, consider θ δ := inf{t > 0 dist(x t, v i ) = δ}. Then, lim P{X δ 0 + θ δ e j } = β ij. Fattening interpretation. Let M ε be the set in R n obtained enlarging each edge e j by a ball of radius εβ ij. One can obtain these dynamics as the limit as ε 0 + of a Brownian motion in M ε with normal reflection at the boundary. Itô s formula still holds true. See: [Freidlin-Wentzell, Ann. Prob. 93], [Freidlin-Sheu, PTRF 00]. C. Marchi (Univ. of Padova) Mean Field Games on networks Roma, June 14 th, / 35
17 Discussion on the transition condition: probabilistic approach We consider the uncontrolled case. Fix a vertex v i. Rigorous definition of enters in one of the incident edges... For δ > 0, consider θ δ := inf{t > 0 dist(x t, v i ) = δ}. Then, lim P{X δ 0 + θ δ e j } = β ij. Fattening interpretation. Let M ε be the set in R n obtained enlarging each edge e j by a ball of radius εβ ij. One can obtain these dynamics as the limit as ε 0 + of a Brownian motion in M ε with normal reflection at the boundary. Itô s formula still holds true. See: [Freidlin-Wentzell, Ann. Prob. 93], [Freidlin-Sheu, PTRF 00]. C. Marchi (Univ. of Padova) Mean Field Games on networks Roma, June 14 th, / 35
18 Discussion on the transition condition: analytical approach Consider the operator A defined on C 0 (Γ), defined for x e j by with domain d 2 u A j u := ν j (y) + ᾱdu dy 2 dy (y), D(A) := { u C 2 (Γ) y = π 1 (x) j Inc i β ij j u(v i ) = 0 }{{} (weighted) Kirchhoff condition A generates on Γ the Markov process X t described before. A fulfills the Maximum Principle. Fattening interpretation. The solution of Au = 0 is the lim ε 0 + of u ε, solution of a similar problem in M ε with uε n = 0 on M ε. See: [Freidlin-Wentzell, Ann. Prob. 93], [Below-Nicaise, CPDE 96].In [Lions course, 17]: fattening interpretation for some controlled cases. C. Marchi (Univ. of Padova) Mean Field Games on networks Roma, June 14 th, / 35 }.
19 Discussion on the transition condition: analytical approach Consider the operator A defined on C 0 (Γ), defined for x e j by with domain d 2 u A j u := ν j (y) + ᾱdu dy 2 dy (y), D(A) := { u C 2 (Γ) y = π 1 (x) j Inc i β ij j u(v i ) = 0 }{{} (weighted) Kirchhoff condition A generates on Γ the Markov process X t described before. A fulfills the Maximum Principle. Fattening interpretation. The solution of Au = 0 is the lim ε 0 + of u ε, solution of a similar problem in M ε with uε n = 0 on M ε. See: [Freidlin-Wentzell, Ann. Prob. 93], [Below-Nicaise, CPDE 96].In [Lions course, 17]: fattening interpretation for some controlled cases. C. Marchi (Univ. of Padova) Mean Field Games on networks Roma, June 14 th, / 35 }.
20 Discussion on the transition condition: analytical approach Consider the operator A defined on C 0 (Γ), defined for x e j by with domain d 2 u A j u := ν j (y) + ᾱdu dy 2 dy (y), D(A) := { u C 2 (Γ) y = π 1 (x) j Inc i β ij j u(v i ) = 0 }{{} (weighted) Kirchhoff condition A generates on Γ the Markov process X t described before. A fulfills the Maximum Principle. Fattening interpretation. The solution of Au = 0 is the lim ε 0 + of u ε, solution of a similar problem in M ε with uε n = 0 on M ε. See: [Freidlin-Wentzell, Ann. Prob. 93], [Below-Nicaise, CPDE 96].In [Lions course, 17]: fattening interpretation for some controlled cases. C. Marchi (Univ. of Padova) Mean Field Games on networks Roma, June 14 th, / 35 }.
21 Discussion on the transition condition: analytical approach Consider the operator A defined on C 0 (Γ), defined for x e j by with domain d 2 u A j u := ν j (y) + ᾱdu dy 2 dy (y), D(A) := { u C 2 (Γ) y = π 1 (x) j Inc i β ij j u(v i ) = 0 }{{} (weighted) Kirchhoff condition A generates on Γ the Markov process X t described before. A fulfills the Maximum Principle. Fattening interpretation. The solution of Au = 0 is the lim ε 0 + of u ε, solution of a similar problem in M ε with uε n = 0 on M ε. See: [Freidlin-Wentzell, Ann. Prob. 93], [Below-Nicaise, CPDE 96].In [Lions course, 17]: fattening interpretation for some controlled cases. C. Marchi (Univ. of Padova) Mean Field Games on networks Roma, June 14 th, / 35 }.
22 Formal derivation of the MFG system on the network We formally derive the MFG system on the network: the HJB equation is obtained through the dynamic programming principle while the FP equation is obtained as adjoint of the linearized HJB one. Hence, the HJB equation is ν j 2 u + H j (x, u) + ρ = V [m] x e j, j J j Inc i β ij j u(v i ) = 0 i I T u j (v i ) = u k (v i ) j, k Inc i. The linearized equation is ν j 2 w + p H j (x, u) w = 0 x e j, j J j Inc i β ij j w(v i ) = 0 i I T w j (v i ) = w k (v i ) j, k Inc i. C. Marchi (Univ. of Padova) Mean Field Games on networks Roma, June 14 th, / 35
23 Writing the weak formulation for a test function m, we get 0 = ( νj 2 w + p H j (x, u) w ) m dx j J e j = [ νj 2 m (m p H j (x, u)) ] w dx j J e j + ( νj j m(v i ) + p H(v i, u)m j (v i ) ) w(v i ) i I T i I T j Inc i j Inc i ν j m j (v i ) j w(v i ) }{{} =0 if m j (v i )ν j β ij By the integral term, we obtain = m k (v i )ν k β ik ν j 2 m + (m p H j (x, u)) = 0 x e j, j J.. C. Marchi (Univ. of Padova) Mean Field Games on networks Roma, June 14 th, / 35
24 The MFG system on a network Assume ν j β ij (MFG Γ ) = ν k β ik j, k Inc i, i I T. The MFG systems is ν 2 u + H(x, u) + ρ = V (m) ν 2 m + (m p H(x, u)) = 0 ν j j u(v i ) = 0 j Inc i [ν j j m(v i ) + p H j (v i, j u)m j (v i )]=0 j Inc i u j (v i ) = u k (v i ) m j (v i ) = m k (v i ) u(x)dx = 0 Γ m(x)dx = 1, m 0. Γ x Γ x Γ i I T i I T j, k Inc i, i I T j, k Inc i, i I T C. Marchi (Univ. of Padova) Mean Field Games on networks Roma, June 14 th, / 35
25 The MFG system on a network Assume ν j β ij (MFG Γ ) = ν k β ik j, k Inc i, i I T. The MFG systems is ν 2 u + H(x, u) + ρ = V (m) ν 2 m + (m p H(x, u)) = 0 ν j j u(v i ) = 0 j Inc i [ν j j m(v i ) + p H j (v i, j u)m j (v i )]=0 j Inc i u j (v i ) = u k (v i ) m j (v i ) = m k (v i ) u(x)dx = 0 Γ m(x)dx = 1, m 0. Γ x Γ x Γ i I T i I T j, k Inc i, i I T j, k Inc i, i I T C. Marchi (Univ. of Padova) Mean Field Games on networks Roma, June 14 th, / 35
26 The MFG system on a network Assume ν j β ij (MFG Γ ) = ν k β ik j, k Inc i, i I T. The MFG systems is ν 2 u + H(x, u) + ρ = V (m) ν 2 m + (m p H(x, u)) = 0 ν j j u(v i ) = 0 j Inc i [ν j j m(v i ) + p H j (v i, j u)m j (v i )]=0 j Inc i u j (v i ) = u k (v i ) m j (v i ) = m k (v i ) u(x)dx = 0 Γ m(x)dx = 1, m 0. Γ x Γ x Γ i I T i I T j, k Inc i, i I T j, k Inc i, i I T C. Marchi (Univ. of Padova) Mean Field Games on networks Roma, June 14 th, / 35
27 The MFG system on a network Assume ν j β ij (MFG Γ ) = ν k β ik j, k Inc i, i I T. The MFG systems is ν 2 u + H(x, u) + ρ = V (m) ν 2 m + (m p H(x, u)) = 0 ν j j u(v i ) = 0 j Inc i [ν j j m(v i ) + p H j (v i, j u)m j (v i )]=0 j Inc i u j (v i ) = u k (v i ) m j (v i ) = m k (v i ) u(x)dx = 0 Γ m(x)dx = 1, m 0. Γ x Γ x Γ i I T i I T j, k Inc i, i I T j, k Inc i, i I T C. Marchi (Univ. of Padova) Mean Field Games on networks Roma, June 14 th, / 35
28 The MFG system on a network Assume ν j β ij (MFG Γ ) = ν k β ik j, k Inc i, i I T. The MFG systems is ν 2 u + H(x, u) + ρ = V (m) ν 2 m + (m p H(x, u)) = 0 ν j j u(v i ) = 0 j Inc i [ν j j m(v i ) + p H j (v i, j u)m j (v i )]=0 j Inc i u j (v i ) = u k (v i ) m j (v i ) = m k (v i ) u(x)dx = 0 Γ m(x)dx = 1, m 0. Γ x Γ x Γ i I T i I T j, k Inc i, i I T j, k Inc i, i I T C. Marchi (Univ. of Padova) Mean Field Games on networks Roma, June 14 th, / 35
29 The MFG systems on networks Theorem (Camilli-M., SJCO 16) We assume H j C 2 (e j R), convex, with δ p 2 C H j (x, p) δ p 2 + C, ν j > 0, V C 1 ([0, + )). Then, there exists a solution (u, m, ρ) C 2 (Γ) C 2 (Γ) R to (MFG Γ ). Moreover, assume either V is strictly monotone in m or V is monotone in m and H is strictly convex in p. Then the solution is unique. C. Marchi (Univ. of Padova) Mean Field Games on networks Roma, June 14 th, / 35
30 The MFG systems on networks Theorem (Camilli-M., SJCO 16) We assume H j C 2 (e j R), convex, with δ p 2 C H j (x, p) δ p 2 + C, ν j > 0, V C 1 ([0, + )). Then, there exists a solution (u, m, ρ) C 2 (Γ) C 2 (Γ) R to (MFG Γ ). Moreover, assume either V is strictly monotone in m or V is monotone in m and H is strictly convex in p. Then the solution is unique. C. Marchi (Univ. of Padova) Mean Field Games on networks Roma, June 14 th, / 35
31 Step 1: On the HJB equation. Sketch of the proof For f C 0,α (Γ),!(u, ρ) C 2 (Γ) R solution to (HJB) ν 2 u + H(x, u) + ρ = f (x), x Γ j Inc i ν j j u(v i ) = 0 i I T u j (v i ) = u k (v i ) j, k Inc i, i I T Γ u(x) = 0. Moreover u C 2,α (Γ) and: u C 2,α (Γ) C, ρ max Γ H(, 0) f ( ). The proof is based on u λ W 1,2 (Γ), weak solution to the discounted approximation ν 2 u λ + H(x, u λ ) + λu λ = f (x) x Γ as in [Boccardo-Murat-Puel, 83]; the Comparison Principle applies; u λ C 2,α (Γ) by the 1-d of the problem and Sobolev theorem; as λ 0 +, λu λ ρ and (u λ min u λ ) u. C. Marchi (Univ. of Padova) Mean Field Games on networks Roma, June 14 th, / 35
32 Step 2: On the FP equation. For b C 1 (Γ), there exists a unique weak solution m W 1,2 (Γ) to (FP) ν 2 m + (b(x) m) = 0 x Γ j Inc i [b(v i )m j (v i ) + ν j j m(v i )] = 0 i I T m j (v i ) = m k (v i ) j, k Inc i, i I T m 0, m(x)dx = 1. Γ Moreover, m is a classical solution with m H 1 C, 0 < m(x) C (for some C > 0 depending only on b and ν). The proof is based on the existence of a weak solution is based on the theory of bilinear forms; the adjoint problem (both equation and transition condition) fulfills the Maximum Principle; m C 2 (Γ) by the 1-d of the problem and Sobolev theorem. C. Marchi (Univ. of Padova) Mean Field Games on networks Roma, June 14 th, / 35
33 Step 3: Fixed point argument. We set K := {µ C 0,α (Γ) : µ 0, Γ µdx = 1} and we define an operator T : K K according to the scheme as follows: µ u m given µ K, solve (HJB) with f (x) = V (µ(x)) for the unknowns u = u µ and ρ, which are uniquely defined by Step 1; given u µ, solve (FP) with b(x) = p H(x, u µ ) for the unknown m which is uniquely defined by Step 2; set T (µ) := m. Since T is continuous with compact image, Schauder s fixed point theorem ensures the existence of a solution. C. Marchi (Univ. of Padova) Mean Field Games on networks Roma, June 14 th, / 35
34 Step 4: Uniqueness. Cross-testing the equations in (MFG Γ ), by the transition conditions, we get (m 1 m 2 )(V (m 1 ) V (m 2 ))dx + j J e j }{{} 0 by monotonicity [ m 1 Hj (x, j u 2 ) H j (x, j u 1 ) p H j (x, j u 1 ) j (u 2 u 1 ) ] dx+ e j }{{} j J j J 0 by convexity [ m 2 (Hj (x, j u 1 ) H j (x, j u 2 ) p H j (x, j u 2 ) j (u 1 u 2 ) ] dx = 0. e j }{{} 0 by convexity Therefore, each one of these three lines must vanish and we conclude as in [Lasry-Lions 06]. C. Marchi (Univ. of Padova) Mean Field Games on networks Roma, June 14 th, / 35
35 A finite difference scheme for MFG on network We introduce a grid on Γ. For the parametrization π j : [0, l j ] R n of e j, let y j,k = kh j (k = 0,..., N h j ) be an uniform partition of [0, l j ]: G h = {x j,k = π j (y j,k ), j J, k = 0,..., N h j }. Inc + i := {j Inc i : v i = π j (0)}, Inc i := {j Inc i : v i = π j (N h j h j )}. We introduce the (1-dimensional) finite difference operators (D + U) j,k = U j,k+1 U j,k h j, [D h U] j,k = ( (D + U) j,k, (D + U) j,k 1 ) T, (Dh 2 U) j,k = U j,k+1 + U j,k 1 2U j,k hj 2. We introduce the inner product. For U, W : G h R, set (U, W ) 2 = j J N h j 1 k=1 h j U j,k W j,k + i I ( j Inc + i h j 2 U j,0w j,0 + j Inc i h j 2 U ) j,n W j h j,n h. j C. Marchi (Univ. of Padova) Mean Field Games on networks Roma, June 14 th, / 35
36 We introduce the numerical Hamiltonian g j : [0, l j ] R 2 R, s.t.: (G 1 ) monotonicity: g j (x, q 1, q 2 ) is nonincreasing with respect to q 1 and nondecreasing with respect to q 2. (G 2 ) consistency: g j (x, q, q) = H j (x, q), x [0, l j ], q R. (G 3 ) differentiability: g j is of class C 1. (G 4 ) superlinear growth : g j (x, q 1, q 2 ) α((q 1 )2 + (q + 2 )2 ) γ/2 C for some α > 0, C R and γ > 1. (G 5 ) convexity : (q 1, q 2 ) g j (x, q 1, q 2 ) is convex. We introduce a continuous numerical potential V h such that C independent of h such that max (V h [M]) j,k C, (V h [M]) j,k (V h [M]) j,l C y j,k y j,l. j,k for all M K h := {M : M is continuous, M j,k 0, (M, 1) 2 = 1}. C. Marchi (Univ. of Padova) Mean Field Games on networks Roma, June 14 th, / 35
37 We get the following system in the unknown (U, M, R) ν j (DhU) 2 j,k + g(x j,k, [D h U] j,k ) + R = V h (M j,k ) ν j (D 2 hm) j,k + B h (U, M) j,k = 0, j Inc + i j Inc + i j Inc i [ νj (D + U) j,0 + h j 2 (V j,0 R) ] U, M continuous at v i, i I, (M, 1) 2 = 1, (U, 1) 2 = 0, j Inc i [ νj (D + M) j,0 + M j,1 g q 2 (x j,1, [D h U] j,1 ) ] [ νj (D + U) j,n h j 1 h j 2 (V j,n h j [ νj (D + M) j,n h 1 + M g j,n j j h 1 (x q j,n h 1 j 1, [D hu] j,n h j 1 )] = 0 R) ] = 0 C. Marchi (Univ. of Padova) Mean Field Games on networks Roma, June 14 th, / 35
38 Theorem (Cacace-Camilli-M., M2AN 17) For any h = {h j } j J, the discrete problem has at least a solution (U h, M h, ρ h ). Moreover ρ h C 1, U h + D h U h C 2 for some constants C 1, C 2 independent of h. Moreover, if V h is strictly monotone, then the solution is unique. If (u, m, ρ) is the solution of the MFG system (MFG Γ ), then [ ] U h u + M h m + ρ h ρ = 0. lim h 0 C. Marchi (Univ. of Padova) Mean Field Games on networks Roma, June 14 th, / 35
39 Theorem (Cacace-Camilli-M., M2AN 17) For any h = {h j } j J, the discrete problem has at least a solution (U h, M h, ρ h ). Moreover ρ h C 1, U h + D h U h C 2 for some constants C 1, C 2 independent of h. Moreover, if V h is strictly monotone, then the solution is unique. If (u, m, ρ) is the solution of the MFG system (MFG Γ ), then [ ] U h u + M h m + ρ h ρ = 0. lim h 0 C. Marchi (Univ. of Padova) Mean Field Games on networks Roma, June 14 th, / 35
40 Solution of the discrete MFG system via Nonlinear-Least-Squares The solution of the MFG discrete system is usually performed by means of some regularizations, e.g. large time approximation or ergodic approximation. We propose a different method: We collect the unknowns in a vector X = (U, M, R) of length 2N h + 1; we consider the nonlinear map F : R 2Nh +1 R 2Nh +2 defined by ν j (DhU) 2 j,k + g(x j,k, [D h U] j,k ) + R V h (M j,k ), F(X) = ν j (DhM) 2 j,k + B h (U, M) j,k, [ νj (D + U) j,0 + h j 2 (V j,0 R) ] j Inc + i j Inc + i j Inc i j Inc i [ νj (D + M) j,0 + M j,1 g q 2 (x j,1, [D h U] j,1 ) ] (M, 1) 2 1 (U, 1) 2. [ νj (D + M) j,n h j 1 + M j,n h j 1 [ νj (D + U) j,n h 1 h j j 2 (V j,n j h g (x q j,n h 1 j 1, [D hu] j,n h j 1 )] The solution of the discrete MFG is the unique X s.t. F(X ) = 0. R) ] C. Marchi (Univ. of Padova) Mean Field Games on networks Roma, June 14 th, / 35
41 Solution of the discrete MFG system via Nonlinear-Least-Squares The solution of the MFG discrete system is usually performed by means of some regularizations, e.g. large time approximation or ergodic approximation. We propose a different method: We collect the unknowns in a vector X = (U, M, R) of length 2N h + 1; we consider the nonlinear map F : R 2Nh +1 R 2Nh +2 defined by ν j (DhU) 2 j,k + g(x j,k, [D h U] j,k ) + R V h (M j,k ), F(X) = ν j (DhM) 2 j,k + B h (U, M) j,k, [ νj (D + U) j,0 + h j 2 (V j,0 R) ] j Inc + i j Inc + i j Inc i j Inc i [ νj (D + M) j,0 + M j,1 g q 2 (x j,1, [D h U] j,1 ) ] (M, 1) 2 1 (U, 1) 2. [ νj (D + M) j,n h j 1 + M j,n h j 1 [ νj (D + U) j,n h 1 h j j 2 (V j,n j h g (x q j,n h 1 j 1, [D hu] j,n h j 1 )] The solution of the discrete MFG is the unique X s.t. F(X ) = 0. R) ] C. Marchi (Univ. of Padova) Mean Field Games on networks Roma, June 14 th, / 35
42 Solution of the discrete MFG system via Nonlinear-Least-Squares The solution of the MFG discrete system is usually performed by means of some regularizations, e.g. large time approximation or ergodic approximation. We propose a different method: We collect the unknowns in a vector X = (U, M, R) of length 2N h + 1; we consider the nonlinear map F : R 2Nh +1 R 2Nh +2 defined by ν j (DhU) 2 j,k + g(x j,k, [D h U] j,k ) + R V h (M j,k ), F(X) = ν j (DhM) 2 j,k + B h (U, M) j,k, [ νj (D + U) j,0 + h j 2 (V j,0 R) ] j Inc + i j Inc + i j Inc i j Inc i [ νj (D + M) j,0 + M j,1 g q 2 (x j,1, [D h U] j,1 ) ] (M, 1) 2 1 (U, 1) 2. [ νj (D + M) j,n h j 1 + M j,n h j 1 [ νj (D + U) j,n h 1 h j j 2 (V j,n j h g (x q j,n h 1 j 1, [D hu] j,n h j 1 )] The solution of the discrete MFG is the unique X s.t. F(X ) = 0. R) ] C. Marchi (Univ. of Padova) Mean Field Games on networks Roma, June 14 th, / 35
43 The system F(X ) = 0 is formally overdetermined (2N h + 2 equations in 2N h + 1 unknowns), hence the solution is meant in the following nonlinear-least-squares sense: X 1 = arg min X 2 F(X) 2 2. The previous optimization problem is solved by means of the Gauss-Newton method J F (X k )δ X = F(X k ), X k+1 = X k + δ X. via the QR factorization of the Jacobian J F (X k ). C. Marchi (Univ. of Padova) Mean Field Games on networks Roma, June 14 th, / 35
44 Numerical experiments We consider a network with 2 vertices and 3 edges (boundary vertices are identified!). Each edge has unit length and connects (0, 0) to (cos(2πj/3), sin(2πj/3)) with j = 0, 1, 2. Data: Uniform diffusion ν j ν H j (x, p) = 1 2 p 2 + f (x) f (x) = s j (1 + cos(2π ( 0 x + 1 ) ) 2 ) -0.5 s j {0, 1} V [m] = m Computational time for N h 5000 is of the order of seconds! C. Marchi (Univ. of Padova) Mean Field Games on networks Roma, June 14 th, / 35
45 Cost active on all edges ν = 0.1, s 0 = 1, s 1 = 1, s 2 = 1, V [m] = m M M (blu) and U (red) Computed ρ = C. Marchi (Univ. of Padova) Mean Field Games on networks Roma, June 14 th, / 35
46 Cost active on two edges ν = 0.1, s 0 = 1, s 1 = 1, s 2 = 0, V [m] = m M M (blu) and U (red) Computed ρ = C. Marchi (Univ. of Padova) Mean Field Games on networks Roma, June 14 th, / 35
47 Small viscosity, cost active on all edges ν = 10 4, s 0 = 1, s 1 = 1, s 2 = 1, V [m] = m M M (blu) and U (red) Computed ρ = C. Marchi (Univ. of Padova) Mean Field Games on networks Roma, June 14 th, / 35
48 Small viscosity, cost active on two edges ν = 10 4, s 0 = 1, s 1 = 1, s 2 = 0, V [m] = m M M (blu) and U (red) Computed ρ = C. Marchi (Univ. of Padova) Mean Field Games on networks Roma, June 14 th, / 35
49 Numerical experiments ν = 0.1, s 0 = 1, s 1 = 1, s 2 = 1, V [m] = 1 4 π arctan(m) M M and U Computed Λ = C. Marchi (Univ. of Padova) Mean Field Games on networks Roma, June 14 th, / 35
50 Numerical experiments ν = 10 3, s 0 = 1, s 1 = 1, s 2 = 1, V [m] = 1 4 π arctan(m) M M and U Computed Λ = C. Marchi (Univ. of Padova) Mean Field Games on networks Roma, June 14 th, / 35
51 More complex networks M U C. Marchi (Univ. of12 Padova) -3 Mean Field Games on networks 12Roma, -3 June 14 th, / 35
52 Comments and Remarks: rigorous derivation of the system starting from the game with N players. more general transitions conditions (arbitrary weights for the edges, controlled weights...) and/or lack of continuity condition. first order MFG systems on networks. C. Marchi (Univ. of Padova) Mean Field Games on networks Roma, June 14 th, / 35
53 Thank You! C. Marchi (Univ. of Padova) Mean Field Games on networks Roma, June 14 th, / 35
Weak solutions to Fokker-Planck equations and Mean Field Games
Weak solutions to Fokker-Planck equations and Mean Field Games Alessio Porretta Universita di Roma Tor Vergata LJLL, Paris VI March 6, 2015 Outlines of the talk Brief description of the Mean Field Games
More informationMean field games and related models
Mean field games and related models Fabio Camilli SBAI-Dipartimento di Scienze di Base e Applicate per l Ingegneria Facoltà di Ingegneria Civile ed Industriale Email: Camilli@dmmm.uniroma1.it Web page:
More informationNumerical methods for Mean Field Games: additional material
Numerical methods for Mean Field Games: additional material Y. Achdou (LJLL, Université Paris-Diderot) July, 2017 Luminy Convergence results Outline 1 Convergence results 2 Variational MFGs 3 A numerical
More informationVariational approach to mean field games with density constraints
1 / 18 Variational approach to mean field games with density constraints Alpár Richárd Mészáros LMO, Université Paris-Sud (based on ongoing joint works with F. Santambrogio, P. Cardaliaguet and F. J. Silva)
More informationExplicit solutions of some Linear-Quadratic Mean Field Games
Explicit solutions of some Linear-Quadratic Mean Field Games Martino Bardi Department of Pure and Applied Mathematics University of Padua, Italy Men Field Games and Related Topics Rome, May 12-13, 2011
More informationON MEAN FIELD GAMES. Pierre-Louis LIONS. Collège de France, Paris. (joint project with Jean-Michel LASRY)
Collège de France, Paris (joint project with Jean-Michel LASRY) I INTRODUCTION II A REALLY SIMPLE EXAMPLE III GENERAL STRUCTURE IV TWO PARTICULAR CASES V OVERVIEW AND PERSPECTIVES I. INTRODUCTION New class
More informationLong time behavior of Mean Field Games
Long time behavior of Mean Field Games P. Cardaliaguet (Paris-Dauphine) Joint work with A. Porretta (Roma Tor Vergata) PDE and Probability Methods for Interactions Sophia Antipolis (France) - March 30-31,
More informationLQG Mean-Field Games with ergodic cost in R d
LQG Mean-Field Games with ergodic cost in R d Fabio S. Priuli University of Roma Tor Vergata joint work with: M. Bardi (Univ. Padova) Padova, September 4th, 2013 Main problems Problems we are interested
More informationContinuous dependence estimates for the ergodic problem with an application to homogenization
Continuous dependence estimates for the ergodic problem with an application to homogenization Claudio Marchi Bayreuth, September 12 th, 2013 C. Marchi (Università di Padova) Continuous dependence Bayreuth,
More informationMean-Field Games with non-convex Hamiltonian
Mean-Field Games with non-convex Hamiltonian Martino Bardi Dipartimento di Matematica "Tullio Levi-Civita" Università di Padova Workshop "Optimal Control and MFGs" Pavia, September 19 21, 2018 Martino
More informationOn the long time behavior of the master equation in Mean Field Games
On the long time behavior of the master equation in Mean Field Games P. Cardaliaguet (Paris-Dauphine) Joint work with A. Porretta (Roma Tor Vergata) Mean Field Games and Related Topics - 4 Rome - June
More informationRégularité des équations de Hamilton-Jacobi du premier ordre et applications aux jeux à champ moyen
Régularité des équations de Hamilton-Jacobi du premier ordre et applications aux jeux à champ moyen Daniela Tonon en collaboration avec P. Cardaliaguet et A. Porretta CEREMADE, Université Paris-Dauphine,
More informationOn semilinear elliptic equations with measure data
On semilinear elliptic equations with measure data Andrzej Rozkosz (joint work with T. Klimsiak) Nicolaus Copernicus University (Toruń, Poland) Controlled Deterministic and Stochastic Systems Iasi, July
More informationLearning in Mean Field Games
Learning in Mean Field Games P. Cardaliaguet Paris-Dauphine Joint work with S. Hadikhanloo (Dauphine) Nonlinear PDEs: Optimal Control, Asymptotic Problems and Mean Field Games Padova, February 25-26, 2016.
More informationarxiv: v2 [math.ap] 28 Nov 2016
ONE-DIMENSIONAL SAIONARY MEAN-FIELD GAMES WIH LOCAL COUPLING DIOGO A. GOMES, LEVON NURBEKYAN, AND MARIANA PRAZERES arxiv:1611.8161v [math.ap] 8 Nov 16 Abstract. A standard assumption in mean-field game
More informationOn the approximation of the principal eigenvalue for a class of nonlinear elliptic operators
On the approximation of the principal eigenvalue for a class of nonlinear elliptic operators Fabio Camilli ("Sapienza" Università di Roma) joint work with I.Birindelli ("Sapienza") I.Capuzzo Dolcetta ("Sapienza")
More informationSingular Perturbations of Stochastic Control Problems with Unbounded Fast Variables
Singular Perturbations of Stochastic Control Problems with Unbounded Fast Variables Joao Meireles joint work with Martino Bardi and Guy Barles University of Padua, Italy Workshop "New Perspectives in Optimal
More informationarxiv: v1 [math.ap] 15 Jul 2016
Mean Field Games models of segregation Yves Achdou, Martino Bardi and Marco Cirant September 4, 8 Abstract arxiv:7.445v [math.ap] 5 Jul This paper introduces and analyses some models in the framework of
More informationMEAN FIELD GAMES MODELS OF SEGREGATION
MEAN FIELD GAMES MODELS OF SEGREGATION Yves Achdou, Martino Bardi, Marco Cirant To cite this version: Yves Achdou, Martino Bardi, Marco Cirant. MEAN FIELD GAMES MODELS OF SEGREGATION. 26. HAL
More informationMulti-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 informationA Parcimonious Long Term Mean Field Model for Mining Industries
A Parcimonious Long Term Mean Field Model for Mining Industries Yves Achdou Laboratoire J-L. Lions, Université Paris Diderot (joint work with P-N. Giraud, J-M. Lasry and P-L. Lions ) Mining Industries
More informationFiltered scheme and error estimate for first order Hamilton-Jacobi equations
and error estimate for first order Hamilton-Jacobi equations Olivier Bokanowski 1 Maurizio Falcone 2 2 1 Laboratoire Jacques-Louis Lions, Université Paris-Diderot (Paris 7) 2 SAPIENZA - Università di Roma
More informationADJOINT METHODS FOR OBSTACLE PROBLEMS AND WEAKLY COUPLED SYSTEMS OF PDE. 1. Introduction
ADJOINT METHODS FOR OBSTACLE PROBLEMS AND WEAKLY COPLED SYSTEMS OF PDE F. CAGNETTI, D. GOMES, AND H.V. TRAN Abstract. The adjoint method, recently introduced by Evans, is used to study obstacle problems,
More informationWeak Convergence of Numerical Methods for Dynamical Systems and Optimal Control, and a relation with Large Deviations for Stochastic Equations
Weak Convergence of Numerical Methods for Dynamical Systems and, and a relation with Large Deviations for Stochastic Equations Mattias Sandberg KTH CSC 2010-10-21 Outline The error representation for weak
More informationLipschitz continuity for solutions of Hamilton-Jacobi equation with Ornstein-Uhlenbeck operator
Lipschitz continuity for solutions of Hamilton-Jacobi equation with Ornstein-Uhlenbeck operator Thi Tuyen Nguyen Ph.D student of University of Rennes 1 Joint work with: Prof. E. Chasseigne(University of
More informationNonlinear representation, backward SDEs, and application to the Principal-Agent problem
Nonlinear representation, backward SDEs, and application to the Principal-Agent problem Ecole Polytechnique, France April 4, 218 Outline The Principal-Agent problem Formulation 1 The Principal-Agent problem
More informationHOMEOMORPHISMS OF BOUNDED VARIATION
HOMEOMORPHISMS OF BOUNDED VARIATION STANISLAV HENCL, PEKKA KOSKELA AND JANI ONNINEN Abstract. We show that the inverse of a planar homeomorphism of bounded variation is also of bounded variation. In higher
More informationEXPLICIT SOLUTIONS OF SOME LINEAR-QUADRATIC MEAN FIELD GAMES. Martino Bardi
NETWORKS AND HETEROGENEOUS MEDIA c American Institute of Mathematical Sciences Volume 7, Number, June 1 doi:1.3934/nhm.1.7.xx pp. X XX EXPLICIT SOLUTIONS OF SOME LINEAR-QUADRATIC MEAN FIELD GAMES Martino
More informationRichard F. Bass Krzysztof Burdzy University of Washington
ON DOMAIN MONOTONICITY OF THE NEUMANN HEAT KERNEL Richard F. Bass Krzysztof Burdzy University of Washington Abstract. Some examples are given of convex domains for which domain monotonicity of the Neumann
More informationHomogenization and error estimates of free boundary velocities in periodic media
Homogenization and error estimates of free boundary velocities in periodic media Inwon C. Kim October 7, 2011 Abstract In this note I describe a recent result ([14]-[15]) on homogenization and error estimates
More informationHAMILTON-JACOBI EQUATIONS : APPROXIMATIONS, NUMERICAL ANALYSIS AND APPLICATIONS. CIME Courses-Cetraro August 29-September COURSES
HAMILTON-JACOBI EQUATIONS : APPROXIMATIONS, NUMERICAL ANALYSIS AND APPLICATIONS CIME Courses-Cetraro August 29-September 3 2011 COURSES (1) Models of mean field, Hamilton-Jacobi-Bellman Equations and numerical
More informationGlobal well-posedness of the primitive equations of oceanic and atmospheric dynamics
Global well-posedness of the primitive equations of oceanic and atmospheric dynamics Jinkai Li Department of Mathematics The Chinese University of Hong Kong Dynamics of Small Scales in Fluids ICERM, Feb
More informationNonlinear stabilization via a linear observability
via a linear observability Kaïs Ammari Department of Mathematics University of Monastir Joint work with Fathia Alabau-Boussouira Collocated feedback stabilization Outline 1 Introduction and main result
More informationLarge-population, dynamical, multi-agent, competitive, and cooperative phenomena occur in a wide range of designed
Definition Mean Field Game (MFG) theory studies the existence of Nash equilibria, together with the individual strategies which generate them, in games involving a large number of agents modeled by controlled
More informationMean-Field optimization problems and non-anticipative optimal transport. Beatrice Acciaio
Mean-Field optimization problems and non-anticipative optimal transport Beatrice Acciaio London School of Economics based on ongoing projects with J. Backhoff, R. Carmona and P. Wang Robust Methods in
More informationWeak convergence and large deviation theory
First Prev Next Go To Go Back Full Screen Close Quit 1 Weak convergence and large deviation theory Large deviation principle Convergence in distribution The Bryc-Varadhan theorem Tightness and Prohorov
More informationRandom and Deterministic perturbations of dynamical systems. Leonid Koralov
Random and Deterministic perturbations of dynamical systems Leonid Koralov - M. Freidlin, L. Koralov Metastability for Nonlinear Random Perturbations of Dynamical Systems, Stochastic Processes and Applications
More informationRegularity and nonexistence results for anisotropic quasilinear elliptic equations in convex domains
Regularity and nonexistence results for anisotropic quasilinear elliptic equations in convex domains Ilaria FRAGALÀ Filippo GAZZOLA Dipartimento di Matematica del Politecnico - Piazza L. da Vinci - 20133
More informationA-PRIORI ESTIMATES FOR STATIONARY MEAN-FIELD GAMES
Manuscript submitted to Website: http://aimsciences.org AIMS Journals Volume 00, Number 0, Xxxx XXXX pp. 000 000 A-PRIORI ESTIMATES FOR STATIONARY MEAN-FIELD GAMES DIOGO A. GOMES, GABRIEL E. PIRES, HÉCTOR
More informationNonlinear elliptic systems and mean eld games
Nonlinear elliptic systems and mean eld games Martino Bardi, Ermal Feleqi To cite this version: Martino Bardi, Ermal Feleqi. Nonlinear elliptic systems and mean eld games. 2014. HAL Id:
More informationExistence and uniqueness results for the MFG system
Existence and uniqueness results for the MFG system P. Cardaliaguet Paris-Dauphine Based on Lasry-Lions (2006) and Lions lectures at Collège de France IMA Special Short Course Mean Field Games", November
More informationEXISTENCE OF SOLUTIONS FOR CROSS CRITICAL EXPONENTIAL N-LAPLACIAN SYSTEMS
Electronic Journal of Differential Equations, Vol. 2014 (2014), o. 28, pp. 1 10. ISS: 1072-6691. URL: http://ejde.math.txstate.edu or http://ejde.math.unt.edu ftp ejde.math.txstate.edu EXISTECE OF SOLUTIOS
More informationExplicit solutions of some Linear-Quadratic Mean Field Games
Explicit solutions of some Linear-Quadratic Mean Field Games Martino Bardi To cite this version: Martino Bardi. Explicit solutions of some Linear-Quadratic Mean Field Games. Networks and Heterogeneous
More informationA Semi-Lagrangian scheme for a regularized version of the Hughes model for pedestrian flow
A Semi-Lagrangian scheme for a regularized version of the Hughes model for pedestrian flow Adriano FESTA Johann Radon Institute for Computational and Applied Mathematics (RICAM) Austrian Academy of Sciences
More informationExtremal Solutions of Differential Inclusions via Baire Category: a Dual Approach
Extremal Solutions of Differential Inclusions via Baire Category: a Dual Approach Alberto Bressan Department of Mathematics, Penn State University University Park, Pa 1682, USA e-mail: bressan@mathpsuedu
More informationControlled Diffusions and Hamilton-Jacobi Bellman Equations
Controlled Diffusions and Hamilton-Jacobi Bellman Equations Emo Todorov Applied Mathematics and Computer Science & Engineering University of Washington Winter 2014 Emo Todorov (UW) AMATH/CSE 579, Winter
More informationLecture No 2 Degenerate Diffusion Free boundary problems
Lecture No 2 Degenerate Diffusion Free boundary problems Columbia University IAS summer program June, 2009 Outline We will discuss non-linear parabolic equations of slow diffusion. Our model is the porous
More informationNonlinear Elliptic Systems and Mean-Field Games
Nonlinear Elliptic Systems and Mean-Field Games Martino Bardi and Ermal Feleqi Dipartimento di Matematica Università di Padova via Trieste, 63 I-35121 Padova, Italy e-mail: bardi@math.unipd.it and feleqi@math.unipd.it
More informationThe Kuratowski Ryll-Nardzewski Theorem and semismooth Newton methods for Hamilton Jacobi Bellman equations
The Kuratowski Ryll-Nardzewski Theorem and semismooth Newton methods for Hamilton Jacobi Bellman equations Iain Smears INRIA Paris Linz, November 2016 joint work with Endre Süli, University of Oxford Overview
More informationLecture No 1 Introduction to Diffusion equations The heat equat
Lecture No 1 Introduction to Diffusion equations The heat equation Columbia University IAS summer program June, 2009 Outline of the lectures We will discuss some basic models of diffusion equations and
More informationM. Ledoux Université de Toulouse, France
ON MANIFOLDS WITH NON-NEGATIVE RICCI CURVATURE AND SOBOLEV INEQUALITIES M. Ledoux Université de Toulouse, France Abstract. Let M be a complete n-dimensional Riemanian manifold with non-negative Ricci curvature
More informationThuong Nguyen. SADCO Internal Review Metting
Asymptotic behavior of singularly perturbed control system: non-periodic setting Thuong Nguyen (Joint work with A. Siconolfi) SADCO Internal Review Metting Rome, Nov 10-12, 2014 Thuong Nguyen (Roma Sapienza)
More informationExistence of minimizers for the pure displacement problem in nonlinear elasticity
Existence of minimizers for the pure displacement problem in nonlinear elasticity Cristinel Mardare Université Pierre et Marie Curie - Paris 6, Laboratoire Jacques-Louis Lions, Paris, F-75005 France Abstract
More informationUncertainty quantification and systemic risk
Uncertainty quantification and systemic risk Josselin Garnier (Université Paris Diderot) with George Papanicolaou and Tzu-Wei Yang (Stanford University) February 3, 2016 Modeling systemic risk We consider
More informationOPTIMAL CONTROL AND STRANGE TERM FOR A STOKES PROBLEM IN PERFORATED DOMAINS
PORTUGALIAE MATHEMATICA Vol. 59 Fasc. 2 2002 Nova Série OPTIMAL CONTROL AND STRANGE TERM FOR A STOKES PROBLEM IN PERFORATED DOMAINS J. Saint Jean Paulin and H. Zoubairi Abstract: We study a problem of
More informationA stochastic particle system for the Burgers equation.
A stochastic particle system for the Burgers equation. Alexei Novikov Department of Mathematics Penn State University with Gautam Iyer (Carnegie Mellon) supported by NSF Burgers equation t u t + u x u
More informationA VARIATIONAL METHOD FOR THE ANALYSIS OF A MONOTONE SCHEME FOR THE MONGE-AMPÈRE EQUATION 1. INTRODUCTION
A VARIATIONAL METHOD FOR THE ANALYSIS OF A MONOTONE SCHEME FOR THE MONGE-AMPÈRE EQUATION GERARD AWANOU AND LEOPOLD MATAMBA MESSI ABSTRACT. We give a proof of existence of a solution to the discrete problem
More informationOn continuous time contract theory
Ecole Polytechnique, France Journée de rentrée du CMAP, 3 octobre, 218 Outline 1 2 Semimartingale measures on the canonical space Random horizon 2nd order backward SDEs (Static) Principal-Agent Problem
More informationNotes on Mean Field Games
Notes on Mean Field Games (from P.-L. Lions lectures at Collège de France) Pierre Cardaliaguet September 27, 203 Contents Introduction 2 2 Nash equilibria in games with a large number of players 4 2. Symmetric
More informationANISOTROPIC EQUATIONS: UNIQUENESS AND EXISTENCE RESULTS
ANISOTROPIC EQUATIONS: UNIQUENESS AND EXISTENCE RESULTS STANISLAV ANTONTSEV, MICHEL CHIPOT Abstract. We study uniqueness of weak solutions for elliptic equations of the following type ) xi (a i (x, u)
More informationTHE STOKES SYSTEM R.E. SHOWALTER
THE STOKES SYSTEM R.E. SHOWALTER Contents 1. Stokes System 1 Stokes System 2 2. The Weak Solution of the Stokes System 3 3. The Strong Solution 4 4. The Normal Trace 6 5. The Mixed Problem 7 6. The Navier-Stokes
More informationEXISTENCE RESULTS FOR OPERATOR EQUATIONS INVOLVING DUALITY MAPPINGS VIA THE MOUNTAIN PASS THEOREM
EXISTENCE RESULTS FOR OPERATOR EQUATIONS INVOLVING DUALITY MAPPINGS VIA THE MOUNTAIN PASS THEOREM JENICĂ CRÎNGANU We derive existence results for operator equations having the form J ϕu = N f u, by using
More informationLaplace s Equation. Chapter Mean Value Formulas
Chapter 1 Laplace s Equation Let be an open set in R n. A function u C 2 () is called harmonic in if it satisfies Laplace s equation n (1.1) u := D ii u = 0 in. i=1 A function u C 2 () is called subharmonic
More informationA generalised Ladyzhenskaya inequality and a coupled parabolic-elliptic problem
A generalised Ladyzhenskaya inequality and a coupled parabolic-elliptic problem Dave McCormick joint work with James Robinson and José Rodrigo Mathematics and Statistics Centre for Doctoral Training University
More informationWalsh Diffusions. Andrey Sarantsev. March 27, University of California, Santa Barbara. Andrey Sarantsev University of Washington, Seattle 1 / 1
Walsh Diffusions Andrey Sarantsev University of California, Santa Barbara March 27, 2017 Andrey Sarantsev University of Washington, Seattle 1 / 1 Walsh Brownian Motion on R d Spinning measure µ: probability
More informationMinimal Surface equations non-solvability strongly convex functional further regularity Consider minimal surface equation.
Lecture 7 Minimal Surface equations non-solvability strongly convex functional further regularity Consider minimal surface equation div + u = ϕ on ) = 0 in The solution is a critical point or the minimizer
More informationTHE SKOROKHOD OBLIQUE REFLECTION PROBLEM IN A CONVEX POLYHEDRON
GEORGIAN MATHEMATICAL JOURNAL: Vol. 3, No. 2, 1996, 153-176 THE SKOROKHOD OBLIQUE REFLECTION PROBLEM IN A CONVEX POLYHEDRON M. SHASHIASHVILI Abstract. The Skorokhod oblique reflection problem is studied
More informationReflected Brownian Motion
Chapter 6 Reflected Brownian Motion Often we encounter Diffusions in regions with boundary. If the process can reach the boundary from the interior in finite time with positive probability we need to decide
More informationMath The Laplacian. 1 Green s Identities, Fundamental Solution
Math. 209 The Laplacian Green s Identities, Fundamental Solution Let be a bounded open set in R n, n 2, with smooth boundary. The fact that the boundary is smooth means that at each point x the external
More informationOn countably skewed Brownian motion
On countably skewed Brownian motion Gerald Trutnau (Seoul National University) Joint work with Y. Ouknine (Cadi Ayyad) and F. Russo (ENSTA ParisTech) Electron. J. Probab. 20 (2015), no. 82, 1-27 [ORT 2015]
More informationThe Lévy-Itô decomposition and the Lévy-Khintchine formula in31 themarch dual of 2014 a nuclear 1 space. / 20
The Lévy-Itô decomposition and the Lévy-Khintchine formula in the dual of a nuclear space. Christian Fonseca-Mora School of Mathematics and Statistics, University of Sheffield, UK Talk at "Stochastic Processes
More informationNew Identities for Weak KAM Theory
New Identities for Weak KAM Theory Lawrence C. Evans Department of Mathematics University of California, Berkeley Abstract This paper records for the Hamiltonian H = p + W (x) some old and new identities
More informationb i (µ, x, s) ei ϕ(x) µ s (dx) ds (2) i=1
NONLINEAR EVOLTION EQATIONS FOR MEASRES ON INFINITE DIMENSIONAL SPACES V.I. Bogachev 1, G. Da Prato 2, M. Röckner 3, S.V. Shaposhnikov 1 The goal of this work is to prove the existence of a solution to
More informationOn Ergodic Impulse Control with Constraint
On Ergodic Impulse Control with Constraint Maurice Robin Based on joint papers with J.L. Menaldi University Paris-Sanclay 9119 Saint-Aubin, France (e-mail: maurice.robin@polytechnique.edu) IMA, Minneapolis,
More informationSHARP BOUNDARY TRACE INEQUALITIES. 1. Introduction
SHARP BOUNDARY TRACE INEQUALITIES GILES AUCHMUTY Abstract. This paper describes sharp inequalities for the trace of Sobolev functions on the boundary of a bounded region R N. The inequalities bound (semi-)norms
More informationThe effects of a discontinues weight for a problem with a critical nonlinearity
arxiv:1405.7734v1 [math.ap] 9 May 014 The effects of a discontinues weight for a problem with a critical nonlinearity Rejeb Hadiji and Habib Yazidi Abstract { We study the minimizing problem px) u dx,
More informationminimize x subject to (x 2)(x 4) u,
Math 6366/6367: Optimization and Variational Methods Sample Preliminary Exam Questions 1. Suppose that f : [, L] R is a C 2 -function with f () on (, L) and that you have explicit formulae for
More informationA random perturbation approach to some stochastic approximation algorithms in optimization.
A random perturbation approach to some stochastic approximation algorithms in optimization. Wenqing Hu. 1 (Presentation based on joint works with Chris Junchi Li 2, Weijie Su 3, Haoyi Xiong 4.) 1. Department
More informationA Note On Large Deviation Theory and Beyond
A Note On Large Deviation Theory and Beyond Jin Feng In this set of notes, we will develop and explain a whole mathematical theory which can be highly summarized through one simple observation ( ) lim
More informationWeak solutions of mean-field stochastic differential equations
Weak solutions of mean-field stochastic differential equations Juan Li School of Mathematics and Statistics, Shandong University (Weihai), Weihai 26429, China. Email: juanli@sdu.edu.cn Based on joint works
More informationSome lecture notes for Math 6050E: PDEs, Fall 2016
Some lecture notes for Math 65E: PDEs, Fall 216 Tianling Jin December 1, 216 1 Variational methods We discuss an example of the use of variational methods in obtaining existence of solutions. Theorem 1.1.
More informationOn the martingales obtained by an extension due to Saisho, Tanemura and Yor of Pitman s theorem
On the martingales obtained by an extension due to Saisho, Tanemura and Yor of Pitman s theorem Koichiro TAKAOKA Dept of Applied Physics, Tokyo Institute of Technology Abstract M Yor constructed a family
More informationScientific Computing WS 2017/2018. Lecture 18. Jürgen Fuhrmann Lecture 18 Slide 1
Scientific Computing WS 2017/2018 Lecture 18 Jürgen Fuhrmann juergen.fuhrmann@wias-berlin.de Lecture 18 Slide 1 Lecture 18 Slide 2 Weak formulation of homogeneous Dirichlet problem Search u H0 1 (Ω) (here,
More informationOn the Bellman equation for control problems with exit times and unbounded cost functionals 1
On the Bellman equation for control problems with exit times and unbounded cost functionals 1 Michael Malisoff Department of Mathematics, Hill Center-Busch Campus Rutgers University, 11 Frelinghuysen Road
More informationOn Some Estimates of the Remainder in Taylor s Formula
Journal of Mathematical Analysis and Applications 263, 246 263 (2) doi:.6/jmaa.2.7622, available online at http://www.idealibrary.com on On Some Estimates of the Remainder in Taylor s Formula G. A. Anastassiou
More informationLecture on: Numerical sparse linear algebra and interpolation spaces. June 3, 2014
Lecture on: Numerical sparse linear algebra and interpolation spaces June 3, 2014 Finite dimensional Hilbert spaces and IR N 2 / 38 (, ) : H H IR scalar product and u H = (u, u) u H norm. Finite dimensional
More informationConvergence of a large time-step scheme for Mean Curvature Motion
Outline Convergence of a large time-step scheme for Mean Curvature Motion M. Falcone Dipartimento di Matematica SAPIENZA, Università di Roma in collaboration with E. Carlini (SAPIENZA) and R. Ferretti
More informationMinimal time mean field games
based on joint works with Samer Dweik and Filippo Santambrogio PGMO Days 2017 Session Mean Field Games and applications EDF Lab Paris-Saclay November 14th, 2017 LMO, Université Paris-Sud Université Paris-Saclay
More informationSpectrum and Exact Controllability of a Hybrid System of Elasticity.
Spectrum and Exact Controllability of a Hybrid System of Elasticity. D. Mercier, January 16, 28 Abstract We consider the exact controllability of a hybrid system consisting of an elastic beam, clamped
More informationLECTURES ON MEAN FIELD GAMES: II. CALCULUS OVER WASSERSTEIN SPACE, CONTROL OF MCKEAN-VLASOV DYNAMICS, AND THE MASTER EQUATION
LECTURES ON MEAN FIELD GAMES: II. CALCULUS OVER WASSERSTEIN SPACE, CONTROL OF MCKEAN-VLASOV DYNAMICS, AND THE MASTER EQUATION René Carmona Department of Operations Research & Financial Engineering PACM
More informationNonlinear elliptic systems with exponential nonlinearities
22-Fez conference on Partial Differential Equations, Electronic Journal of Differential Equations, Conference 9, 22, pp 139 147. http://ejde.math.swt.edu or http://ejde.math.unt.edu ftp ejde.math.swt.edu
More informationarxiv: v1 [math.ap] 24 Oct 2014
Multiple solutions for Kirchhoff equations under the partially sublinear case Xiaojing Feng School of Mathematical Sciences, Shanxi University, Taiyuan 030006, People s Republic of China arxiv:1410.7335v1
More informationMultivariable Calculus
2 Multivariable Calculus 2.1 Limits and Continuity Problem 2.1.1 (Fa94) Let the function f : R n R n satisfy the following two conditions: (i) f (K ) is compact whenever K is a compact subset of R n. (ii)
More informationExercise 1. Let f be a nonnegative measurable function. Show that. where ϕ is taken over all simple functions with ϕ f. k 1.
Real Variables, Fall 2014 Problem set 3 Solution suggestions xercise 1. Let f be a nonnegative measurable function. Show that f = sup ϕ, where ϕ is taken over all simple functions with ϕ f. For each n
More informationMEAN CURVATURE FLOW OF ENTIRE GRAPHS EVOLVING AWAY FROM THE HEAT FLOW
MEAN CURVATURE FLOW OF ENTIRE GRAPHS EVOLVING AWAY FROM THE HEAT FLOW GREGORY DRUGAN AND XUAN HIEN NGUYEN Abstract. We present two initial graphs over the entire R n, n 2 for which the mean curvature flow
More informationTHREE SINGULAR VARIATIONAL PROBLEMS. Lawrence C. Evans Department of Mathematics University of California Berkeley, CA 94720
THREE SINGLAR VARIATIONAL PROBLEMS By Lawrence C. Evans Department of Mathematics niversity of California Berkeley, CA 9470 Some of the means I use are trivial and some are quadrivial. J. Joyce Abstract.
More informationCalculus of Variations. Final Examination
Université Paris-Saclay M AMS and Optimization January 18th, 018 Calculus of Variations Final Examination Duration : 3h ; all kind of paper documents (notes, books...) are authorized. The total score of
More informationOptimization and Optimal Control in Banach Spaces
Optimization and Optimal Control in Banach Spaces Bernhard Schmitzer October 19, 2017 1 Convex non-smooth optimization with proximal operators Remark 1.1 (Motivation). Convex optimization: easier to solve,
More informationSYMMETRY OF POSITIVE SOLUTIONS OF SOME NONLINEAR EQUATIONS. M. Grossi S. Kesavan F. Pacella M. Ramaswamy. 1. Introduction
Topological Methods in Nonlinear Analysis Journal of the Juliusz Schauder Center Volume 12, 1998, 47 59 SYMMETRY OF POSITIVE SOLUTIONS OF SOME NONLINEAR EQUATIONS M. Grossi S. Kesavan F. Pacella M. Ramaswamy
More information1. Nonlinear Equations. This lecture note excerpted parts from Michael Heath and Max Gunzburger. f(x) = 0
Numerical Analysis 1 1. Nonlinear Equations This lecture note excerpted parts from Michael Heath and Max Gunzburger. Given function f, we seek value x for which where f : D R n R n is nonlinear. f(x) =
More information