From Benamou-Brenier to mean field games (with density constraints) - - PowerPoint PPT Presentation

from benamou brenier to mean field games with density
SMART_READER_LITE
LIVE PREVIEW

From Benamou-Brenier to mean field games (with density constraints) - - PowerPoint PPT Presentation

BB MFG Variational formulations Density constraints for MFGs From Benamou-Brenier to mean field games (with density constraints) Alp ar Rich ard M esz aros LMO, Universit e Paris-Sud (based on ongoing joint works with F.


slide-1
SLIDE 1

BB MFG Variational formulations Density constraints for MFGs

From Benamou-Brenier to mean field games (with density constraints)

Alp´ ar Rich´ ard M´ esz´ aros

LMO, Universit´ e Paris-Sud

(based on ongoing joint works with

  • F. Santambrogio, P

. Cardaliaguet and F. J. Silva) WORKSHOP ON OPTIMAL TRANSPORT IN THE APPLIED SCIENCES, RICAM,

  • DEC. 8-12, 2014, LINZ

1 / 20

slide-2
SLIDE 2

BB MFG Variational formulations Density constraints for MFGs

The content of the talk

1

Benamou-Brenier formulation of Optimal Transport

2

Basic models of Mean Field Games, after J.-M. Lasry and P .-L. Lions

3

Variational approaches for MFGs

4

Study first order evolutive MFG systems with density constraints

5

Second order stationary MFGs under density constraints

2 / 20

slide-3
SLIDE 3

BB MFG Variational formulations Density constraints for MFGs

The Benamou-Brenier formulation of optimal transportation

For two (regular enough) probability measures µ, ν ∈ P(Ω) (Ω ⊂ Rd is either compact or we set it Td) we have for 1 < q < +∞ W q

q (µ, ν) =

= min

α

1

1 q |αt|q dmtdt : ∂tmt + ∇ · (mtαt) = 0, m0 = µ, m1 = ν

  • = min

(m,w)

1

1 q |wt|q mq−1

t

dxdt : ∂tmt + ∇ · (wt) = 0, m0 = µ, m1 = ν

  • .

This dynamic formulation is due to J.-D. Benamou and Y. Brenier, in ’00 The optimal curve [0, 1] → mt gives a geodesic in (P(Ω), Wq) connecting µ and ν.

3 / 20

slide-4
SLIDE 4

BB MFG Variational formulations Density constraints for MFGs

A further model

We define ℓq : R × Rd → R, ℓq(a, b) :=   

1 q |b|q aq−1 ,

if a > 0, 0, if (a, b) = (0, 0), +∞,

  • therwise.

and Bq : C(0, 1; (P(Ω), Wq))×M([0, 1]×Ω)d, Bq(m, w) := 1

ℓq(mt, wt) dxdt.

Question: What model does

min

(m,w)

  • Bq(m, w) + F(m) +

u1 dm1 : ∂tmt + ∇ · (wt) = 0, m(0, ·) = m0

  • give ?

Here F : C(0, 1; (P(Ω), Wq)) → R is a convex, l.s.c. functional, u1 : Ω → R a smooth function and m0 ∈ P(Ω). Answer: it characterizes an MFG model.

4 / 20

slide-5
SLIDE 5

BB MFG Variational formulations Density constraints for MFGs

A short history of Mean Field Games

This theory was introduced recently (in 2006-2007) by J.-M. Lasry and P .-L. Lions in a series of papers and a series of lectures by P .-L. Lions at Coll` ege de France → in the community

  • f mathematicians;

5 / 20

slide-6
SLIDE 6

BB MFG Variational formulations Density constraints for MFGs

A short history of Mean Field Games

This theory was introduced recently (in 2006-2007) by J.-M. Lasry and P .-L. Lions in a series of papers and a series of lectures by P .-L. Lions at Coll` ege de France → in the community

  • f mathematicians;

Similar models were introduced (around 2006) by P . Caines, M. Huang, R. Malham´ e → in the community of engineers; Analysis of differential games with a very large number of “small” players (agents);

5 / 20

slide-7
SLIDE 7

BB MFG Variational formulations Density constraints for MFGs

A short history of Mean Field Games

This theory was introduced recently (in 2006-2007) by J.-M. Lasry and P .-L. Lions in a series of papers and a series of lectures by P .-L. Lions at Coll` ege de France → in the community

  • f mathematicians;

Similar models were introduced (around 2006) by P . Caines, M. Huang, R. Malham´ e → in the community of engineers; Analysis of differential games with a very large number of “small” players (agents); The models are derived from a “continuum limit”, letting the number of agents go to infinity (similarly to mean field limit in Statistical Mechanics and Physics → Bolzmann or Vlasov equations)

5 / 20

slide-8
SLIDE 8

BB MFG Variational formulations Density constraints for MFGs

A short history of Mean Field Games

This theory was introduced recently (in 2006-2007) by J.-M. Lasry and P .-L. Lions in a series of papers and a series of lectures by P .-L. Lions at Coll` ege de France → in the community

  • f mathematicians;

Similar models were introduced (around 2006) by P . Caines, M. Huang, R. Malham´ e → in the community of engineers; Analysis of differential games with a very large number of “small” players (agents); The models are derived from a “continuum limit”, letting the number of agents go to infinity (similarly to mean field limit in Statistical Mechanics and Physics → Bolzmann or Vlasov equations) Real life applications in Economy, Finance and Social Sciences

5 / 20

slide-9
SLIDE 9

BB MFG Variational formulations Density constraints for MFGs

A typical model for second order MFG

   −∂tu + ν∆u + H(x, m, ∇u) = f(x, m) in (0, T) × Rd ∂tm − ν∆m − ∇ · (DpH(x, m, ∇u)m) = 0 in (0, T) × Rd m(0) = m0, u(T, x) = uT(x, m(T)) in Rd. (1)

6 / 20

slide-10
SLIDE 10

BB MFG Variational formulations Density constraints for MFGs

A typical model for second order MFG

   −∂tu + ν∆u + H(x, m, ∇u) = f(x, m) in (0, T) × Rd ∂tm − ν∆m − ∇ · (DpH(x, m, ∇u)m) = 0 in (0, T) × Rd m(0) = m0, u(T, x) = uT(x, m(T)) in Rd. (1) Assumptions: ν ≥ 0 is a parameter; the Hamiltonian H is convex in its last variable; m0 (and m(t)) is the density of a probability measure; f is an increasing smooth function; uT is a smooth function;

6 / 20

slide-11
SLIDE 11

BB MFG Variational formulations Density constraints for MFGs

A typical model for second order MFG

   −∂tu + ν∆u + H(x, m, ∇u) = f(x, m) in (0, T) × Rd ∂tm − ν∆m − ∇ · (DpH(x, m, ∇u)m) = 0 in (0, T) × Rd m(0) = m0, u(T, x) = uT(x, m(T)) in Rd. (1) Assumptions: ν ≥ 0 is a parameter; the Hamiltonian H is convex in its last variable; m0 (and m(t)) is the density of a probability measure; f is an increasing smooth function; uT is a smooth function; u is the value function of an arbitrary agent, m is the distribution

  • f the agents;

6 / 20

slide-12
SLIDE 12

BB MFG Variational formulations Density constraints for MFGs

A heustistic interpretation

An arbitrary agent controls the stochastic differential equation dXt = αtdt + √ 2νdBt, where Bt is a standard Brownian motion.

7 / 20

slide-13
SLIDE 13

BB MFG Variational formulations Density constraints for MFGs

A heustistic interpretation

An arbitrary agent controls the stochastic differential equation dXt = αtdt + √ 2νdBt, where Bt is a standard Brownian motion. He aims at minimizing the quantity E T L(Xs, m(s), αs) + f(Xs, m(s))ds + uT(XT, m(T))

  • ,

where L is the usual Legendre-Flenchel conjugate of H w.r.t. the p variable.

7 / 20

slide-14
SLIDE 14

BB MFG Variational formulations Density constraints for MFGs

A heustistic interpretation

An arbitrary agent controls the stochastic differential equation dXt = αtdt + √ 2νdBt, where Bt is a standard Brownian motion. He aims at minimizing the quantity E T L(Xs, m(s), αs) + f(Xs, m(s))ds + uT(XT, m(T))

  • ,

where L is the usual Legendre-Flenchel conjugate of H w.r.t. the p variable. His optimal control is (at least heuristically) given in feedback form by α∗(t, x) = −DpH(x, m, ∇u).

7 / 20

slide-15
SLIDE 15

BB MFG Variational formulations Density constraints for MFGs

A typical model of first order MFG system

A typical model for a first order (deterministic) MFG system is the following:

8 / 20

slide-16
SLIDE 16

BB MFG Variational formulations Density constraints for MFGs

A typical model of first order MFG system

A typical model for a first order (deterministic) MFG system is the following:    −∂tu(t, x) + 1

2|∇u(t, x)|2 = f(x, m(t))

in (0, T) × Ω ∂tm(t, x) − ∇ · (∇u(t, x)m(t, x)) = 0 in (0, T) × Ω m(0) = m0, u(T, x) = uT(x, m(T)) in Ω. (2)

8 / 20

slide-17
SLIDE 17

BB MFG Variational formulations Density constraints for MFGs

A typical model of first order MFG system

A typical model for a first order (deterministic) MFG system is the following:    −∂tu(t, x) + 1

2|∇u(t, x)|2 = f(x, m(t))

in (0, T) × Ω ∂tm(t, x) − ∇ · (∇u(t, x)m(t, x)) = 0 in (0, T) × Ω m(0) = m0, u(T, x) = uT(x, m(T)) in Ω. (2) u corresponds to the value function of a typical agent who controls his velocity α(t) and has to minimize his cost T 1 2|α(t)|2 + f(x(t), m(t))

  • dt + uT(x(T), m(T)),

where x′(s) = α(s) and x(0) = x0.

8 / 20

slide-18
SLIDE 18

BB MFG Variational formulations Density constraints for MFGs

A typical model of first order MFG system

A typical model for a first order (deterministic) MFG system is the following:    −∂tu(t, x) + 1

2|∇u(t, x)|2 = f(x, m(t))

in (0, T) × Ω ∂tm(t, x) − ∇ · (∇u(t, x)m(t, x)) = 0 in (0, T) × Ω m(0) = m0, u(T, x) = uT(x, m(T)) in Ω. (2) u corresponds to the value function of a typical agent who controls his velocity α(t) and has to minimize his cost T 1 2|α(t)|2 + f(x(t), m(t))

  • dt + uT(x(T), m(T)),

where x′(s) = α(s) and x(0) = x0. The distribution of the other agents is represented by the density m(t). Then their “feedback strategy” is given by α(t, x) = −∇u(t, x).

8 / 20

slide-19
SLIDE 19

BB MFG Variational formulations Density constraints for MFGs

Nash equilibria and the variational formulation

Notion of Nash equilibria: solutions of system (2) correspond to a Nash equilibria.

1P

. Cardaliaguet, Week solutions for first order mean field games with local coupling, (2013), preprint

2P

. Cardaliaguet, P .J. Graber, Mean field games systems of first order, (2014), to appear in ESAIM: COCV

9 / 20

slide-20
SLIDE 20

BB MFG Variational formulations Density constraints for MFGs

Nash equilibria and the variational formulation

Notion of Nash equilibria: solutions of system (2) correspond to a Nash equilibria. Variational approach: We can obtain the system (2) (formally) as optimality conditions for:

min

(m,w)

  • B2(m, w) + F(m) +

uT dmT : ∂tmt + ∇ · (wt) = 0, m(0, ·) = m0

  • ,

(P)

where F(m) = T

F(x, mt(x)) dxdt and F ′(x, ·) = f(x, ·).

1P

. Cardaliaguet, Week solutions for first order mean field games with local coupling, (2013), preprint

2P

. Cardaliaguet, P .J. Graber, Mean field games systems of first order, (2014), to appear in ESAIM: COCV

9 / 20

slide-21
SLIDE 21

BB MFG Variational formulations Density constraints for MFGs

Nash equilibria and the variational formulation

Notion of Nash equilibria: solutions of system (2) correspond to a Nash equilibria. Variational approach: We can obtain the system (2) (formally) as optimality conditions for:

min

(m,w)

  • B2(m, w) + F(m) +

uT dmT : ∂tmt + ∇ · (wt) = 0, m(0, ·) = m0

  • ,

(P)

where F(m) = T

F(x, mt(x)) dxdt and F ′(x, ·) = f(x, ·). Recently many interesting results in this variational direction, see for instance the works of P . Cardaliaguet and P . J. Graber1, 2

1P

. Cardaliaguet, Week solutions for first order mean field games with local coupling, (2013), preprint

2P

. Cardaliaguet, P .J. Graber, Mean field games systems of first order, (2014), to appear in ESAIM: COCV

9 / 20

slide-22
SLIDE 22

BB MFG Variational formulations Density constraints for MFGs

Density constraint for MFGs

Objective: study systems like (2) and Problem (P) under the additional constraint m ≤ m a.e. (m > 0 is a given constant)

10 / 20

slide-23
SLIDE 23

BB MFG Variational formulations Density constraints for MFGs

Density constraint for MFGs

Objective: study systems like (2) and Problem (P) under the additional constraint m ≤ m a.e. (m > 0 is a given constant) Motivation: in real applications people/agents want to avoid

  • congestion. → this recalls the models studied by B. Maury, A.

Roudneff-Chupin, F . Santambrogio, J. Venel in the context of crowd motion models.

10 / 20

slide-24
SLIDE 24

BB MFG Variational formulations Density constraints for MFGs

Density constraint for MFGs

Objective: study systems like (2) and Problem (P) under the additional constraint m ≤ m a.e. (m > 0 is a given constant) Motivation: in real applications people/agents want to avoid

  • congestion. → this recalls the models studied by B. Maury, A.

Roudneff-Chupin, F . Santambrogio, J. Venel in the context of crowd motion models. For first order evolutive models we obtained the existence of solutions for some MFG system under density constraints: → subject of an ongoing work with P . Cardaliaguet and F . Santambrogio.

10 / 20

slide-25
SLIDE 25

BB MFG Variational formulations Density constraints for MFGs

Density constraint for MFGs

Objective: study systems like (2) and Problem (P) under the additional constraint m ≤ m a.e. (m > 0 is a given constant) Motivation: in real applications people/agents want to avoid

  • congestion. → this recalls the models studied by B. Maury, A.

Roudneff-Chupin, F . Santambrogio, J. Venel in the context of crowd motion models. For first order evolutive models we obtained the existence of solutions for some MFG system under density constraints: → subject of an ongoing work with P . Cardaliaguet and F . Santambrogio. We have better understanding of the second order stationary MFG models under density constraints. → joint work with F .J. Silva

10 / 20

slide-26
SLIDE 26

BB MFG Variational formulations Density constraints for MFGs

Density constraint for MFGs

Objective: study systems like (2) and Problem (P) under the additional constraint m ≤ m a.e. (m > 0 is a given constant) Motivation: in real applications people/agents want to avoid

  • congestion. → this recalls the models studied by B. Maury, A.

Roudneff-Chupin, F . Santambrogio, J. Venel in the context of crowd motion models. For first order evolutive models we obtained the existence of solutions for some MFG system under density constraints: → subject of an ongoing work with P . Cardaliaguet and F . Santambrogio. We have better understanding of the second order stationary MFG models under density constraints. → joint work with F .J. Silva Main techniques: duality arguments from convex analysis and the direct method of calculus of variations.

10 / 20

slide-27
SLIDE 27

BB MFG Variational formulations Density constraints for MFGs

Density constraint for MFGs

Objective: study systems like (2) and Problem (P) under the additional constraint m ≤ m a.e. (m > 0 is a given constant) Motivation: in real applications people/agents want to avoid

  • congestion. → this recalls the models studied by B. Maury, A.

Roudneff-Chupin, F . Santambrogio, J. Venel in the context of crowd motion models. For first order evolutive models we obtained the existence of solutions for some MFG system under density constraints: → subject of an ongoing work with P . Cardaliaguet and F . Santambrogio. We have better understanding of the second order stationary MFG models under density constraints. → joint work with F .J. Silva Main techniques: duality arguments from convex analysis and the direct method of calculus of variations. We can work with general Hamiltonians.

10 / 20

slide-28
SLIDE 28

BB MFG Variational formulations Density constraints for MFGs

Our notion of solution and some of their properties

A pair (u, m) is a solution to the MFG system with density constraints if there exists a nonnegative Radon measure α on [0, T] × Td such that

1

Integrability conditions: u ∈ BV([0, T] × Td) ∩ L2([0, T] × Td), ∇u ∈ L2([0, T] × Td; Rd), m ∈ L1([0, T] × Td) and 0 ≤ m ≤ m a.e.,

2

Inequality −∂tu + 1

2|∇u(t, x))|2 ≤ α holds in the sense of

