On Numerical approximations of fractional and nonlocal Mean Field Games
Abstract.
We construct numerical approximations for Mean Field Games with fractional or nonlocal diffusions. The schemes are based on semi-Lagrangian approximations of the underlying control problems/games along with dual approximations of the distributions of agents. The methods are monotone, stable, and consistent, and we prove convergence along subsequences for (i) degenerate equations in one space dimension and (ii) nondegenerate equations in arbitrary dimensions. We also give results on full convergence and convergence to classical solutions. Numerical tests are implemented for a range of different nonlocal diffusions and support our analytical findings.
Key words and phrases:
Mean Field Games, jump diffusion, anomalous diffusion, nonlocal operators, fractional PDEs, nonlocal PDEs, degenerate PDEs, semi-Lagrangian scheme, convergence, compactness, Fokker-Planck equations, Hamilton-Jacobi-Bellman equations, duality methods2020 Mathematics Subject Classification:
35Q89, 47G20, 35Q84, 49L12, 45K05, 35K61, 65M12, 91A16, 65M22, 35R11 , 35R06,1. Introduction
In this article we study numerical approximations of Mean Field Games (MFGs) with fractional and general non-local diffusions. We consider the mean field game system
(1) |
where
(2) |
is a nonlocal diffusion operator (possibly degenerate), is a Lévy measure (see assumption (0): ), and the adjoint is defined as for .
The first equation in (1) is a backward in time Hamilton-Jacobi-Bellman (HJB) equation with terminal data , and the second equation is a forward in time Fokker-Planck-Kolmogorov (FPK) equation with initial data . Here is the Hamiltonian, and the system is coupled through the cost functions and . There are two different types of couplings: (i) Local couplings where and depend on point values of , and (ii) non-local or smoothing couplings where they depend on distributional properties induced from through integration or convolution. Here we work with nonlocal couplings.
A mathematical theory of MFGs were introduced by Lasry–Lions [49] and Caines–Huang–Malhame [44], and describes the limiting behavior of -player stochastic differential games when the number of players tends to [18]. In recent years there has been significant progress on MFG systems with local (or no) diffusion, including e.g. modeling, wellposedness, numerical approximations, long time behavior, convergence of Nash equilibria, and various control and game theoretic questions, see e.g. [5, 27, 18, 13, 39, 43] and references therein. The study of MFGs with ‘non-local diffusion’ is quite recent, and few results exist so far. Stationary problems with fractional Laplacians were studied in [30], and parabolic problems including (1), in [33] and [37]. We refer to [48] and references therein for some development using probabilistic methods.
The difference between problem (1) and standard MFG formulations lies in the type of noise driving the underlying controlled stochastic differential equations (SDEs). Usually Gaussian noise is considered [49, 51, 20, 26, 5], or there is no noise (the first order case) [17, 19]. Here the underlying SDEs are driven by pure jump Lévy processes, which leads to nonlocal operators (2) in the MFG system. In many real world applications, jump processes model the observed noise better than Gaussian processes [9, 50, 34, 54]. Prototypical examples are symmetric -stable processes and their generators, the fractional Laplace operators . In Economy and Finance the observed noise is not symmetric and -stable, but rather non-symmetric and tempered. A typical example is the one-dimensional CGMY process [34] where for and . Such models are covered by the results of this article. Our assumptions on the nonlocal operators (cf. (1): ) are quite general, allowing for degenerate operators and no restrictions on the tail of the Lévy measure .
There has been some development on numerical approximations for MFG systems with local operators. Finite difference schemes for nondegenerate second order equations have been designed and analyzed e.g. by Achdou et al. [1, 2, 3, 4, 7, 8, 6] and Gueant [40, 42, 41]. Semi-Lagrangian (SL) schemes for MFG system have been developed by Carlini–Silva both for first order equations [23] and possibly degenerate second order equations [24]. Other numerical schemes for MFGs include recent machine learning methods [28, 29, 52] for high dimensional problems. We refer to the survey article [6] for recent developments on numerical methods for MFG. We know of no prior schemes or numerical analysis for MFGs with fractional or nonlocal diffusions.
In this paper we will focus on SL schemes. They are monotone, stable, connected to the underlying control problem, easily handles degenerate and arbitrarily directed diffusions, and large time steps are allowed. Although the SL schemes for HJB equations have been studied for some time (see e.g. [38, 16, 14, 35]), there are few results for FPK equations (but see [25]) and the coupled MFG system. For nonlocal problems we only know of the results in [15] for HJB equations.
Our contributions
A. Derivation. We construct fully discrete monotone numerical schemes for the MFG system (1). These dual SL schemes are closely related to the underlying control formulation of the MFG. In our case it is based on the following controlled SDE:
where is the control and a pure jump Lévy process (cf. (6)). Note that can be decomposed into small and large jumps, where the small jumps may have infinite intensity. We derive our approximation in several steps:
- 1.
-
2.
(SL scheme for HJB) We discretise the resulting SDE from step 1 in time and approximate the noise by random walks and approximate compound Poisson processes in the spirit of [15] (Section 3.1). From the corresponding discrete time optimal control problem, dynamic programming, and interpolation we construct an SL scheme for the HJB equation (Section 3.2).
- 3.
-
4.
(Dual SL scheme for FPK) The control of step 3 and the scheme in step 2 define a controlled approximate SDE with a corresponding discrete FPK equation for the densities of the solutions. We explicitly derive this FPK equation in weak form, and obtain the final dual SL scheme taking test functions to be linear interpolation basis functions (Section 3.4).
See (18) and (24) in Section 3 for the specific form of our discretizations. These seem to be the first numerical approximations of MFG systems with nonlocal or fractional diffusion and the first SL approximations of nonlocal FPK equations. Our dual SL schemes are extensions to the nonlocal case of the schemes in [23, 24, 25], but a clear derivation of such type of schemes seems to be new. The schemes come in the form of nonlinear coupled systems (27) that need to be resolved numerically. We prove existence of solutions using fixed point arguments, see Proposition 3.4.
B. Analysis. We establish a range of properties for the scheme including monotonicity, consistency, stability, (discrete) regularity, convergence of individual equations, and convergence to the full MFG system.
-
1.
(HJB approximation) For the approximation of the HJB equation we prove pointwise consistency and uniform discrete , Lipschitz, and semiconcavity bounds. Convergence to a viscosity solution is obtained via the half relaxed limit method [12].
-
2.
(FKP approximation) We prove consistency in the sense of distributions, preservation of mass and positivity, -stability, tightness, and equi-continuity in time. In dimension , we also prove uniform -estimates for all . Convergence is obtained from compactness and stability arguments.
-
3.
(The full MFG approximation) We prove convergence along subsequences to viscosity-very weak solutions of the MFG system in two cases: (i) Degenerate equations in dimension , and (ii) non-degenerate equation in under the assumption that solutions of the HJB equation are in space. Full convergence follows for MFGs with unique solutions, and convergence to classical solutions follows under certain regularity and weak uniqueness conditions. Applying the results to the setting of [37], we obtain full convergence to classical solutions in this case.
Because of the nonlocal or smoothing couplings, the HJB approximation can be analysed almost independently of the FKP approximation. The analysis of the FKP scheme on the other hand, strongly depends on boundedness and regularity properties of solutions of the HJB scheme. Compactness in measure is enough in the nondegenerate case when the HJB equation has solutions, while stronger weak () compactness in for some is needed in the degenerate case. As in [23], we are only able to prove this latter compactness in dimension . A priori estimates and convergence for seems to be new also for local MFGs.
In this paper we study general Lévy jump processes and nonlocal operators. This means that the underlying stochastic processes may not have first moments whatever initial distribution we take (like e.g. -stable processes with ), and then we can no longer work in the commonly used Wasserstein-1 space for the FKP equations. Instead we work in the space of probability measures under weak convergence metrizised by the Rubinstein-Kantorovich metric (see Section 2). Surprisingly, a result from [31] (Proposition 6.1) allow us to prove tightness and compactness in this space without any moment assumptions! We refer to section 4.3 for a more detailed discussion along with convergence results in the traditional topology when first moments are available.
This setting can be adapted to local problems, to give results also there without moment assumptions. Finally, we note that our results for degenerate problems cover the first order equations and improve [23] in the sense that more general initial distributions are allowed: for some instead of for some .
C. Testing. We provide several numerical simulations. In Example 1 and 2 we use a similar setup as in [24], comparing the effects of a range of different diffusion operators: Fractional Laplacians of different powers, CGMY-diffusions, a degenerate diffusion, a spectrally one-sided diffusion, as well as classical local diffusion and the case of no diffusion. In Example 3 we solve the MFG system on a long time horizon and observe the turnpike property in a nonlocal setting. Finally, in Example 4 we study the convergence of the scheme.
Outline of the paper
In section 2 we list our assumptions and state mostly known results of the MFG system (1) and its individual HJB and FKP equations. In section 3 we construct the discrete schemes for the HJB, FKP, and full MFG equations from the underlying stochastic control problem/game. The convergence results are given in Section 4, along with extensions and a discussion section. In sections 5 and 6 we analyze the discretisations of the HJB and FKP equations respectively, including establishing a priori estimates, stability, and some consistency results. Using these results, we prove the convergence results of section 4 in section 7. In section 8 we provide and discuss numerical simulations of various nonlocal MFG systems. Finally, there are three appendices with proofs of technical results.
2. Assumptions and Preliminaries
We start with some notation. By we mean various constants which may change from line to line. The Euclidean norm on any -type space is denoted by . For any subset or , and for any bounded, possibly vector valued function on , we will consider -spaces and spaces of bounded continuous functions. Often we use the notation as an alternative notation for the norms in or . The space is the subset of with bounded and continuous derivatives, and for , is the subset of with bounded and continuous derivatives in time and in space. By we denote the set of probability measure on . The Kantorovich-Rubinstein distance on the space is defined as
where . We define the Legendre transform of as:
We use the following assumptions for equation (1):
- (0):
-
(Lévy condition) is a positive Radon measure that satisfies
- (1):
-
(Growth near singularity) There exists constants and such that the density of for satisfies
- (L0):
-
(Continuity and local boundedness) The function is continuous in , and for any , there exists such that
- (L1):
-
(Convexity and growth) The function is convex in and satisfies
- (L2):
-
(Lipschitz regularity) There exists a constant independent of , such that
- (L3):
-
(Semi-concavity) There exists a constant independent of , such that
- (F1):
-
(Uniform bounds) There exists constants such that
- (F2):
-
(Lipschitz assumption) There exists constants such that
- (F3):
-
(Semi-concavity) There exists constants such that
- (M):
-
(Initial condition) We assume .
- (M’):
-
The dimension , and for some .
By (L1): , the Legendre transform is welldefined and the optimal is . To study the convergence of the numerical schemes we further assume local uniform bounds on the derivatives of Hamiltonian:
- (H1):
-
The function , and for every , there is a constant such that for every and we have .
- (H2):
-
The function . For every there exists a constant such that for every and we have
Remark 2.1.
We impose most of the conditions on , and not on , as appears in optimal control problem, which would be the basis of our semi-Lagrangian approximation. Assumptions (L1): and (L2): (but, not (L3): !) would immediately carry forward to the corresponding Hamiltonian from the definition of Legendre transform. Whereas, we require to assume (H1): –(H2): on , in contrary to the other assumptions, as it does not follow from the condition on in general. However, when the Lagrangian behaves like in variable for large and , the growth of the corresponding Hamiltonian would be in variable for large (cf. [32, Proposition 2.1]). The growth of the derivatives of for large can be computed similarly, which would correspond to similar condition as in (H1): –(H2): .
In most of this paper solutions of the HJB equation in (1) are interpreted in the viscosity sense, we refer to [46] and references therein for general definition and wellposedness results, while solutions of FPK equation in (1) are considered in the very weak sense defined as follows:
Definition 2.2.
Remark 2.3.
Definition 2.4.
Proposition 2.5.
(a) (Comparison principle) If is a viscosity subsolution and is a viscosity supersolution of the HJB equation in (1) with , then .
(b) There exists a unique bounded viscosity solution of the HJB equation in (1), and for any we have .
Proof.
These results are by now standard: (a) follows by a similar argument as for [46, Theorem 3.1], (b) follows by e.g. Perron’s method, and (c) by adapting the comparison arguments of [46] in a standard way. We omit the details. Under some extra assumptions, (b) and (c) also follows from Theorem 5.4 and Lemma 5.3 below. ∎
Proposition 2.6.
(a) If , then there exists a very weak solution of the FPK equation in (1).
Proof.
Existence and uniqueness results are given in [37] for classical solutions of MFGs with nonlocal diffusions under additional assumptions:
- (2):
-
(Growth near singularity) There exists constants and such that the density of for satisfies
- (F4):
-
There exists constants , such that and for all .
- (F5):
-
and satisfy monotonicity conditions:
- (H3):
-
The Hamiltonian , and for every there is such that for , , , , then .
- (H4):
-
For every there is such that for : .
- (H5):
-
(Uniform convexity) There exists a constant such that .
- (M”):
-
The probability measure has a density (also denoted by ) .
Theorem 2.7.
(a) There exists a classical solution of (1) such that and .
This is a consequence of [37, Theorem 2.5 and Theorem 2.6]. We refer to [37] for more general results, where in particular assumptions (1): and (2): can be relaxed to allow for a much larger class of nonlocal operators . In the nondegenerate case, for the individual equations in (1) we also have uniqueness of viscosity-very weak solutions and existence of classical solutions. Uniqueness for HJB equations and existence for HJB and FPK equations follows by Theorem 5.3, Theorem 5.5, and Proposition 6.8 in [37]. We prove uniqueness for very weak solutions of FPK equations here.
Proposition 2.8 (Uniqueness for the FPK equation).
Proof.
Let be two very weak solutions, define and take any . For any , the terminal value problem
has a unique classical solution essentially by [37, Theorem 5.5] (the result follows from Proposition 5.8 with and the observation that the proof of Theorem 5.5 also holds for ). Using the definition of very weak solution (see Remark 2.3) we get
for any . Since was arbitrary, it follows that in for every , and uniqueness follows. ∎
3. Discretisation of the MFG system
To discretise the MFG system (1), we first follow [15] and derive a Semi-Lagrange approximation of the HJB equation in (1). Using this approximation and the optimal control of the original problem, we derive an approximation of the FPK equation in (1) which is in (approximate) duality with the approximation of the HJB-equation.
This derivation is based on the following control interpretation of the HJB equation. For a fixed given density , the solution of the HJB equation in (1) is the value function of the optimal stochastic control problem:
(4) |
where is an admissible control, is the total cost to be minimized,
(5) |
and solves the controlled stochastic differential equation (SDE)
(6) |
where a Poisson random measure with intensity/Lévy measure , and is the compensated Poisson measure.111The -integral is just a (difficult way of writing a) compound Poisson jump-process, while the -integral is a centered jump process with an infinite number of (small) jumps per time interval a.s. [9].
3.1. Approximation of the underlying controlled SDE
A. Approximate small jumps by Brownian motion.
First we approximate small jumps in (6) by (vanishing) Brownian motion222To avoid singular integrals and infinite number of jumps per time interval. (cf. [10]): For , let solve
(7) |
where is a standard Brownian motion, , and
(8) | ||||
(9) |
The last integral in (7) is a compound Poisson process (cf. e.g. [9]): For any ,
(10) |
where the number of jumps up to time is , the jumps are iid rv’s in with distribution and , and for ,
(11) |
The infinitesimal generators and of the SDEs (6) and (7) are (cf. [9])
for , where
(12) |
The operator is an approximation of .
B. Time discretization of the approximate SDE
Fix a time step for some and discrete times for . Following [15], we propose the following Euler-Maruyama discretization of the SDE (7): Let , where solves
(13) |
Here the control is constant on each time interval, is the th-column of , and is a random walk in with
The processes and defines an approximation of the compound Poisson part of (7) through equation (10) where is replaced by an approximation
where exponentially distributed waiting times (time between jumps) are replaced by approximations 333In the new model, still gives the number of jumps up to time .: where , , and iid with approximate -exponential distribution given by
Then for , and for . We find that and . Note that in each time interval, approximation (13) either diffuses (the second equation) or jumps (the third equation), and that we have ignored the unlikely event of more than one jump per time interval. For the scheme to converge, we will see that we need to send both and . In this case and the jumps become less and less frequent and the random walk dominates the evolution of (which is to be expected).
3.2. Semi-Lagrangian approximation of the HJB equation
A. Control approximation of the HJB equation
We approximate the control problem (4) – (6) by a discrete time control problem: Define the value function
(14) |
where the controls are piecewise constant in time, the cost function is given by
(15) |
and the controlled discrete time process is the solution of (13). By the (discrete time) Dynamic Programming principle it follows that
for . Taking and computing the expectation using conditional probabilities (the probability to jump in a time interval is ), we find a (discrete time) HJB equation
(16) |
B. Interpolation and the fully discrete scheme
For we fix a grid and a linear/multilinear -interpolation . For functions ,
(17) |
where the ’s are piecewise linear/multilinear basis functions satisfying
for any . A fully discrete scheme is then obtained from (16) as follows:
(18) |
where
(19) |
Finally, we extend the solution of the discrete scheme to the whole by linear interpolation in and piecewise constant interpolation in :
(20) |
3.3. Approximate optimal feedback control
For the HJB equation in (1), satisfied by the value function (4), it easily follows that the optimal feedback control is
Based on this feedback law, we define an approximate feedback control for the discrete time optimal control problem (13)–(15) in the following way: For and ,
(21) |
where is given by (20),
(22) |
and the mollifier for with . We state a standard result on mollification.
Lemma 3.2.
If , , and . Then , and there exists a constant such that for all ,
By construction, we expect to be an approximation of the optimal feedback control for the approximate control problem with value function (14) when are small and is close to .
3.4. Dual SL discretization of the FPK equation
A. Dual approximation of the FPK equation
First note that if solves (6) with and , a rv with distribution , then the FPK equation for is
Setting , this equation becomes an approximation of the FPK equation in (1). With this choice of , we further approximate by the density , of the approximate process solving (13) with and .
We now derive a FPK equation for which in discretised form will serve as our approximation of the FPK equation in (1). To simplify we consider dimension . By definition of ,
for and . Let be the event of at least one jump in , i.e. where is the random jump time defined in Section 3.1 B. Then by the definition of in (13), the fact that , , and are i.i.d. and hence independent of , and conditional expectations, we find that
Let , . We approximate the above expression by a midpoint (quadrature) approximation, i.e. , then by choosing (linear interpolant) for and using we get a fully discrete approximation
In arbitrary dimension , we denote
(23) |
for , , . Redefining and reasoning as for above, we get the following discrete FPK equation
(24) |
where
(25) |
The solution is a probability distribution on , where :
Lemma 3.3.
Let be the solution of (24). If , then , i.e. , , and for all .
Proof.
First note that follows directly from the definition of the scheme and . Changing the order of summation and as , we find that
The result follows by iteration since . ∎
We extend to by piecewise constant interpolation in and then to by linear interpolation in : For and ,
(26) |
where, . Note that and the duality with the linear in /constant in interpolation used for in (20).
3.5. Discretisation of the coupled MFG system
The discretisation of the MFG system is obtained by coupling the two discretisations above by setting . With this choice and and we get the following discretisation of (1):
(27) |
where are defined above.
The individual discretisations are explicit, but due to the forward-backward nature of the coupling, the total discretisation is not explicit. It yields a nonlinear system that must be solved by some method like e.g. a fixed point iteration or a Newton type method.
The approximation scheme (27) has a least one solution:
Proposition 3.4.
The proof of this result is non-constructive and given in Appendix A.
4. Convergence to the MFG system
In this section we give the main theoretical results of this paper, various convergence results as under CFL-conditions. The proofs will be given in Section 7 and require results for the individual schemes given in Sections 5 and 6.
4.1. Convergence to viscosity-very weak solutions
We consider degenerate and non-degenerate cases separately. For the degenerate case, the convergence holds only in dimension .
Theorem 4.1 (Degenerate case, ).
Note that is precompact in , just by assuming (M): for the initial distribution. But in the degenerate case this is not enough for convergence of the MFG system, due to lower regularity of the solutions of the HJB equation (no longer ). Therefore we need assumption (M’): and the stronger compactness given by Theorem 4.1(ii) part (a) or (b). This latter result we are only able to show in .
In arbitrary dimensions we assume more regularity on solutions of the HJB equation in (1):
- (U):
-
Let be a viscosity solution of the HJB equation in (1). For any and , .
Remark 4.2.
We have the following convergence result in arbitrary dimensions.
Theorem 4.3 (Non-degenerate case).
Assume (0): , (1): , (L1): –(L3): , (F1): –(F3): , (H1): –(H2): , (U): , (M): , are solutions of the discrete MFG system (27). If under the CFL conditions , then:
-
(i)
is precompact in for every compact set .
-
(ii)
is precompact in .
-
(iii)
If is a limit point of , then is a viscosity-very weak solution of the MFG system (1).
These results give compactness of the approximations and convergence along subsequences. To be precise, by part (i) and (ii) there are convergent subsequences, and by part (iii) the corresponding limits are solutions of the MFG system (1).
We immediately have existence for (1).
Corollary 4.4 (Existence of solutions of (1)).
If in addition we have uniqueness for the MFG system (1), then we have full convergence of the sequence of approximations.
4.2. Convergence to classical solutions
In the case the individual equations are regularising, we can get convergence to classical solutions of the MFG system. To be precise we need:
-
1.
(“Weak” uniqueness of individual PDEs) The HJB equation have unique viscosity solutions, and the FPK equation have unique very weak solutions.
-
2.
(Smoothness of individual PDEs) Both equations have classical solutions.
This means that viscosity-very weak solutions of the MFG system automatically (by uniqueness for individual equations) are classical solutions. If in addition
-
3.
(Classical uniqueness for MFG) classical solutions of the MFG system are unique,
we get full convergence of the approximate solutions to the solution of the MFG system.
We now give a precise result in the setting of [37], see Theorem 2.7 in Section 2 for existence and uniqueness of classical solutions of (1).
Corollary 4.6.
Assume (0): –(2): , (L1): –(L3): , (F1): –(F4): , (H3): –(H4): , and (M”): . Let be solutions of the discrete MFG system (27). If under the CFL conditions , then:
(a) has a convergent subsequence in the space , and any limit point is a classical-classical solution of (1).
Proof.
1. Assumption (U): holds by Theorem 2.7, and then by Theorem 4.3, there is a convergent subsequence such that and is a viscosity-very weak solution of (1).
2. Since , the viscosity solution is unique by Proposition 2.5 (b) (see also [37, Theorem ]). Hence it coincides with the classical solution given by [37, Theorem ].
3. Now by part 2 and (H3): , and then by Proposition 2.8 there is at most one very weak solution of the FPK equation. Hence it coincides with the classical solution given by [37, Proposition ].
5. This shows (compactness, smoothness, and uniqueness) that all convergent subsequences of have the same limit, and thus the whole sequence converges to , the unique classical solution of (1). ∎
4.3. Extension and discussion
Extension to more general Lévy operators
The results of Theorem 4.1 and 4.3 hold under much more general assumptions on the Lévy operator . In [37] they use (0): together with the assumptions,
- (1′):
-
.
- (2′):
-
There are and such that the heat kernels and of and satisfy for : , , and
and any and multi-index .
where the heat kernel of the operator is defined as the fundamental solution of the heat equation . These assumptions cover lots of new cases compared to (0): , (1): , and (2): . New cases include (i) sums of operators satisfying (1): on subspaces spanning , having possibly different orders, (ii) more general non-absolutely continuous Lévy measures, and (iii) Lévy measures supported on positive cones. An example of (i) (cf. [37]) is
which satisfies (1′): with and . This is a sum of one-dimensional fractional Laplacians of different orders. An example of (iii) is given by the spectrally positive “fractional Laplacian” in one space dimension: .
We have the following generalization of the wellposedness result for classical solutions given in Theorem 2.7.
It follows that (U): holds whenever Theorem 4.7 holds. Since (1): implies (1′): and the integrals in (1′): are what appear in the different proofs, it is easy to check that all estimates in this paper are true for Lévy measures satisfying (1′): instead of (1): . This means that under assumption (1′): and (2′): we have the following extensions of Theorems 4.1 and 4.3 and Corollary 4.6.
The Wasserstein metric versus our metric
The typical setting for the FPK equations in the MFG literature seems to be the metric space , that is the Wasserstein space of probability measures with finite first moment. This is also the case in [25] where convergence results are given for SL schemes for local nondegenerate MFGs in . In this paper we can not assume finite first moments if we want to cover general non-local operators. An example is the fractional Laplacian for , where the underlying -stable process only has finite moments of order less than . Instead we consider the weaker metric space , which is just a metrization of the weak (weak-* in ) convergence of probability measures. In this topology we can consider processes, probability measures and solutions of the FPK equations that do not have any finite moments or any restrictions on the tail behaviour of the corresponding Lévy measures.
Of course, under additional assumptions convergence in implies convergence in .
Lemma 4.11.
If converges to in and and has uniformly bounded -moments for , then in .
Convergence in [53, Definition 6.8] is by definition equivalent to weak convergence plus convergence of first moments, and the result follows from e.g. Proposition 1.1 and Lemma 1.5 in [5].
Corollary 4.12.
Note that the number of moments of is determined by the number of moments of (and ), see e.g. the discussion in section 2.3 in [37]. Moreover, if has at most finite moments, then is well-defined only if has at most order growth at infinity. Hence in the nonlocal case there is ”duality” between the moments of and the growth of . Note that will always be integrable which is natural since then e.g. is finite.
In our case we assume no moments and have to work with bounded solutions .
On moments and weak compactness in in the degenerate case
Previous results for Semi-Lagrangian schemes in the first order and the degenerate second order case [23, 24] cover the case , which means that has finite first-moments. Our results assume , for , and hence no moment bounds and possibly unbounded . When we have weak compactness in instead of weak-* compactness in .
5. On the SL scheme for the HJB equation
We prove results for the numerical approximation of the HJB equation, including monotonicity, consistency, and different uniform a priori stability and regularity estimates. Using the “half-relaxed” limit method [12], we then show convergence in the form of , where is the (viscosity) solution of the continuous HJB equation. Let be the set of all bounded functions defined on .
Theorem 5.1.
Assume (0): , (L1): , , , and let denote the scheme defined in (18).
-
(i)
(Bounded control) If , has a minimal control and where only depends on and the growth of as .
-
(ii)
(Monotonicity) For all with we have,
-
(iii)
(Commutation by constant) For every and ,
-
(iv)
(Consistency) Let under CFL conditions , grid points , and such that . Then, for every ,
Proof.
(i) Since
is Lipschitz in (maximum linear growth at infinity), while is coercive (more than linear growth at infinity) by (L1): , there exists a ball , where depends on the Lipschitz constant of and the growth of , such that the minimizing control of belongs to .
(ii) and (iii) Follows directly from the definition of the scheme.
(iv) For ease of notation, we write instead of . A th order Taylor expansion of gives
for some . Using that , and by (1): , we get that
(28) | ||||
We used that is of order , the rd order terms are of order , and the th order terms are of order . Then the error of the Taylor expansion is . Using Lemma 3.1,
(29) | ||||
Theorem 5.2.
Proof.
The SL scheme is very stable in the sense that we have uniform in boundedness, Lipschitz continuity, and semi-concavity of the solutions .
Lemma 5.3.
Proof.
(a) Note that since ,
(34) |
Then, by (L2): , (F2): , and similar computations as in Theorem 5.2, we find that
Since
by (F2): , the result follows
by iteration.
(b) Similar to (34) we see
Then, by (L3): , (F3): , and similar computations as in Theorem 5.2, we find that
Since by (F3): , the result follows by iteration.
Theorem 5.4.
(Convergence of the HJB scheme) Assume (0): , (1): , (F1): , (F2): , (L2): , under CFL conditions , in , and is the solution of the scheme (18) defined by (20). Then there is a continuous bounded function such that locally uniformly in , and is the viscosity solution of the HJB equation in (1) for .
Proof.
The result follows from the Barles-Perthame-Souganidis relaxed limit method [12], using the monotonicity, consistency, and -stability properties of the scheme (cf. Theorem 5.1 (ii), (iii), and Lemma 5.3 (c)), and the strong comparison principle for the HJB equation in Proposition 2.5 (a). We refer to the proof of [23, Theorem 3.3] for a standard but more detailed proof in a similar case. ∎
We recall that the continuous extensions and are defined in (20) and (22), respectively. The results of Lemma 5.3 transfers to .
Lemma 5.5.
Let and be given by (22).
- (a)
- (b)
- (c)
Proof.
(a) Since satisfies the discrete Lipschitz bound of Lemma 5.3 (a), is Lipschitz with same Lipschitz constant as by properties of linear interpolation, and is Lipschitz with same constant as by properties of mollifiers (Lemma 3.2).
(b) For we have by Lemma 5.3 (b), Multiplying both sides by , and summing over , we get
Letting , multiplying by a positive mollifier and integrating, we get
We multiply both sides with , and sum over ,
By Lemma 3.2 and part (a), we have that , where the Lipschitz bound depends on the constants in (L2): and (F2): . Thus,
The second part of (b) then follows as in [3, Remark 6].
(c) The proof is given in [23, Lemma 3.6]. ∎
Under our assumptions, the continuous HJB equation has a (viscosity) solution , that is, the derivative exists almost everywhere [37, Theorem 4.3]. We have the following result for .
6. On the dual SL scheme for the FPK equation
In this section we establish more properties of the discrete FPK equation (24), including tightness, equicontinuity in time, -stability of solutions with respect to , and -bounds in dimension . To prove tightness we will use a result from [31].
Proof.
We use [31, Lemma 4.9] on the family of measures , where is defined in (11), to get a function such that is a non-decreasing sub-additive function, , , and
We immediately get the result except for the first part of (35). But this estimate follows from sub-additivity and -integrability of , see [31, Lemma 4.13 (ii)]. ∎
Remark 6.2.
(a) If for and for , then is a possible explicit choice for the function in Proposition 6.1.
Lemma 6.3.
Assume and there exists a function such that and . Then is tight.
This result is classical and can be proved in a similar way as the Chebychev inequality.
Theorem 6.4 (Tightness).
Proof.
Essentially we start by multiplying the scheme (24) by and integrating in space. By the definition of in (26) and (24), we find that
By the definition of in (25) and interchanging the order of summation and integration, we have
Since , by properties of midpoint approximation and linear/multilinear interpolation we have . Therefore
(36) | ||||
We estimate the terms on the right hand side. Let where
(37) |
By the fundamental theorem of Calculus,
(38) |
where and
By Lemma 5.5 (a) and (H1): , we find that with , and then that
To estimate the nonlocal term, we write
where is finite and independent of by Proposition 6.1 and . Going back to (36) and using the above estimates then leads to
where we used and to get the last inequality.
Theorem 6.5 (Equicontinuity in time).
Proof.
We start by the case . For , let for defined just before Lemma 3.2. With we first note that
(40) |
where Lemma 3.2 was used to estimate the term and . Since and are affine on each interval , and
where . It follows that
(41) |
Let us estimate . By (26), (24), (25), the midpoint quadrature approximation error bound, and the linear/multi-linear interpolation error bound, we have
Since by (37), a 2nd order Taylor’s expansion gives us
The above inequality follows since (used for the -terms), and independently of by (0): and (1): . By Lemma 5.5 (a) and (H1): , with . Since , , , and (by (0): , (1): ), we get that
To conclude the proof in the case , we go back to (40) and (41). In view of the above estimate on and the assumption that , we find that
Finally taking we get
When , we find that and hence that
By assumption , so again we find that
and can conclude as before. ∎
We also need a -stability result for with respect to variations in .
Proof.
Let , , , and . By (25) and Lemma 3.3, and , so that
Since (follows from and (25)),
Moreover, since only a finite number of ’s are non-zero at any given point, is Lipschitz with constant , and by Lemma 3.3, by the definitions of (25) and (23),
An iteration then shows that
Since , the result follows by interpolation. ∎
We end this section by a uniform -bound on in dimension .
Theorem 6.7 ( bounds).
To prove the theorem we need few technical lemmas.
Lemma 6.8.
Proof.
Lemma 6.9.
The proof of this result is similar to the proof of [23, Lemma 3.8] – a slightly expanded proof is given in Appendix C. A similar result holds for the integral-term:
Lemma 6.10.
Assume . Then we have
Proof.
By (11) and properties of the basis functions we have
7. Proof of convergence – Theorem 4.1 and 4.3
The main structure of the proofs are similar, so we present the proofs together. We proceed by several steps.
Step 1. (Compactness of ) In view of Theorem 6.4 and 6.5, is precompact in by the Prokhorov and Arzelà-Ascoli Theorem. Hence there exist a subsequence and in such that
This proves Theorem 4.3 (a) (ii) and the first part of Theorem 4.1 (a) (ii).
If (M’): holds with , then Theorem 6.7 and Helly’s weak compactness theorem imply that is weak precompact in and there is a subsequence and function such that in . If (M’): holds with , then is equiintegrable in by Theorem 6.4 and 6.7 and de la Vallée Poussin’s theorem. By Dunford-Pettis’ theorem, it is then weakly precompact in and there exists a subsequence and function such that in . The second part of Theorem 4.1 (a) (ii) follows.
Step 2. (Compactness and limit points for ) Part (i) and limit points as viscosity solutions in part (iii) of both Theorem 4.1 and 4.3 follow from step 1 and Theorem 5.6 (i).
Step 3. (Consistency for ) Let be a limit point of . Then by step 2, is a viscosity solution of the HJB equation in (1). We now show that is a very weak solution of the FPK equation in (1) with as the input data, i.e. satisfies (3) for and . In the rest of the proof we use instead of to simplify. We also let , , and take . Then we note that
so to prove (3), we must estimate the sum on the right.
By the midpoint approximation and (26), the scheme (24), and (25) combined with linear/multilinear interpolation, and finally midpoint approximation again, we find that
where is defined in (23), , and is the error of the last midpoint approximation. Since is smooth, uniformly Lipschitz (Lemma 5.5 (a)), , and by assumption (H2): ,
and hence . Similarly, .
From the above estimates, we find that
By a similar argument as in (28) and using Lemma 3.1,
Hence using (30) and (5) we have
Summing from to and approximating sums by integrals, we obtain
(42) |
where is Riemann sum approximation error. Let and use time-continuity in the -metric (Theorem 6.5), that is constant on , (H1): , (H2): and , to conclude that for
Summing over , we have .
Since converges to in and implies , we have
(43) |
It now remains to show convergence of the -term and pass to the limit in (42) to get that is a very weak solution satisfying (3).
Step 4 (Proof of Theorem 4.1 (a) (iii)). Now and part (ii) of Theorem 4.1 (a) implies that in if , or in if for . We also have almost everywhere in by Theorem 5.6 (ii). Since and uniformly bounded, by the triangle inequality and the dominated convergence Theorem we find that
Then by passing to the limit in (42) using the above limit, (43), and the CFL conditions (note that for large ), we see that (3) holds and is a very weak solution of the FPK equation. This completes the proof of Theorem 4.1 (a) (iii).
Step 5(Proof of Theorem 4.3(iii)). Now (U): holds and locally uniformly by Theorem 5.6 (iii). Since and , by continuity and uniform boundedness of , it follows that
(44) |
Since in and by (U): , we get
Then by passing to the limit in (42) using the above limit, (44), (43), and the CFL conditions , we see that (3) holds and is a very weak solution of the FPK equation. This completes the proof of Theorem 4.3(iii).
8. Numerical examples
For numerical experiments we look at
(45) |
where are real numbers, is a diffusion operator, , some real number, and is some bounded smooth function. We will specify these quantities in the examples below.
Artificial boundary conditions
Our schemes (18) and (24) for approximating (45) are posed in all of . To work in a bounded domain we impose (artificial) exterior conditions:
-
(U1)
in ,
-
(M1)
in , and is compactly supported in .
Condition (U1) penalize being in ensuring that optimal controls in (18) are such that . Moreover, the contributions to non-local operators of from will be small away from the boundary. Condition (M1) ensures that the mass of is essentially contained in up to some finite time (but some mass will leak out due to nonlocal effects), and there is no contribution from when we compute non-local operators of . We will present numerical results from a region of interest that is far away from the boundary of , and where the influence of the (artificial) exterior data is expected to be negligible.
Evaluating the integrals
To implement the scheme, we need to evaluate the integral
where
see (17). In addition, we need to compute the values of , and (see (9), (8), and (11)). To compute the weights we use two different methods. For the fractional Laplacians, we use the explicit weights of [45], while for CGMY diffusions we calculate the weights numerically using the inbuilt integral function in MATLAB. When tested on the fractional Laplacian, the MATLAB integrator produced an error of less than . Below the quantities are computed explicitly, except in the CGMY case where we use numerical integration.
Solving the coupled system
We use a fixed point iteration scheme: (i) Let , and solve for in (18)–(20). (ii) With approximate optimal control as in (21), we solve for in (24). (iii) Let , and repeat the process with . We continue until we have converged to a fixed point to within machine accuracy.
Remark 8.1.
Instead , we take . I.e. we use a fixed point iteration with some memory. This gives much faster convergence in our examples.
Example 1.
Problem (45) with , , , , where is such that . Furthermore, in accordance with the CFL-conditions of Theorem 4.1, we let , , , , , .
For the diffusions, we consider for , , and . In figure 1 we plot the different solutions at time and .


