Related papers: Planning problem for continuous-time finite state …
In mean-payoff games, the objective of the protagonist is to ensure that the limit average of an infinite sequence of numeric weights is nonnegative. In energy games, the objective is to ensure that the running sum of weights is always…
We investigate the global numerical approximation of a class of extended mean field control problems (MFC), where the dynamics and costs depend on the joint distribution of the state and the control. We propose a framework to approximate…
We consider regret minimization in repeated games with non-convex loss functions. Minimizing the standard notion of regret is computationally intractable. Thus, we define a natural notion of regret which permits efficient optimization and…
The mean-field game system is treated as an Euler Lagrange system corresponding to an optimal control problem governed by Fokker-Planck equation.
Game-theoretic motion planners are a powerful tool for the control of interactive multi-agent robot systems. Indeed, contrary to predict-then-plan paradigms, game-theoretic planners do not ignore the interactive nature of the problem, and…
We consider planning problems, that often arise in autonomous driving applications, in which an agent should decide on immediate actions so as to optimize a long term objective. For example, when a car tries to merge in a roundabout it…
We study the parallel Minority Game, where a group of agents, each having two choices, try to independently decide on a strategy such that they stay on minority between their own two choices. However, there are multiple such groups of…
We study in this paper three aspects of Mean Field Games. The first one is the case when the dynamics of each player depend on the strategies of the other players. The second one concerns the modeling of '' noise '' in discrete space models…
Forcing finite state mean field games by a relevant form of common noise is a subtle issue, which has been addressed only recently. Among others, one possible way is to subject the simplex valued dynamics of an equilibrium by a so-called…
The parallel minority game (PMG) extends the classical minority game to many choices, with each agent restricted to two predetermined alternatives. In this condition, minimizing the population variance across all choices is a complex…
In this paper we consider a mean field optimal control problem with an aggregation-diffusion constraint, where agents interact through a potential, in the presence of a Gaussian noise term. Our analysis focuses on a PDE system coupling a…
In this paper, we consider mean-field games where the interaction of each player with the mean-field takes into account not only the states of the players but also their collective behavior, To do so, we develop a random variable framework…
We introduce the concept of {\it mean-field optimal control} which is the rigorous limit process connecting finite dimensional optimal control problems with ODE constraints modeling multi-agent interactions to an infinite dimensional…
We present a novel framework for mean field games with finite state space and common noise, where the common noise is given through shocks that occur at random times. We first analyze the game for up to $n$ shocks, in which case we are able…
Discounted-sum games provide a formal model for the study of reinforcement learning, where the agent is enticed to get rewards early since later rewards are discounted. When the agent interacts with the environment, she may regret her…
The planning domain has experienced increased interest in the formal synthesis of decision-making policies. This formal synthesis typically entails finding a policy which satisfies formal specifications in the form of some well-defined…
Finite mixture models are an important tool in the statistical analysis of data, for example in data clustering. The optimal parameters of a mixture model are usually computed by maximizing the log-likelihood functional via the…
We study the short-time existence and uniqueness of solutions to a coupled system of partial differential equations arising in mean field game theory. It has the generic form $$ \left\{ \begin{array}{c} -\partial_t u - \Delta u +…
Regret minimization is a powerful tool for solving large-scale problems; it was recently used in breakthrough results for large-scale extensive-form game solving. This was achieved by composing simplex regret minimizers into an overall…
We examine the problem of the existence of optimal deterministic stationary strategiesintwo-players antagonistic (zero-sum) perfect information stochastic games with finitely many states and actions.We show that the existenceof such…