On the variational formulation of some stationary second order mean field games systems
Alp\'ar Rich\'ard M\'esz\'aros, Francisco J. Silva (XLIM-MATHIS)

TL;DR
This paper develops a variational method to prove the existence of solutions for second order stationary mean field games with Neumann boundary conditions, including cases with density constraints and multiple populations.
Contribution
It introduces a general variational framework that handles complex coupling terms, density constraints, and multi-population systems in mean field games.
Findings
Proves existence of solutions under broad conditions.
Extends previous results to systems with density constraints.
Applicable to multi-population mean field game systems.
Abstract
We consider the variational approach to prove the existence of solutions of second order stationary Mean Field Games on a bounded domain , with Neumann boundary conditions, and with and without density constraints. We consider Hamiltonians which growth as , where and . Despite this restriction, our approach allows us to prove the existence of solutions in the case of rather general coupling terms. When density constraints are taken into account, our results improve those in \cite{MesSil}. Furthermore, our approach can be used to obtain solutions of systems with multiple populations.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsNonlinear Partial Differential Equations · Geometric Analysis and Curvature Flows · Stochastic processes and statistical mechanics
On the variational formulation of some stationary second order mean field games systems
Alpár Richárd Mészáros
Department of Mathematics, UCLA, 520 Portola Plaza, Los Angeles, CA 90095, USA
and
Francisco J. Silva
Institut de recherche XLIM-DMI, Université de Limoges, 87060 Limoges, France
Abstract.
We consider the variational approach to prove the existence of solutions of second order stationary Mean Field Games on a bounded domain , with Neumann boundary conditions, and with and without density constraints. We consider Hamiltonians which growth as , where and . Despite this restriction, our approach allows us to prove the existence of solutions in the case of rather general coupling terms. When density constraints are taken into account, our results improve those in [MS15]. Furthermore, our approach can be used to obtain solutions of systems with multiple populations.
2010 AMS Subject Classification: 49K20; 35J47; 35J50; 49N70; 91A13
Keywords and phrases: Mean Field Games; weak solutions; variational formulation; density constraints; general couplings
1. Introduction
In this article we consider the stationary Mean Field Game (MFG) system
[TABLE]
introduced by Lasry and Lions in [LL06, LL07], which models the equilibrium configuration of an ergodic stochastic symmetric differential game with a continuum of small, indistinguishable players (see e.g. [Fel13]). In the above system, is a bounded domain with a smooth boundary, is the outward normal to , is the so-called local coupling function, is the Hamiltonian, and the variables , and represent the stationary equilibrium configuration of the players, the equilibrium cost of a typical player, and the ergodic constant, respectively. We have taken Neumann boundary conditions but our results admit natural versions for the more standard case of periodic boundary conditions.
An interesting feature of the solutions of (MFG1) is their connection with the long time behaviour of the solutions of time-dependent MFGs. We refer the reader to [CLLP12, CLLP13] for some results justifying rigorously this relation in some special cases. The numerical resolution of stationary second order MFGs has been studied in [AD10, CC16, AFG17, BAKS16].
Existence and uniqueness results for system (MFG1) have been investigated by several researchers using Partial Differential Equation (PDE) techniques, starting with the first papers [LL06, LL07] in the framework of weak solutions. The reader is referred to [Cir15, FG16, BF16, Cir16] for other subsequent results on the existence of weak solutions. In addition, under different assumptions on the coupling function and the growth of , the existence, and uniqueness, of smooth solutions have been analysed in [GPV14, GM15, PV17]. See also [GPSM12], where several a priori estimates for smooth solutions of stationary second order MFGs are established.
In this article we focus our attention on the proof of the existence of weak solutions of (MFG1) by variational techniques. Indeed, as pointed out already in [LL07], system (MFG1) can be seen, formally, as the first order optimality condition of an associated variational problem, involving a PDE constraint for the variable . It turns out that and in (MFG1) correspond to the Lagrange multipliers associated to the PDE constraint for and the condition , respectively. Given , where is the space dimension, and setting , we prove the above assertion for Hamiltonians growing as . Even if this growth condition is restrictive, but crucial for our arguments, the main interest of this variational technique is that it allows to prove the existence of weak solutions of (MFG1) for a rather general class of coupling functions in a straightforward manner. Indeed, as we will show in Section 3, does not need to be monotone (see also [Cir16, CGPSM16] for some recent results in this direction) and, moreover, we can prove the existence of solutions of variations of system (MFG1) involving couplings which can also depend on the distributional derivatives of . As a matter of fact, our results are valid, for terms in the r.h.s. of the first equation in (MFG1) which can be identified with the derivative of a function which is Gâteaux dfferentiable and weakly lower-semicontinuous.
Our approach follows closely the one in [MS15], which considers in addition a density constraint in order to model strong congestion effects (see [San12, CMS16]). In that article, the existence of solutions , where is the set of Radon measures on , to the system
[TABLE]
is established if is non-decreasing. If , the result is proved with a variational approach. On the other hand, when a penalization argument allows to prove the existence also in this case. In the present article, when , we improve the results in [MS15], and we show the existence of solutions of
[TABLE]
Note that in (MFG2) a more general Hamiltonian is considered and the density constraint is replaced by , where . Most importantly, does not need to be monotone and, using the Harnack’s inequality proved in [Tru73] (see also [BKRS15]) for elliptic equations in divergence form, we show that the density is strictly positive, which implies that in (1.1) is identically zero. Using the existence of solutions of the variational problem associated to (MFG2), which can be proved easily, we prove that the variational problem associated to (MFG1) admits at least one solution. This crucial fact is the key to show the existence of solutions of (MFG1).
The paper is organized as follows. In Section 2 we begin with some preliminaries which allow us to characterize the subdifferential of the cost functionals appearing in the optimization problems associated to (MFG1)-(MFG2). This analysis extends the one in [MS15, Section 2]. Section 3 is the core of the article. We prove the existence of solutions of the variational problems associated to (MFG1)-(MFG2) and we establish the corresponding optimality conditions, which provide the existence of solutions of (MFG1)-(MFG2). We present a detailed discussion concerning the generality of the coupling term, which, as we have explained before, is the main feature of this approach. We also prove, by a bootstrapping argument, additional regularity for the weak solutions. In Section 4, we present some simple applications of our results to the study of multi-populations MFG systems (see e.g. [Cir15, BF16]). Finally, in the appendix, we prove the strict positivity of the densities appearing in (MFG1)-(MFG2) as a consequence of the Harnack’s inequality in [Tru73] and the assumed regularity of the boundary .
2. Preliminary results
In the entire article, we will assume that () is a non-empty, bounded open set with a boundary . This regularity assumption is equivalent to a uniform interior and exterior ball condition (see for instance [Dal14, Theorems 1.8-1.9]) and allows us to use the classical Sobolev inequalities. The vector will denote the outward normal to . Given and we will denote by and the standard norms in (or in ) and , respectively.
Let . Our aim in this section is to provide a characterization of the subdifferential of the convex functional , defined as
[TABLE]
where is given by
[TABLE]
In view of the assumptions below, the function is well defined and convex (see Remark 2.1 and Theorem 2.4). It will appear in the cost functional of an optimization problem whose first order optimality condition has the form of an MFG system. In (2.2), for every the function is the Legendre-Fenchel transform of , where is a continuous function, that we will call the Hamiltonian, which is assumed to be strictly convex and differentiable in its second variable and satisfies a polynomial growth condition in terms of : there exist , such that
[TABLE]
Using the definition of , an easy computation shows that (2.3) implies
[TABLE]
Note that since is strictly convex and differentiable, we have that is also strictly convex and differentiable (see e.g. [Roc70, Theorem 26.3]). We denote their gradients by and , respectively. Moreover, classical results in convex analysis show that for any
[TABLE]
We now prove an elementary result which will be useful later. In the remainder of this article will denote by a generic constant which can change from line to line.
Lemma 2.1**.**
Under (2.3) we have that , and are continuous. Moreover, if we have that . Analogously, if then .
Proof.
Let and in be such that as . Set . By definition of
[TABLE]
Since is convergent, hence bounded, the first inequality in (2.3) shows that is bounded. Let be a limit point of . Then, using the continuity of and passing to the limit, up to some subsequence, we get that
[TABLE]
which shows that and any limit point of is equal to . The continuity of follows by the symmetric argument. Finally, if , setting , which is a measurable function since is continuous, we get by convexity that
[TABLE]
and so, by (2.4), we obtain the existence of such that . Using Young’s inequality, we get the existence of such that and thus, integrating in , we obtain that . The last assertion follows from an analogous argument. ∎
Regarding the dependence of on the space variable , we will assume that there exists a modulus of continuity which is uniform w.r.t. the second variable, i.e. such that , is continuous, non-decreasing and
[TABLE]
Using that is a compact set, a natural example of a Hamiltonian satisfying (2.3) and (2.6) is given by where and .
Following the analysis in [MS15, Lemma 2.1 and Theorem 2.2], presented in a more particular setting, we shall characterize the subdifferential of , defined in (2.1). Recall that given a normed space and a l.s.c. convex proper function , the subdifferential of at the point , consist in the set of all such that
[TABLE]
For the sake of completeness, in order to identify , we first state some simple properties of the function . Given consider the set
[TABLE]
Since is continuous and convex w.r.t. its second variable, we have that is closed and convex for any . Given a subset of an euclidean space, we denote by its characteristic function (in the sense of convex analysis), i.e. if and otherwise.
Lemma 2.2**.**
For all , the function is convex, proper and l.s.c. Its Legendre-Fenchel conjugate and its subdifferential are given by
[TABLE]
where, if , .
Proof.
Using (2.2), it is straightforward to check that for all we have
[TABLE]
and so is convex, proper and l.s.c. Using that is proper, we have that if or and . On the other hand, from (2.9), if , for any we have the identity
[TABLE]
which is checked to hold also when . Thus, since is closed and convex, . This expression directly yields that . If , then is differentiable and, by a simple computation, we get the expression of its gradient with respect to . ∎
Remark 2.1**.**
Notice that the equality in (2.10) shows that is lower-semicontinuous and so, by [RW98, Example 14.31], we have that is a normal integrand. This shows that is a measurable function if and are measurable (see [RW98, Proposition 14.28]). In particular, the functional is well defined.
Let us define
[TABLE]
and denote by and the subsets of nonnegative and nonpositive finite Radon measures of , respectively. For a set , we denote by its indicator function, i.e. if and otherwise.
Lemma 2.3**.**
The closure of in is given by
[TABLE]
or equivalently,
[TABLE]
*where is the Lebesgue decomposition of the measure w.r.t. the Lebesgue measure restricted to . *
Proof.
Let us take converging to in By definition of one has
[TABLE]
Since in , up to some subsequence a.e. in . By (2.3) we can use Fatou’s lemma to obtain that
[TABLE]
Using (2.3) again, we obtain that defines a nonpositive distribution, hence by [Sch66, Théorème V] can be identified with an element of
Conversely let us take belonging to the right-hand-side (r.h.s.) of (2.12), or equivalently to the r.h.s. of (2.13). Analogously to [MS15], we construct different approximations for and on the one hand and for on the other hand. For and we set . Consider a mollifier satisfying that , , and for all . Now, for set
[TABLE]
and for all and , let us define
[TABLE]
As , we have that in , in and . Multiplying the inequality in (2.13) by , integrating and using Jensen’s inequality yield
[TABLE]
where
[TABLE]
Note that (2.6) implies that
[TABLE]
and so . Using that converges in to , extracting a subsequence, the first inequality in (2.15) implies that a.e. in . Since for we have that , we get from [EG92, Chapter 1.3, Theorem 4] that in . This implies that and in .
Now, in order to approximate the singular part , for and let us define and
[TABLE]
which is a non-positive function. Arguing exactly as in the proof of [MS15, Lemma 2.1] we get that the uniform interior ball assumption on the boundary implies that . Using that in , as , it is straightforward to show that in . Therefore, the sequence in and for all . Using that , and so by the Sobolev embedding, we have that weakly in . Since is convex, its closure w.r.t. the weak and strong topologies coincide. The result follows. ∎
For a given representative of in , we denote and .
Theorem 2.4**.**
*The following assertions hold true:
(i) The functional , defined in (2.1), is convex, l.s.c. and for all .
(ii) Let and suppose that . Then, if we have that . Otherwise, is subdifferentiable at and*
[TABLE]
In particular, the singular part of in (2.16), w.r.t. to the Lebesgue measure, is concentrated in .
Proof.
Since the arguments are similar to those in the proof of [MS15, Theorem 2.2], we only sketch the main ideas. First, truncating the sets , defined in (2.7), by setting for
[TABLE]
using Lemma 2.2 and the monotone convergence theorem, we have that
[TABLE]
Characterizing the point-wise optimizers in the last expression, it easy to see that is a measurable function, which by definition belongs to . Using this fact and the monotone convergence theorem once again, we find that
[TABLE]
Since is closed and convex in , assertion (i) follows. Using that implies that a.e. where , the definition of implies that
[TABLE]
An element maximizes the above expression iff for a.e. we have that . Since , if Lemma 2.1 implies that the previous relation cannot be satisfied and so . On the other hand, if then any satisfying a.e. in that optimizes the last expression in (2.17). Therefore, using the definition of we readily get that if , then
[TABLE]
The result follows. ∎
Remark 2.2**.**
A generalization of the previous result to the case when could be interesting by extending the techniques in [Bré72]. However, since our results in the next section are intrinsically related to the assumption , we have preferred to provide a direct and self-contained proof in this case.
3. The variational problems
Let us fix In order to define the variational problems we are interested in, we introduce first the data and our assumptions. Let
[TABLE]
and be such that
[TABLE]
Given let us consider the following elliptic PDE, with Neumann boundary conditions,
[TABLE]
We say that is a weak solution of (3.2) if
[TABLE]
Let us use the notation . Since, , the results in [GM12, Section 7.1] and [MS15, Appendix] imply the existence of a unique such that is a weak solution of (3.3) and . Moreover, there exists such that
[TABLE]
and so, by the Poincaré-Wirtinger inequality, there exists such that
[TABLE]
Note that (3.3) can be written as , with and being linear bounded operators defined as
[TABLE]
where denotes the duality product between and . Now, let us define and as
[TABLE]
The first variational problem we consider is
[TABLE]
In the second variational problem we impose a density constraint: let be such that
[TABLE]
Given a representative of , still denoted by , we define the set
[TABLE]
We consider the problem
[TABLE]
Note that and the Sobolev embeddings imply that and so the constraint in (P2) is well-defined.
Remark 3.1**.**
Theorem 2.4(i)* and (3.1) imply that the cost functional in (P1) and (P2) is weakly lower semicontinuous. On the other hand, it is not necessarily convex.*
3.1. Existence of solutions of the variational problems
In this subsection we prove that both problems (P1) and (P2) admit at least one solution. The proof of existence of solutions of problem (P2) follows the same lines than the proof of [MS15, Theorem 3.1]. The proof of existence of solutions for problem (P1) introduces an artificial density constraint and uses the existence of solutions of (P2). Given a Lebesgue measurable set we denote by its Lebesgue measure.
Theorem 3.1**.**
Assume that (3.1) holds. Then, problem (P2) has at least one solution . If in addition, is bounded from below in , by a constant , then problem (P1) also admits at least one solution . Moreover, in the latter case,
[TABLE]
where and satisfy (2.3) and and depend only on the geometry of .
Proof.
We first prove the assertion for problem (P2), where the density constraint allows to obtain directly some bounds on any minimizing sequence. Define
[TABLE]
By the surjectivity result in [MS15, Lemma A.1], there exists such that . By (2.4), we have that
[TABLE]
which implies that the infimum in (P2) is not . Now, let be a minimizing sequence and set . The previous discussion implies the existence of such that for all . In particular, by (2.2), a.e. on the set . Since is feasible, we get that and so (2.4) and (3.1), with , imply that
[TABLE]
Therefore, the sequence is bounded in and so, by (3.5), the sequence is bounded in . Therefore, extracting a subsequence, we obtain the existence of such that converges weakly to in and converges weakly to in . By passing to the weak limit, we get that and . Finally, using that is weakly lower semicontinuous we get that solves (P2).
Now, let us prove existence for (P1) under the additional assumption on the boundedness from below of in . Let . Since is feasible for problem (P2), with , we have that (P2) admits at least one solution. We will show that any such solution satisfies that for some constant which is independent of . This will prove the result since any solution of with solves (P1). Indeed, if there is a feasible for problem (P1) such that then since there exists such that (because ) we have that , where is a solution of with , and which contradicts the optimality of in (P2) with .
Let us denote by a constant such that for all and by the constant in (3.5). Thus, any solution of satisfies that
[TABLE]
Now, let us fix a solution of (P2) with . If , then , so let us assume that and so . Since vanishes a.e. in , arguing as in (3.9) we get that
[TABLE]
Since (2.4) implies that , we find that
[TABLE]
and so
[TABLE]
The result follows.
∎
3.2. Existence of solutions of the Mean Field Game systems
We recall that for a non-empty closed and convex set , the normal cone to at is defined as . We have the following existence result.
Theorem 3.2**.**
Assume that (3.1) holds and that is bounded from below in . Then, there exists such that
[TABLE]
where the second equation, with its boundary condition, is satisfied in the weak sense (see (3.3)).
Proof.
Theorem 3.1 yields the existence of a solution of problem (P1). By definition,
[TABLE]
where . Since is finite, the Gâteaux differentiability of and the convexity of imply that
[TABLE]
where we have denoted by the duality product between and . Taking in the last term of the previous inequality, we get that
[TABLE]
from which . Set . Since and is finite and continuous at (since ), we have (see e.g. [ABM06, Theorem 9.5.4(b)])
[TABLE]
In particular and so, by Theorem 2.4(ii), . Lemma A.1, in the appendix, implies that in , hence Theorem 2.4(ii) implies that
[TABLE]
On the other hand, by [MS15, Lemma A.1] we have that is surjective and so (see e.g. [BS00])
[TABLE]
Therefore, since , we get the existence of such that
[TABLE]
Thus, defining and we get the first equation in (3.11). On the other hand, since and , the remaining equations in (3.11) also hold true. ∎
The proof of the following result, concerning problem (P2), is analogous to the previous one (see also Theorem 4.1 and Corollary 4.2 in [MS15]), hence we omit it. Notice, however, that the extra assumption on the global lower bound for is not needed, since existence also holds true when we only assume (3.1) (see Theorem 3.1).
Theorem 3.3**.**
Assume that (3.1) holds. Then, there exists such that
[TABLE]
where the second equation, with its boundary condition is satisfied in the weak sense (see (3.3)).
Remark 3.2**.**
In the above theorem, the variable plays the role of the Lagrange multiplier associated to the density constraint .
We discuss now the uniqueness of solutions of systems (3.11) and (3.14) under a convexity assumption on .
Proposition 3.4**.**
If is strictly convex in then the solutions of (3.11)-(3.14) are unique.
Proof.
Let us consider first (3.11). Since is convex, (P1) is a convex problem and so if solves (3.11) then solves (P1). Thus, the uniqueness of is a straightforward consequence of the strict convexity of . Since and for all the map is injective and is strictly convex we have that is unique. Thus, uniqueness of in follows and, as a consequence, the first equation in (3.11) yields the uniqueness of . The proof of uniqueness of for system (3.14) is the same as the previous one. By considering test functions supported in we get the uniqueness of , from which the uniqueness of follows. ∎
Remark 3.3**.**
The previous uniqueness result for solutions of (3.14) improves the one stated in [MS15, Remark 4.2].
Let us detail the novelty of our results. Compared to [MS15], when , we consider more general Hamiltonians and we prove that is strictly positive in which allows us to eliminate the Lagrange multiplier from the system in [MS15]. As we have seen, we can also get rid of the density constraint and prove, using variational methods, the existence of solutions of (3.11). Most importantly, we can consider, for both systems (3.11) and (3.14), rather general right-hand sides for the HJB equation, since we allow to be non-convex. As an example of a class of functions we can deal with in (3.11), we consider
[TABLE]
where is a Carathéodory function, i.e. for all we have is measurable and for a.e. the function is continuous. In addition, suppose that:
- (i)
For a.e. and all the function is convex.
- (ii)
For all there exists such that for a.e.
[TABLE]
- (iii)
For a.e. the function is differentiable. Moreover, for all there exists and such that for a.e.
[TABLE]
- (iv)
For all there exists , and such that for a.e. , and we have that
[TABLE]
Since , assumptions (i)-(ii) imply the weak lower semi-continuity of (see e.g. [Dac08, Corollary 3.24]), conditions (ii)-(iii) imply that for all and the last condition (iv) implies that is Gâteaux differentiable at every (see e.g. the proof of [Dac08, Theorem 3.37]). Thus, assumption (3.1) for is satisfied in this case. The Gâteaux derivative of at is given by linear continuous functional
[TABLE]
for all . We obtain the following corollary of Theorem 3.2 and of Theorem 3.3 when is independent of .
Corollary 3.5**.**
Let be a Carathéodory function. Assume that for all there exist , such that for a.e.
[TABLE]
Then, (MFG2) admits at least one solution . If, in addition, there exists such that for a.a. and , then system (MFG1) admits at least one solution . In both cases, we have the additional regularity for all
Proof.
Consider in (3.15). Since (3.17) implies (3.1), existence of a solution of (MFG2) follows directly from Theorem 3.3. Analogously, for all implies that has a global lower bound on . Hence, existence of a solution of (MFG1) follows directly from Theorem 3.2. Since in both systems , assumption (3.17) also implies that and the regularity for (), in both systems, follows from [Sta65, Théorème 9.1]. ∎
Now, we comment on some other possible choices of .
Remark 3.4**.**
(i)* A simple and interesting example is given by , where . In this case, if and , otherwise. Thus, the assumptions of Theorem 3.5 and Proposition 3.4 are satisfied and so systems (MFG1) and (MFG2) admits unique solutions. Note that the growth of is arbitrary, showing one the advantages of the variational approach (compare with [GPV14, Cir15, PV17] where the growth of is restricted). On the other hand, if we consider , its primitive is not bounded from below in and the assumptions of Theorem 3.5 are not satisfied for problem (MFG1). However, they are satisfied for (MFG2) and the existence of at least one solution to (MFG2) is ensured also in this case.
(ii) In order to exemplify the possible dependence of on , let us take . In this case Theorem 3.2 yields the existence of weak solution of*
[TABLE]
*Moreover, by Proposition 3.4, the solution is unique.
(iii) We can also consider a non-local dependence on . For instance, setting , where is the distance function to , we can take as before and*
[TABLE]
for some given regular kernels supported on . In this case, it is easy to check that (3.1) holds without requiring the convexity of .
Now let be a Carathéodory function satisfying that there exists such that for a.e. and . Moreover, assume that for all there exists such that for a.e. and we have that . Under these assumptions, Corollary 3.5 ensures the existence of at least one solution of (MFG1). Using a bootstrapping argument, we show in the next result some additional local regularity properties for .
Proposition 3.6**.**
Consider the above setting and suppose that belongs to for some and that is Hölder continuous, uniformly on . Then, there exist , such that
[TABLE]
Proof.
Step 1. We show that there exists such that . By the classical Sobolev embeddings, this implies that (for some ). Let . By Corollary 3.5, we have that and so, by (2.3), we have that . Furthermore, since and , the classical regularity theory for elliptic equations (see [GT83]) implies that . In particular, the Sobolev inequality (see e.g. [Ada75]) yields and so with . We easily check that and so we improve the regularity of to obtain that . Thus, if we obtain the first relation in (3.18). Otherwise, for , inductively we define the sequence . Since and , we get that if . Therefore, after a finite number of steps we get the existence of such that and with .
Step 2. Let us prove that for some . Since and , we already have that is Hölder continuous. Having , this implies that hence , for some . Using a Schauder-type estimate (see [GM12, Theorem 5.19]) we get that for some . ∎
Remark 3.5**.**
If satisfies (3.17), with for some , and solves (MFG2), we have that admits the regularity (3.18) locally in the open set (see [MS15, Proposition 4.3] for a similar result in a simpler case).
4. An application to multipopulation systems
In this section we show a simple application of our results to the study of systems of the form
[TABLE]
where (see [Cir15, BF16]). Here describes the densities of populations. The Hamiltonians () are supposed to satisfy the assumptions in Section 2 (see in particular (2.3)). The given functions () are such that for all the function is measurable and for a.e. the function is continuous. Suppose that
[TABLE]
where we have denoted
[TABLE]
Moreover, we assume that for all
[TABLE]
and that
[TABLE]
We have the following result:
Proposition 4.1**.**
Suppose that for all the function satisfies (4.1), (4.2) and (4.3). Then, system (MFGN) admits at least one solution , and , where, for all , and (for all ).
Proof.
Let us define as
[TABLE]
Consider the space , endowed with the weak-topology, and the set-valued map defined as
[TABLE]
where . By Theorem 3.1, the embedding and our assumptions, we have that is a non-empty compact set for all . Assumption (4.3) implies that is also convex. Moreover, by (3.7) and (4.2), for we have the existence of , independent of , such that and for all and such that . Therefore, defining
[TABLE]
we have that . Now, let us prove that is upper-semicontinuous, i.e. is closed for all closed sets . Indeed, let such that . By definition, we have the existence of such that
[TABLE]
By (3.7) we have that is bounded in and so, up to some subsequence, there exists such that in and so, since is closed, . Under our assumptions, the Lebesgue’s dominated convergence theorem implies the weak continuity of in , and so we can pass to the limit to obtain that . By Kakutani fixed-point theorem, there exists such that . The result follows from Corollary 3.5. ∎
Remark 4.1**.**
(i)* As we pointed out, the result in Proposition 4.1 is a simple consequence of the variational method we presented in the previous sections. We refer the reader to [Cir15, CV16, BF16, ABC17] for a more detailed study, and sharper results, based on PDE arguments tackling directly system (MFGN).
(ii) The local regularity results presented in Proposition 3.6 for the one-population case directly extend to the solutions of system (MFGN).*
We can also consider the instance of (MFGN) where the functions () satisfy that there exists a Carathéodory function function such that for a.e. the function is differentiable and for all we have that
[TABLE]
As suggested in [Cir15, Remark 15], in this case system (MFGN) can be found as the optimality condition of the optimization problem
[TABLE]
Indeed, suppose that satisfies that there exists such that
[TABLE]
Moreover, suppose that for all there exists such that
[TABLE]
Then, arguing as in the proof of Theorem 3.1, we get the existence of a solution , of (PN), and so, mimicking the proof of Theorem 3.2, we get the following result:
Proposition 4.2**.**
Suppose that , , satisfy (4.4), with satisfying (4.5)-(4.5). Then, system (MFGN) admits at least one solution , and , where, for all , and (for all ).
Note that (4.4) is restrictive. On the other hand, the previous result does not require the strong boundedness condition (4.2) and the monotonicity assumption (4.3). Moreover, this framework allows us to introduce density constraints of the form , where
[TABLE]
We suppose that satisfies , for all , and the weights satisfy
[TABLE]
Condition (4.7) implies that if for all we define and , where is such that (we know that such exists by [MS15, Lemma A.1]), then , are feasible for problem
[TABLE]
and is an interior point to the constraint , i.e. for all . Therefore, we can argue as in the proof of Theorem 3.1 to show the existence of at least one solution of () and then, following the proof of Theorem 3.1 (see also the proofs of Theorem 4.1 and Corollary 4.2 in [MS15]), we get the following result:
Proposition 4.3**.**
Suppose that for all the function satisfies the assumptions of Proposition 4.2. Moreover, assume that (4.7) holds. Then system
[TABLE]
with
[TABLE]
admits at least one solution , , and , where, for all , , (for all ) and .
Acknowledgements
The second author was partially supported by the ANR (Agence Nationale de la Recherche) project ANR-16-CE40-0015-01 and by the Gaspar Monge Program for Optimization and Operation Research (PGMO) via the project PASTOR. Both authors were partially supported by the PGMO via the project VarMFGPDE. The authors also thank M. Cirant for suggesting them to look carefully whether some Harnack inequality holds in their framework. This observation led the authors to find the useful references in [BKRS15] and improve the results in the present paper.
Appendix A
We prove in this appendix a lemma which is crucial to show the strict positivity of the densities in (MFG1) and (MFG2).
Lemma A.1**.**
Assume that satisfies the assumptions at the beginning of Section 2, and let . Suppose that is a weak solution of
[TABLE]
Then, for all
Proof.
Since (), by the Harnack’s inequality proved in [Tru73] (see also [BKRS15, Corollary 1.7.2]) we have that for all . It remains to study the positivity of on the boundary . To achieve this, we use a standard reflection argument following [Nit11]. Let . Since is supposed to be Lipschitz domain, in a neighborhood of the boundary can be represented as the graph of a Lipschitz function . Without loss of generality for these local considerations we may suppose that and that
[TABLE]
for some small (otherwise one can perform some isometric transformations on under which all the hypotheses that we assumed on the data remain invariant). We have denoted by and the balls of radius centered at in and , respectively.
Consider a strip-like domain
[TABLE]
such that
[TABLE]
Defining as we have that is a bi-Lipschitz map (an injective Lipschitz continuous map whose inverse is also Lipschitz continuous) and
[TABLE]
for a.e. ( denotes the identity matrix). Define the reflection map as
[TABLE]
which clearly leaves the points on invariant and satisfies that for all . Differentiating both sides of (A.1) yields for a.e.
[TABLE]
from where we get
[TABLE]
Thus, , for every , and is bounded on . Note that since does not depend on we have that
Let us introduce some notations. We set and for , we define as and
[TABLE]
the a.e. extension of to (the definition on is irrelevant since this set is -negligible). Arguing as in [Nit11, Lemma 3.3], if , we have that , and for a.e. .
Now, since satisfies (3.3) (with ) for tests functions , defining as
[TABLE]
(where is understood componentwise), the pair solves a similar equation on with test functions . Indeed, let us take and compute
[TABLE]
where we have used the fact that both and (restricted to ) are admissible test functions in (3.3), a change of variable in the integrals and the properties that we have shown for .
The regularity of and [BKRS15, Corollary 1.7.2] imply that . The result follows. ∎
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[ABC 17] Y. Achdou, M. Bardi, and M. Cirant. Mean field games models of segregation. Math. Models Methods Appl. Sci. , 27(1):75–113, (2017).
- 2[ABM 06] H. Attouch, G. Buttazzo, and G. Michaille. Variational analysis in Sobolev and BV spaces. Applications to PD Es and optimization . MPS/SIAM Series on Optimization, (SIAM), Philadelphia, (2006).
- 3[AD 10] Y. Achdou and I. Capuzzo Dolcetta. Mean field games: Numerical methods. SIAM Journal of Numerical Analysis , 48-3:1136–1162, (2010).
- 4[Ada 75] R. A. Adams. Sobolev spaces . Academic Press New York-London, (1975). Pure and Applied Mathematics, Vol. 65.
- 5[AFG 17] N. Almulla, R. Ferreira, and D. Gomes. Two numerical approaches to stationary mean-field games. Dynamic Games and Applications , (2017). to appear.
- 6[BAKS 16] L. Briceno-Arias, D. Kalise, and F.J. Silva. Proximal methods for mean field games with local couplings. Preprint, (2016).
- 7[BF 16] M. Bardi and E. Feleqi. Nonlinear elliptic systems and mean-field games. No DEA Nonlinear Differential Equations Appl. , 23(4):Art. 44, 32, (2016).
- 8[BKRS 15] V.-I. Bogachev, N.-V. Krylov, M. Röckner, and S.-V. Shaposhnikov. Fokker-Planck-Kolmogorov equations , volume 207 of Mathematical Surveys and Monographs . American Mathematical Society, Providence, RI, (2015).