In figure 2 we plot the solution with on the time interval .


Example 2.
Problem (45) with the same cost functions as in Example 1, but different diffusions with parameter :
-
(i)
-
(ii)
,
-
(iii)
,
-
(iv)
,
where is the normalizing constant for the fractional Laplacian (see [45]). Case (i) is the reference solution, a symmetric and uniformly elliptic operator. Case (ii) is non-symmetric and non-degenerate, case (iii) is symmetric and degenerate, and case (iv) is a CGMY-diffusion (see e.g. [34]). We have plotted at and in Figure 3.


Example 3.
(Long time behaviour). Under certain conditions (see e.g. [22, 21]), the solution of time dependent MFG systems will quickly converge to the solution of the corresponding stationary ergodic MFG system, as the time horizon increases. We check numerically that this is also the case for nonlocal diffusions. In (45), we take , with , , , , and . We expect (from the cost functions and ) that the solution will approach the line quite fast, and then travel along this line, until it goes towards the point in the very end. Our numerical simulations shows that this is the case also for nonlocal diffusions. Here we have considered the cases (no coupling in the equation) and (some coupling). The parameters used in the simulations are , , , and the results are shown in Figure 4.


The players want to avoid each other in the case of , so the solution is more spread out in space direction than in the case of .
Example 4.
We compute the convergence rate when , , are as in Example 1, , , , and the domain . We take , , and for simplicity .
We calculate solutions for different values of , and compare with a reference solution computed at . We calculate and relative errors restricted to the -interval (to avoid boundary effects), and for and for :
The results are given in the table below.
h | ||||||||
---|---|---|---|---|---|---|---|---|
ERRu | 0.3155 | 0.1951 | 0.0920 | 0.0446 | 0.0218 | 0.0097 | 0.0035 | 0.0013 |
ERRm | 0.8055 | 0.4583 | 0.2886 | 0.1869 | 0.1023 | 0.0596 | 0.0300 | 0.0186 |
We see that when we halve , the error is halved, i.e we observe an error of order .
Appendix A Proof of Proposition 3.4
The proof is an adaptation of the Schauder fixed point argument used to prove existence for MFGs. We will use a direct consequence of Theorem 6.4 and 6.5:
Corollary A.1.
The point is that are fixed in this result. Let
where is defined in Corollary A.1. For , let be solution of (18) and defined by (22). Then is defined to the corresponding solution of (24). Note that a fixed point of will give a solution of the scheme (27). We now conclude the proof by applying Schauder’s fixed point theorem since:
1. ( is a convex, closed, compact set). It is a convex and closed by standard arguments and compact by the Prokhorov and Arzelà-Ascoli theorems.
Appendix B Proof of Lemma 5.6 (ii) and (iii)
Fix and consider a sequence . For any , a Taylor expansion shows that
(46) |
Using first Lemma 5.5 (a) and then part two of Lemma 5.5 (b), we find that
By Lemma 5.5 (a), the sequence is precompact. Now take any convergent subsequence as and . If is the limit, then by passing to the limit in (46) along this subsequence we have
and , the superdifferential of . At points where is differentiable, and , and then since the subsequence was arbitrary in the above argument and all limit points coincide,
(47) |
We conclude that at . Part (ii) now follows since is Lipschitz in space by Proposition 2.5 (c) and then -differentiable for a.e. and every .
Appendix C Proof of Lemma 6.9
We first show strong separation between any two characteristics : By Lemma 6.8,
Hence, we have
(48) |
The result now holds following the proof of [23, Lemma 3.8]. We give the proof for completeness.
Since the diameter of the support of a (hat) basis functions is , by (48) there can be at most 3 characteristics inside the for small enough . The result is trivial if there is only one in characteristic . When contains 2 characteristics, say and , we see by (48) (check the different orderings of , , ) that
Finally, assume contains 3 characteristics and . By (48) that all three characteristics can not be on one side (left or right) of . Without loss of generality we assume , and find
Combining all three cases we get
The estimate of is similar. This completes the proof.
Acknowledgements
The authors are supported by the Toppforsk (research excellence) project Waves and Nonlinear Phenomena (WaNP), grant no. 250070 from the Research Council of Norway. IC is partially supported by the Croatian Science Foundation under the project 4197. The authors would like to thank Elisabetta Carlini for sharing the code of the numerical methods introduced in [23].
References
- [1] Y. Achdou, F. Camilli, and I. Capuzzo-Dolcetta. Mean Field Games: Numerical methods for the planning problem. SIAM J. Control Optim, 50(1):77–109, 2012.
- [2] Y. Achdou, F. Camilli, and I. Capuzzo-Dolcetta. Mean Field Games: Convergence of a finite difference method. SIAM J. Numer. Anal., 51(5):2585–2612, 2013.
- [3] Y. Achdou, F. Camilli, and L. Corrias. On numerical approximation of the Hamilton-Jacobi-transport system arising in high frequency approximations. Discrete Contin. Dyn. Syst. Ser. B, 19(3):629–650, 2014.
- [4] Y. Achdou and I. Capuzzo-Dolcetta. Mean Field Games: Numerical methods. SIAM J. Numer. Anal., 48(3):1136–1162, 2010.
- [5] Y. Achdou, P. Cardaliaguet, F. Delarue, A. Porretta, F. Santambrogio. Mean field games. Lecture Notes in Mathematics, CIME vol. 2281, Springer, 2020.
- [6] Y. Achdou and M. Laurière. Mean Field Games and applications: Numerical aspects. arXiv preprint arXiv:2003.04444, 2020.
- [7] Y. Achdou and V. Perez. Iterative strategies for solving linearized discrete Mean Field Games systems. Netw. Heterog. Media, 7(2):197, 2012.
- [8] Y. Achdou and A. Porretta. Convergence of a finite difference scheme to weak solutions of the system of partial differential equations arising in mean field games. SIAM J. Numer. Anal., 54(1):161–186, 2016.
- [9] D. Applebaum. Lévy processes and stochastic calculus. Cambridge university press, 2009.
- [10] S. Asmussen and J. Rosiński. Approximations of small jumps of Lévy processes with a view towards simulation. J. Appl. Probab., 38(2):482–493, 2001.
- [11] M. Bardi and I. Capuzzo-Dolcetta. Optimal Control and Viscosity Solutions of Hamilton-Jacobi-Bellman Equations. Birkhäuser, 1997.
- [12] G. Barles and P. E. Souganidis. Convergence of approximation schemes for fully nonlinear second order equations. Asymptotic Anal., 4(3):271–283, 1991.
- [13] A. Bensoussan, J. Frehse, and P. Yam Mean field games and mean field type control theory SpringerBriefs in Mathematics, Springer, 2013.
- [14] F. Camilli and M. Falcone. An approximation scheme for the optimal control of diffusion processes. RAIRO Modél. Math. Anal. Numér., 29(1):97–122, 1995.
- [15] F. Camilli and E. R. Jakobsen. A finite element like scheme for integro-partial differential Hamilton–Jacobi–Bellman equations. SIAM J. Numer. Anal., 47(4):2407–2431, 2009.
- [16] I. Capuzzo Dolcetta. On a discrete approximation of the Hamilton-Jacobi equation of dynamic programming. Appl. Math. Optim. 10(4): 367–377, 1983.
- [17] P. Cardaliaguet. Weak solutions for first order Mean Field Games with local coupling. In Analysis and geometry in control theory and its applications, volume 11 of Springer INdAM Ser., pages 111–158. Springer, Cham, 2015.
- [18] P. Cardaliaguet, F. Delarue, J.-M. Lasry, and P.-L. Lions. The Master Equation and the Convergence Problem in Mean Field Games. Annals of Mathematics Studies, vol. 201, Princeton University Press, 2019.
- [19] P. Cardaliaguet and P. J. Graber. Mean Field Games systems of first order. ESAIM Control Optim. Calc. Var., 21(3):690–722, 2015.
- [20] P. Cardaliaguet, P. J. Graber, A. Porretta, and D. Tonon. Second order Mean Field Games with degenerate diffusion and local coupling. NoDEA Nonlinear Differential Equations Appl., 22(5):1287–1317, 2015.
- [21] P. Cardaliaguet, J.-M. Lasry, P.-L. Lions, and A. Porretta. Long time average of Mean Field Games with a nonlocal coupling. SIAM J. Control Optim., 51(5):3558–3591, 2013.
- [22] P. Cardaliaguet, J.-M. Lasry, P.-L. Lions, and A. Porretta. Long time average of mean field games. Netw. Heterog. Media, 7(2):279, 2012.
- [23] E. Carlini and F. J. Silva. A fully discrete semi-Lagrangian scheme for a first order Mean Field Game problem. SIAM J. Numer. Anal., 52(1):45–67, 2014.
- [24] E. Carlini and F. J. Silva. A semi-Lagrangian scheme for a degenerate second order Mean Field Game system. Discrete Contin. Dyn. Syst., 35(9):4269, 2015.
- [25] E. Carlini and F. J. Silva. On the discretization of some nonlinear Fokker-Planck-Kolmogorov equations and applications. SIAM J. Numer. Anal., 56(4):2148–2177, 2018.
- [26] R. Carmona and F. Delarue. Probabilistic analysis of Mean-Field Games. SIAM J. Control Optim., 51(4):2705–2734, 2013.
- [27] R. Carmona and F. Delarue. Probabilistic theory of mean field games with applications. I-II, Probability Theory and Stochastic Modelling 84, Springer 2018.
- [28] R. Carmona and M. Laurière. Convergence analysis of machine learning algorithms for the numerical solution of Mean Field Control and Games: II–the finite horizon case. arXiv preprint arXiv:1908.01613, 2019.
- [29] R. Carmona, M. Laurière, and Z. Tan. Linear-quadratic Mean-Field reinforcement learning: Convergence of policy gradient methods. arXiv preprint arXiv:1910.04295, 2019.
- [30] A. Cesaroni, M. Cirant, S. Dipierro, M. Novaga, and E. Valdinoci. On stationary fractional Mean Field Games. J. Math. Pures Appl., 122(9):1-22, 2017.
- [31] I. Chowdhury, E. R. Jakobsen, and M. Krupski. On fully nonlinear parabolic mean field games with examples of nonlocal and local diffusions. arXiv preprint arXiv:2104.06985, 2021.
- [32] M. Cirant. On the solvability of some ergodic control problems in . SIAM J. Control Optim., 52(6):4001–4026, 2014.
- [33] M. Cirant and A. Goffi. On the existence and uniqueness of solutions to time-dependent fractional MFG. SIAM J. Math. Anal., 51(2):913–954, 2019.
- [34] R. Cont and P. Tankov. Financial modelling with jump processes. CRC press, 2003.
- [35] K. Debrabant and E. R. Jakobsen. Semi-Lagrangian schemes for linear and fully non-linear diffusion equations. Math. Comp., 82(283):1433–1462, 2013.
- [36] S. Elghanjaoui and K. H. Karlsen. A markov chain approximation scheme for a singular investment-consumption problem with Lévy driven stock prices. Online available url: https://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.15.2182rep=rep1type=pdf, 2002.
- [37] O. Ersland and E. R. Jakobsen. On fractional and nonlocal parabolic Mean Field Games in the whole space. arXiv preprint arXiv:2003.12302, 2020.
- [38] M. Falcone and R. Ferretti. Semi-Lagrangian approximation schemes for linear and Hamilton-Jacobi equations. Society for Industrial and Applied Mathematics (SIAM), 2014.
- [39] D. A. Gomes, E. A. Pimentel, and V. Voskanyan. Regularity theory for mean-field game systems. SpringerBriefs in Mathematics, Springer, 2016
- [40] O. Guéant. Mean Field Games equations with quadratic Hamiltonian: a specific approach. Math. Models Methods Appl. Sci., 22(09), 2012.
- [41] O. Guéant. New numerical methods for Mean Field Games with quadratic costs. Netw. Heterog. Media, 7(2):315-336, 2012.
- [42] O. Guéant. Mean Field Games with a quadratic Hamiltonian: a constructive scheme. Advances in dynamic games, pages 229–241. Springer, 2013.
- [43] O. Guéant, J.-M. Lasry, and P.-L. Lions. Mean field games and applications, in Paris–Princeton Lectures on Mathematical Finance 2010. Lecture Notes in Mathematics 2003, 205–266, Springer, 2011.
- [44] M. Huang, R. P. Malhamé, and P. E. Caines. Large population stochastic dynamic games: closed-loop McKean-Vlasov systems and the Nash certainty equivalence principle. Commun. Inf. Syst., 6(3):221–251, 2006.
- [45] Y. Huang and A. Oberman. Numerical methods for the fractional Laplacian: A finite difference-quadrature approach. SIAM J. Numer. Anal., 52(6):3056–3084, 2014.
- [46] E. R. Jakobsen and K. H. Karlsen. Continuous dependence estimates for viscosity solutions of integro-PDEs. J. Differential Equations, 212(2):278–318, 2005.
- [47] E. R. Jakobsen, K. H. Karlsen and C. La Chioma. Error estimates for approximate solutions to Bellman equations associated with controlled jump-diffusions. Numer. Math., 110(2):221–255, 2008.
- [48] V. N. Kolokoltsov, M. S. Troeva, and W. Yang. Mean Field Games based on stable-like processes. Autom. Remote Control, 77(11):2044–2064, 2016.
- [49] J.-M. Lasry and P.-L. Lions. Mean Field Games. Jpn. J. Math., 2(1):229–260, 2007.
- [50] R. Metzler and J. Klafter. The random walk’s guide to anomalous diffusion: a fractional dynamics approach. Phys. Rep., 339(1):1–77, 2000.
- [51] A. Porretta. Weak solutions to Fokker-Planck equations and Mean Field Games. Arch. Ration. Mech. Anal., 216(1):1–62, 2015.
- [52] L. Ruthotto, S. J. Osher, W. Li, L. Nurbekyan, and S. W. Fung. A machine learning framework for solving high-dimensional Mean Field Game and Mean Field Control problems. Proc. Natl. Acad. Sci. U.S.A., 117(17):9183–9193, 2020.
- [53] C. Villani. Optimal transport: Old and new. Springer Science & Business Media, 2008.
- [54] W. A. Woyczyński. Lévy processes in the physical sciences. Lévy processes, pages 241–266. Springer, 2001.