Related papers: Ergodic behavior of control and mean field games p…
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…
Entropy regularization has been extensively adopted to improve the efficiency, the stability, and the convergence of algorithms in reinforcement learning. This paper analyzes both quantitatively and qualitatively the impact of entropy…
This paper is devoted to a class of finite horizon deterministic mean field games with Grushin type dynamics, state constraints and nonlocal coupling. First, we consider the optimal control problem that each agent aims to solve when the…
This paper establishes that $N$-player stochastic games with singular controls, either of bounded velocity or of finite variation, can both be approximated by mean field games (MFGs) with singular controls of bounded velocity. More…
This paper investigates a mean-field game (MFG) problem for mean-variance (MV) portfolio management, highlighting a new type of relative performance encoded by the peer-based risk aversion. Specifically, the risk aversion is formulated as a…
This paper proposes an efficient computational framework for longitudinal velocity control of a large number of autonomous vehicles (AVs) and develops a traffic flow theory for AVs. Instead of hypothesizing explicitly how AVs drive, our…
In ergodic singular stochastic control problems, a decision-maker can instantaneously adjust the evolution of a state variable using a control of bounded variation, with the goal of minimizing a long-term average cost functional. The cost…
This paper concerns the simultaneous effect of homogenization and of the small noise limit for a $2^{\textrm {nd}}$ order mean field games (MFG) system with local coupling and quadratic Hamiltonian. We show under some additional assumptions…
This paper establishes that a class of $N$-player stochastic games with singular controls, either of bounded velocity or of finite variation, can both be approximated by mean field games (MFGs) with singular controls of bounded velocity.…
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…
Mean payoff stochastic games can be studied by means of a nonlinear spectral problem involving the Shapley operator: the ergodic equation. A solution consists in a scalar, called the ergodic constant, and a vector, called bias. The…
We consider a class of deterministic mean field games, where the state associated with each player evolves according to an ODE which is linear w.r.t. the control. Existence, uniqueness, and stability of solutions are studied from the point…
Here, we examine the Wardrop equilibrium model on networks with flow-dependent costs and its connection with stationary mean-field games (MFG). In the first part of this paper, we present the Wardrop and the first-order MFG models on…
The objective of this paper is to analyze the existence of equilibria for a class of deterministic mean field games of controls. The interaction between players is due to both a congestion term and a price function which depends on the…
We consider first order variational MFG in the whole space, with aggregative interactions and density constraints, such that the stationary states of the game are contained in two isolated compact sets of mass distributions with finite…
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…
In this paper, we consider a first-order deterministic mean field game model inspired by crowd motion in which agents moving in a given domain aim to reach a given target set in minimal time. To model interaction between agents, we assume…
We study two-player (zero-sum) concurrent mean-payoff games played on a finite-state graph. We focus on the important sub-class of ergodic games where all states are visited infinitely often with probability 1. The algorithmic study of…
The framework of Mean-field Games (MFGs) is used for modelling the collective dynamics of large populations of non-cooperative decision-making agents. We formulate and analyze a kinetic MFG model for an interacting system of non-cooperative…
Mean-field games (MFGs) are models of large populations of rational agents who seek to optimize an objective function that takes into account their location and the distribution of the remaining agents. Here, we consider stationary MFGs…