measures, where α ≥ f(·, m), and m = m (α − f(·, m))-a.e.;

3

Equality ∂tm − ∇ · (m∇u(t, x)) = 0, m(0) = m0 holds in the sense of distribution,

4

Equality

T

  • Td
  • m 1

2|∇u|2 + αac

  • dxdt + mαs([0, T] × Td)

=

  • Td m0(x)u(0, x) − m(T, x)uT(x) dx

holds.

11 / 20

slide-29
SLIDE 29

BB MFG Variational formulations Density constraints for MFGs

An example

Let us suppose that f ≡ 0 and m0 < m a.e. in Td.

12 / 20

slide-30
SLIDE 30

BB MFG Variational formulations Density constraints for MFGs

An example

Let us suppose that f ≡ 0 and m0 < m a.e. in Td. In this case we have to solve min 1 2W 2

2 (m0, m1) +

  • Td u1m1 dx : m1 ∈ P(Td), m1 ≤ m
  • .

12 / 20

slide-31
SLIDE 31

BB MFG Variational formulations Density constraints for MFGs

An example

Let us suppose that f ≡ 0 and m0 < m a.e. in Td. In this case we have to solve min 1 2W 2

2 (m0, m1) +

  • Td u1m1 dx : m1 ∈ P(Td), m1 ≤ m
  • .

