Related papers: Approximately Solving Continuous-Time Mean Field G…
We consider a dynamic traffic routing game over an urban road network involving a large number of drivers in which each driver selecting a particular route is subject to a penalty that is affine in the logarithm of the number of drivers…
We propose a single-level numerical approach to solve Stackelberg mean field game (MFG) problems. In Stackelberg MFG, an infinite population of agents play a non-cooperative game and choose their controls to optimize their individual…
We investigate mean field games for players, who are weakly coupled via their empirical measure. To this end we investigate time-dependent pure jump type propagators over a finite space in the framework of non-linear Markov processes. We…
Mean Field Games (MFG) are the class of games with a very large number of agents and the standard equilibrium concept is a Mean Field Equilibrium (MFE). Algorithms for learning MFE in dynamic MFGs are unknown in general. Our focus is on an…
We address a multi-class traffic model, for which we computationally assess the ability of mean-field games (MFGs) to yield approximate Nash equilibria for traffic flow games of intractable large finite-players. We introduce ad hoc…
We consider the problem of approximating Nash equilibria of $N$ functions $f_1,\dots, f_N$ of $N$ variables. In particular, we deduce conditions under which systems of the form $$ \dot u_j(t)=-\nabla_{x_j}f_j(u(t)) $$ $(j=1,\dots, N)$ are…
Training multi-agent systems (MAS) to achieve realistic equilibria gives us a useful tool to understand and model real-world systems. We consider a general sum partially observable Markov game where agents of different types share a single…
This paper studies a discrete-time major-minor mean field game of stopping where the major player can choose either an optimal control or stopping time. We look for the relaxed equilibrium as a randomized stopping policy, which is…
Neural network-based methods have demonstrated effectiveness in solving high-dimensional Mean-Field Games (MFG) equilibria, yet ensuring mathematically consistent density-coupled evolution remains a major challenge. This paper proposes the…
In this paper, we consider a mean field game (MFG) with a major and $N$ minor agents. We first consider the limiting problem and allow the coefficients to vary with the conditional distribution in a nonlinear way. We use the stochastic…
Here, we establish the existence of weak solutions to a wide class of time-dependent monotone mean-field games (MFGs). These MFGs are given as a system of degenerate parabolic equations with initial and terminal conditions. To construct…
In this paper we study a mean-field games system with Dirichlet boundary conditions in a closed domain and in a mean-field of control setting, that is in which the dynamics of each agent is affected not only by the average position of the…
Many important real-world settings contain multiple players interacting over an unknown duration with probabilistic state transitions, and are naturally modeled as stochastic games. Prior research on algorithms for stochastic games has…
We investigate how the framework of mean-field games may be used to investigate strategic interactions in large heterogeneous populations. We consider strategic interactions in a population of players which may be partitioned into…
We consider strongly monotone games with convex separable coupling constraints, played by dynamical agents, in a partial-decision information scenario. We start by designing continuous-time fully distributed feedback controllers, based on…
Finding Nash equilibria in two-player zero-sum imperfect-information games remains a central challenge in multi-agent reinforcement learning. Recent multi-round regularization methods offer a promising direction, yet existing approaches…
We present a simulation-based approach for solution of mean field games (MFGs), using the framework of empirical game-theoretical analysis (EGTA). Our primary method employs a version of the double oracle, iteratively adding strategies…
This paper studies stochastic games on large graphs and their graphon limits. We propose a new formulation of graphon games based on a single typical player's label-state distribution. In contrast, other recently proposed models of graphon…
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 considers mean field games with optimal stopping time (OSMFGs) where agents make optimal exit decisions, the coupled obstacle and Fokker-Planck equations in such models pose challenges versus classic MFGs. This paper proposes a…