Related papers: Planning problem for continuous-time finite state …
In this paper, we study the $extended$ mean field control problem, which is a class of McKean-Vlasov stochastic control problem where the state dynamics and the reward functions depend upon the joint (conditional) distribution of the…
Operating vehicles in adversarial environments require non-conventional planning techniques. A two-player, zero-sum non-cooperative game is introduced, which is solved via a linear program. An extension is proposed to construct networks…
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…
While single-agent policy optimization in a fixed environment has attracted a lot of research attention recently in the reinforcement learning community, much less is known theoretically when there are multiple agents playing in a…
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…
We study the mean field games equations, consisting of the coupled Kolmogorov-Fokker-Planck and Hamilton-Jacobi-Bellman equations. The equations are complemented by initial and terminal conditions. It is shown that with some specific choice…
We establish the existence of optimal scheduling strategies for time-bounded reachability in continuous-time Markov decision processes, and of co-optimal strategies for continuous-time Markov games. Furthermore, we show that optimal control…
In this paper we formulate the now classical problem of optimal liquidation (or optimal trading) inside a Mean Field Game (MFG). This is a noticeable change since usually mathematical frameworks focus on one large trader in front of a…
We consider both finite-state game graphs and recursive game graphs (or pushdown game graphs), that can model the control flow of sequential programs with recursion, with multi-dimensional mean-payoff objectives. In pushdown games two types…
Mean-field games have been studied under the assumption of very large number of players. For such large systems, the basic idea consists to approximate large games by a stylized game model with a continuum of players. The approach has been…
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…
This paper presents recent results from Mean Field Game theory underlying the introduction of common noise that imposes to incorporate the distribution of the agents as a state variable. Starting from the usual mean field games equations…
We consider a Mean Field Games model where the dynamics of the agents is subdiffusive. According to the optimal control interpretation of the problem, we get a system involving fractional time-derivatives for the Hamilton-Jacobi-Bellman and…
In this paper, we consider finite-time state agreement problems for continuous-time multi-agent systems and propose two protocols, which ensure that states of agents reach an agreement in a finite time. Moreover, the second protocol solves…
We introduce a new setting where a population of agents, each modelled by a finite-state system, are controlled uniformly: the controller applies the same action to every agent. The framework is largely inspired by the control of a…
We investigate an infinite-horizon time-inconsistent mean-field game (MFG) in a discrete time setting. We first present a classic equilibrium for the MFG and its associated existence result. This classic equilibrium aligns with the…
First order kinetic mean field games formally describe the Nash equilibria of deterministic differential games where agents control their acceleration, asymptotically in the limit as the number of agents tends to infinity. The known results…
In this paper, we study a priori estimates for a first-order mean-field planning problem with a potential. In the theory of mean-field games (MFGs), a priori estimates play a crucial role to prove the existence of classical solutions. In…
In this paper, we develop a Mean Field Games approach to Cluster Analysis. We consider a finite mixture model, given by a convex combination of probability density functions, to describe the given data set. We interpret a data point as an…
We formulate a stochastic game of mean field type where the agents solve optimal stopping problems and interact through the proportion of players that have already stopped. Working with a continuum of agents, typical equilibria become…