Since m0 < m a.e. in Td, we have mt < m for all t < 1. Thus we

  • btain spt(αs) ⊆ {t = 1} × Td and αac = 0 a.e. in [0, 1] × Td.

12 / 20

slide-32
SLIDE 32

BB MFG Variational formulations Density constraints for MFGs

An example

Let us suppose that f ≡ 0 and m0 < m a.e. in Td. In this case we have to solve min 1 2W 2

2 (m0, m1) +

  • Td u1m1 dx : m1 ∈ P(Td), m1 ≤ m
  • .

Since m0 < m a.e. in Td, we have mt < m for all t < 1. Thus we

  • btain spt(αs) ⊆ {t = 1} × Td and αac = 0 a.e. in [0, 1] × Td.

We have αs = (u(1−, ·) − u1) · Hd {t = 1} × Td.

12 / 20

slide-33
SLIDE 33

BB MFG Variational formulations Density constraints for MFGs

An example

Let us suppose that f ≡ 0 and m0 < m a.e. in Td. In this case we have to solve min 1 2W 2

2 (m0, m1) +

  • Td u1m1 dx : m1 ∈ P(Td), m1 ≤ m
  • .

Since m0 < m a.e. in Td, we have mt < m for all t < 1. Thus we

  • btain spt(αs) ⊆ {t = 1} × Td and αac = 0 a.e. in [0, 1] × Td.

