相关论文: Convexification Numerical Method for the Retrospec…

In recent and past works, convexity is usually assumed on each individual part of the action functional in order to demonstrate the existence and uniqueness of a Nash equilibrium on some interval [0, T] (this meant that each hessian was…

Traditional solvable game theory and mean-field-type game theory (risk-aware games) predominantly focus on quadratic costs due to their analytical tractability. Nevertheless, they often fail to capture critical non-linearities inherent in…

Here, we prove the existence of solutions to first-order mean-field games (MFGs) arising in optimal switching. First, we use the penalization method to construct approximate solutions. Then, we prove uniform estimates for the penalized…

The formulation of Mean Field Games (MFG) typically requires continuous differentiability of the Hamiltonian in order to determine the advective term in the Kolmogorov--Fokker--Planck equation for the density of players. However, in many…

This paper presents discrete convex analysis as a tool for economics and game theory. Discrete convex analysis is a new framework of discrete mathematics and optimization, developed during the last two decades. Recently, it is being…

This thesis is going to give a gentle introduction to Mean Field Games. It aims to produce a coherent text beginning for simple notions of deterministic control theory progressively to current Mean Field Games theory. The framework…

A mean-field game (MFG) seeks the Nash Equilibrium of a game involving a continuum of players, where the Nash Equilibrium corresponds to a fixed point of the best-response mapping. However, simple fixed-point iterations do not always…

We propose and study several inverse problems for the mean field games (MFG) system in a bounded domain. Our focus is on simultaneously recovering the running cost and the Hamiltonian within the MFG system by the associated boundary…

Non-cooperative and cooperative games with a very large number of players have many applications but remain generally intractable when the number of players increases. Introduced by Lasry and Lions, and Huang, Caines and Malham\'e, Mean…

We study the generalized conditional gradient (GCG) method for time-dependent second-order mean field games (MFG) with local coupling terms. While explicit convergence rates of the GCG method were previously established only for globally…

In a probabilistic mean field game driven by a L\'evy process an individual player aims to minimize a long run discounted/ergodic cost by controlling the process through a pair of increasing and decreasing c\`adl\`ag processes, while he is…

Incomplete cooperative games generalise the classical model of cooperative games by omitting the values of some of the coalitions. This allows to incorporate uncertainty into the model and study the underlying games as well as possible…

This work is mainly concerned with the so-called limit theory for mean-field games. Adopting the weak formulation paradigm put forward by Carmona and Lacker, we consider a fully non-Markovian setting allowing for drift control and…

We propose two numerical methods for the optimal control of McKean-Vlasov dynamics in finite time horizon. Both methods are based on the introduction of a suitable loss function defined over the parameters of a neural network. This allows…

Recently, the paper [12] introduces a derivative-free consensus-based particle method that finds the Nash equilibrium of non-convex multiplayer games, where it proves the global exponential convergence in the sense of mean-field law. This…

In this paper we present a numerical scheme to solve coupled mean field forward-backward stochastic differential equations driven by monotone vector fields. This is based on an adaptation of so called extragradient methods by characterizing…

We consider Mean Field Games without idiosyncratic but with Brownian type common noise. We introduce a notion of solutions of the associated backward-forward system of stochastic partial differential equations. We show that the solution…

This work introduces a new general approach for the numerical analysis of stable equilibria to second order mean field games systems in cases where the uniqueness of solutions may fail. For the sake of simplicity, we focus on a simple…

We establish the convergence of the deep actor-critic reinforcement learning algorithm presented in [Angiuli et al., 2023a] in the setting of continuous state and action spaces with an infinite discrete-time horizon. This algorithm provides…

We study the regularity and long time behavior of the one-dimensional, local, first-order mean field games system and the planning problem, assuming a Hamiltonian of superlinear growth, with a non-separated, strictly monotone dependence on…