Related papers: Entropic optimal planning for path-dependent mean …
Optimal transport is the problem of designing a joint distribution for two random variables with fixed marginals. In virtually the entire literature on this topic, the objective is to minimize expected cost. This paper is the first to study…
We study first order evolutive Mean Field Games where the Hamiltonian is non-coercive. This situation occurs, for instance, when some directions are "forbidden" to the generic player at some points. We establish the existence of a weak…
This paper studies a large number of homogeneous Markov decision processes where the transition probabilities and costs are coupled in the empirical distribution of states (also called mean-field). The state of each process is not known to…
We study zero-sum stochastic differential games where the state dynamics of the two players is governed by a generalized McKean-Vlasov (or mean-field) stochastic differential equation in which the distribution of both state and controls of…
In this paper we examine fully nonlinear mean-field games associated with a minimization problem. The variational setting is driven by a functional depending on its argument through its Hessian matrix. We work under fairly natural…
We consider the problem of allocating a distribution of items to $n$ recipients where each recipient has to be allocated a fixed, prespecified fraction of all items, while ensuring that each recipient does not experience too much envy. We…
We formulate and investigate a mean field optimization (MFO) problem over a set of probability distributions $\mu$ with a prescribed marginal $m$. The cost function depends on an aggregate term, which is the expectation of $\mu$ with…
We formulate a class of mean field games on a finite state space with variational principles resembling those in continuous-state mean field games. We construct a controlled continuity equation featuring a nonlinear activation function on…
We present a set-oriented graph-based computational framework for continuous-time optimal transport over nonlinear dynamical systems. We recover provably optimal control laws for steering a given initial distribution in phase space to a…
We investigate the complexities of the McKean-Vlasov optimal control problem, exploring its various formulations such as the strong and weak formulations, as well as both Markovian and non-Markovian setups within financial markets.…
We consider deterministic Mean Field Games (MFG) in all Euclidean space with a cost functional continuous with respect to the distribution of the agents and attaining its minima in a compact set. We first show that the static MFG with such…
We consider planning problems for graphs, Markov decision processes (MDPs), and games on graphs. While graphs represent the most basic planning model, MDPs represent interaction with nature and games on graphs represent interaction with an…
Computational complexity has been a major challenge in game-theoretic model predictive control (GT-MPC), as real-time solutions to a game (e.g., Nash equilibria (NEs)) have to be computed at each sampling instant of an MPC. This challenge…
This paper is devoted to the numerical resolution of McKean-Vlasov control problems via the class of mean-field neural networks introduced in our companion paper [25] in order to learn the solution on the Wasserstein space. We propose…
Let P2(Rd) be the space of probability measures on Rd with finite second moment. The path independence of additive functionals of McKean-Vlasov SDEs is characterized by PDEs on the product space Rd*P2(Rd) equipped with the usual derivative…
This paper studies the mean-field Markov decision process (MDP) with the centralized stopping under the non-exponential discount. The problem differs fundamentally from most existing studies on mean-field optimal control/stopping due to its…
We address the multi-agent motion planning problem where interactions, collisions, and congestion co-exist. Conventional game-theoretic planners capture interactions among agents but often converge to conservative, congested equilibria.…
Following Baurdoux and Kyprianou [2] we consider the McKean stochastic game, a game version of the McKean optimal stopping problem (American put), driven by a spectrally negative Levy process. We improve their characterisation of a saddle…
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…
CAV platooning technology has received considerable attention in the past few years, driven by the next generation smart transportation systems. Unlike most of the existing platooning methods that focus on linear vehicle dynamics of CAVs,…