We have αs = (u(1−, ·) − u1) · Hd {t = 1} × Td. A notion of Nash equilibria can be formulated in terms of m and αs, a price to be paid by the agents in the final time.

12 / 20

slide-34
SLIDE 34

BB MFG Variational formulations Density constraints for MFGs

An example

Let us suppose that f ≡ 0 and m0 < m a.e. in Td. In this case we have to solve min 1 2W 2

2 (m0, m1) +

  • Td u1m1 dx : m1 ∈ P(Td), m1 ≤ m
  • .

Since m0 < m a.e. in Td, we have mt < m for all t < 1. Thus we

  • btain spt(αs) ⊆ {t = 1} × Td and αac = 0 a.e. in [0, 1] × Td.

We have αs = (u(1−, ·) − u1) · Hd {t = 1} × Td. A notion of Nash equilibria can be formulated in terms of m and αs, a price to be paid by the agents in the final time. For general f and H we are working to derive a similar notion of equilibria.

12 / 20

slide-35
SLIDE 35

BB MFG Variational formulations Density constraints for MFGs

Stationary second order MFGs

Stationary MFG systems could be seen as long time average of time-dependent ones (see the original papers of Lasry and Lions and 3)

3P

. Cardaliaguet, J.-M. Lasry, P .-L. Lions, A. Porretta, Long time average of mean field games with a nonlocal coupling, SIAM J. Contr. Optim., (2013).

