Related papers: Displacement convexity for first-order mean-field …
We study a Mean Field Games (MFG) system in a real, separable infinite dimensional Hilbert space. The system consists of a second order parabolic type equation, called Hamilton-Jacobi-Bellman (HJB) equation in the paper, coupled with a…
In this paper, we propose an initial value fomulation of the discrete mean field games on finite graphs (Graph MFG), and design a neural network based approach to solve it. Graph MFG describes infinite, non-cooperative and interactive…
We study an optimal transport problem where, at some intermediate time, the mass is accelerated by either an external force field, or self-interacting. We obtain regularity of the velocity potential, intermediate density, and optimal…
We study the estimation of optimal transport (OT) maps between an arbitrary source probability measure and a log-concave target probability measure. Our contributions are twofold. First, we propose a new evolution equation in the set of…
The goal of this paper is to study a Mean Field Game (MFG) system stemming from the harvesting of resources. Modelling the latter through a reaction-diffusion equation and the harvesters as competing rational agents, we are led to a…
We consider the transfer operators of non-uniformly expanding maps for potentials of various regularity, and show that a specific property of potentials ("flatness") implies a Ruelle-Perron-Frobenius Theorem and a decay of the transfer…
This paper deals with the existence of optimal transport maps for some optimal transport problems with a convex but non strictly convex cost. We give a decomposition strategy to address this issue. As part of our strategy, we have to treat…
In this paper, we introduce and study a first-order mean-field game obstacle problem. We examine the case of local dependence on the measure under assumptions that include both the logarithmic case and power-like nonlinearities. Since the…
In recent years, the success of deep learning has inspired many researchers to study the optimization of general smooth non-convex functions. However, recent works have established pessimistic worst-case complexities for this class…
First-order methods (FOMs) are arguably the most scalable algorithms for equilibrium computation in large extensive-form games. To operationalize these methods, a distance-generating function, acting as a regularizer for the strategy space,…
In this note, we extend the regularity theory for monotone measure-preserving maps, also known as optimal transports for the quadratic cost optimal transport problem, to the case when the support of the target measure is an arbitrary convex…
We propose a policy iteration method to solve an inverse problem for a mean-field game (MFG) model, specifically to reconstruct the obstacle function in the game from the partial observation data of value functions, which represent the…
This paper investigates the design of optimal strategy revision in Population Games (PG) by establishing its connection to finite-state Mean Field Games (MFG). Specifically, by linking Evolutionary Dynamics (ED) -- which models agent…
This article studies problems of optimal transport, by embedding them in a general functional analytic framework of convex optimization. This provides a unified treatment of a large class of related problems in probability theory and allows…
Motivated by mean-field games (MFG) with common noise on the one hand and pathwise stochastic control theory on the other, we formulate here a linear-quadratic (LQ) MFG with rough common noise, along with a satisfactory well-posedness…
We study the most common image and informal description of the optimal transport problem for quadratic cost, also known as the second boundary value problem for the Monge--Amp\`{e}re equation -- What is the most efficient way to fill a hole…
Financial markets are often driven by latent factors which traders cannot observe. Here, we address an algorithmic trading problem with collections of heterogeneous agents who aim to perform optimal execution or statistical arbitrage, where…
In this paper, we consider a mean field game (MFG) model perturbed by small common noise. Our goal is to give an approximation of the Nash equilibrium strategy of this game using a solution from the original no common noise MFG whose…
This paper presents a general mean-field game (GMFG) framework for simultaneous learning and decision-making in stochastic games with a large population. It first establishes the existence of a unique Nash Equilibrium to this GMFG, and…
Here, we study the existence and the convergence of solutions for the vanishing discount MFG problem with a quadratic Hamiltonian. We give conditions under which the discounted problem has a unique classical solution and prove convergence…