13 / 20

slide-36
SLIDE 36

BB MFG Variational formulations Density constraints for MFGs

Stationary second order MFGs

Stationary MFG systems could be seen as long time average of time-dependent ones (see the original papers of Lasry and Lions and 3) One can prove the convergence (in a reasonable sense as T → +∞) of the solutions of the system    −∂tuT − ∆uT + 1

2

  • ∇uT

2 = f(x, mT), ∂tmT − ∆mT − ∇ · (mT∇uT) = 0, mT(0) = m0, uT(T) = uT to the solutions of the ergodic system    λ − ∆u + 1

2 |∇u|2 = f(x, m),

−∆m − ∇ · (m∇u) = 0,

  • Ω m = 1,
  • Ω u = 0.

3P

. Cardaliaguet, J.-M. Lasry, P .-L. Lions, A. Porretta, Long time average of mean field games with a nonlocal coupling, SIAM J. Contr. Optim., (2013).

13 / 20

slide-37
SLIDE 37

BB MFG Variational formulations Density constraints for MFGs

Treating directly the density constraint

The ergodic problem corresponds to the optimality conditions of the following optimization problem in a bounded open set Ω ⊂ Rd min

(m,w) B2(m, w) + F(m),

(P2) subject to −∆m + ∇ · w = 0 with Neumann b.c. (∇m − w) · n = 0

  • n ∂Ω and
  • Ω m = 1.

14 / 20

slide-38
SLIDE 38

BB MFG Variational formulations Density constraints for MFGs

Treating directly the density constraint

The ergodic problem corresponds to the optimality conditions of the following optimization problem in a bounded open set Ω ⊂ Rd min

(m,w) B2(m, w) + F(m),

(P2) subject to −∆m + ∇ · w = 0 with Neumann b.c. (∇m − w) · n = 0

  • n ∂Ω and
  • Ω m = 1.

Our objective is to study (Pq) + “m ≤ m” → joint work with F . J. Silva.

14 / 20

slide-39
SLIDE 39

BB MFG Variational formulations Density constraints for MFGs

Interior point condition and subdifferentiability

We work in the space w ∈ Lq(Ω)d, for a q > d, hence by a Calder´

  • n-Zygmund-type argument we obtain m ∈ W 1,q(Ω).

15 / 20

slide-40
SLIDE 40

BB MFG Variational formulations Density constraints for MFGs

Interior point condition and subdifferentiability

We work in the space w ∈ Lq(Ω)d, for a q > d, hence by a Calder´

  • n-Zygmund-type argument we obtain m ∈ W 1,q(Ω).

As q > d, we have W 1,q(Ω) ֒ → C0,1− d

q (Ω), → good topology to

ensure the interior point condition for the constraint m ≤ m. ✶

15 / 20

slide-41
SLIDE 41

BB MFG Variational formulations Density constraints for MFGs

Interior point condition and subdifferentiability

We work in the space w ∈ Lq(Ω)d, for a q > d, hence by a Calder´

  • n-Zygmund-type argument we obtain m ∈ W 1,q(Ω).

As q > d, we have W 1,q(Ω) ֒ → C0,1− d

q (Ω), → good topology to

ensure the interior point condition for the constraint m ≤ m. Proposition Denote Em

0 := {m = 0} ∩ {w = 0} and Em 1 = {m > 0}. Let us set

v := (w/m)✶{m>0}. Then, if v / ∈ Lq(Ω), we have that ∂Bq(m, w) = ∅. Otherwise we have that Bq is subdifferentiable at (m, w) and

∂Bq(m, w) =

  • (α, β) ∈ A : spt(αs) ⊆ Em

0 ,

α Em

1 = − 1

q′ |v|q and β Em

1 = |v|q−2v

  • ,

where

A =

  • (α, β) ∈ M(Ω) × Lq′(Ω)d ; α + 1

q′ |β|q′ ≤ 0

  • .

15 / 20

slide-42
SLIDE 42

BB MFG Variational formulations Density constraints for MFGs

Existence and optimality conditions

Theorem The problem (Pq) has a solution (m, w) ∈ W 1,q(Ω) × Lq(Ω)d. ✶

16 / 20

slide-43
SLIDE 43

BB MFG Variational formulations Density constraints for MFGs

Existence and optimality conditions

Theorem The problem (Pq) has a solution (m, w) ∈ W 1,q(Ω) × Lq(Ω)d. Theorem Let (m, w) be a solution of problem (Pq). Then, v := (w/m)✶{m>0} ∈ Lq(Ω)d and there exist (u, p, λ) ∈ W 1,q′

(Ω) × M+(Ω) × R and (α, β) ∈ ∂Bq(m, w) such that −∆u ∈ M(Ω) and the following optimality conditions hold true

                 −∆u +

1 q′ |∇u|q′ − p − λ − α

= f(·, m), β − ∇u = 0, −∆m + ∇ · w = 0, spt(p) ⊆ {m = m}, +Neumann b.c.

  • n

∂Ω (3)

where the first equality holds in M(Ω).

16 / 20

slide-44
SLIDE 44

BB MFG Variational formulations Density constraints for MFGs

Regularity of the solutions

Corollary Let (m, w, u, p, λ) be as in the previous theorem. Then,

               −∆u +

1 q′ |∇u|q′ − p − λ

= f(·, m), ∇u · n = 0

  • n ∂Ω

−∆m − ∇ · (m|∇u|

2−q q−1 ∇u)

= 0, ∇m · n = 0

  • n ∂Ω

(4)

where the first equality is satisfied in the sense of measures while the second one in the sense of distributions over Em

1 . In particular if

f ∈ C(Ω × R), setting Em

2 := {0 < m < m}, we have that

(m, u) ∈ C1,γ

loc (Em 2 ) × C1,γ loc (Em 2 ) is a classical solution of                −∆u +

1 q′ |∇u|q′ − λ

= f(·, m), ∇u · n = 0

  • n ∂Ω

−∆m − ∇ · (m|∇u|

2−q q−1 ∇u)

= 0, ∇m · n = 0

  • n ∂Ω

(5)

17 / 20

slide-45
SLIDE 45

BB MFG Variational formulations Density constraints for MFGs

The dual problem

Proposition The dual problem of (Pq) has at least one solution and can be written as − min

(u,p,λ,a)∈KD

F ∗(x, a) dx + λ + σC(p)

  • (PDq)

where

KD :=

  • (u, p, λ, a) ∈ W 1,q′

(Ω) × M+(Ω) × R × Mac(Ω) : −∆u + 1 q′ |∇u|q′ − p − λ ≤ a

  • ,

C := {y ∈ C(Ω) : y ≤ m}, σC(p) := supy∈Cp, yM(Ω),C(Ω) and the PDE in the definition of the set has to be understood in the sense of measures.

18 / 20

slide-46
SLIDE 46

BB MFG Variational formulations Density constraints for MFGs

The dual problem

Proposition The dual problem of (Pq) has at least one solution and can be written as − min

(u,p,λ,a)∈KD

F ∗(x, a) dx + λ + σC(p)

  • (PDq)

where

KD :=

  • (u, p, λ, a) ∈ W 1,q′

(Ω) × M+(Ω) × R × Mac(Ω) : −∆u + 1 q′ |∇u|q′ − p − λ ≤ a

  • ,

C := {y ∈ C(Ω) : y ≤ m}, σC(p) := supy∈Cp, yM(Ω),C(Ω) and the PDE in the definition of the set has to be understood in the sense of measures. → Moreover (Pq) = (PDq) from where we obtain an alternative way to derive first order optimality conditions.

18 / 20

slide-47
SLIDE 47

BB MFG Variational formulations Density constraints for MFGs

An approximation argument for less regular cases

Let us consider in the problem (Pq) a cost Bq for a q ≤ d. By this the interior point condition for the constraint m ≤ m will be destroyed.

19 / 20

slide-48
SLIDE 48

BB MFG Variational formulations Density constraints for MFGs

An approximation argument for less regular cases

Let us consider in the problem (Pq) a cost Bq for a q ≤ d. By this the interior point condition for the constraint m ≤ m will be destroyed. Indeed, for instance for q = 2 and d ≥ 2 the natural space for w is L2(Ω)d, hence the maximal regularity for m is H1(Ω).

19 / 20

slide-49
SLIDE 49

BB MFG Variational formulations Density constraints for MFGs

An approximation argument for less regular cases

Let us consider in the problem (Pq) a cost Bq for a q ≤ d. By this the interior point condition for the constraint m ≤ m will be destroyed. Indeed, for instance for q = 2 and d ≥ 2 the natural space for w is L2(Ω)d, hence the maximal regularity for m is H1(Ω).→ no interior point for m ≤ m.

19 / 20

slide-50
SLIDE 50

BB MFG Variational formulations Density constraints for MFGs

An approximation argument for less regular cases

Let us consider in the problem (Pq) a cost Bq for a q ≤ d. By this the interior point condition for the constraint m ≤ m will be destroyed. Indeed, for instance for q = 2 and d ≥ 2 the natural space for w is L2(Ω)d, hence the maximal regularity for m is H1(Ω).→ no interior point for m ≤ m. A natural procedure to solve this issue: use an approximation of type B2 + εBq for B2, where q > d and take the limit as ε → 0.

19 / 20

slide-51
SLIDE 51

BB MFG Variational formulations Density constraints for MFGs

An approximation argument for less regular cases

Let us consider in the problem (Pq) a cost Bq for a q ≤ d. By this the interior point condition for the constraint m ≤ m will be destroyed. Indeed, for instance for q = 2 and d ≥ 2 the natural space for w is L2(Ω)d, hence the maximal regularity for m is H1(Ω).→ no interior point for m ≤ m. A natural procedure to solve this issue: use an approximation of type B2 + εBq for B2, where q > d and take the limit as ε → 0. For this we proved uniform (in ε) estimates for each term. We have |λε| + pεM + mεH1 + Hε(∇uε)L1 ≤ C. This implies in particular that ∆uεM ≤ C, which is enough to use again a Calder´

  • n-Zygmund-type argument and get

compactness for ∇uε.

19 / 20

slide-52
SLIDE 52

BB MFG Variational formulations Density constraints for MFGs

Thank you for your attention!

20 / 20