Related papers: Mean Field Portfolio Games
This paper introduces a framework of Constrained Mean-Field Games (CMFGs), where each agent solves a constrained Markov decision process (CMDP). This formulation captures scenarios in which agents' strategies are subject to feasibility,…
Various social contexts ranging from public goods provision to information collection can be depicted as games of strategic interactions, where a player's well-being depends on her own action as well as on the actions taken by her…
We consider $n$ risk-averse agents who compete for liquidity in an Almgren--Chriss market impact model. Mathematically, this situation can be described by a Nash equilibrium for a certain linear-quadratic differential game with state…
This work establishes the equivalence between Mean Field Game and a class of PDE systems closely related to compressible Navier-Stokes equations. The solvability of the PDE system via the existence of the Nash Equilibrium of the Mean Field…
In this paper, we consider $n$ agents who invest in a general financial market that is free of arbitrage and complete. The aim of each investor is to maximize her expected utility while ensuring, with a specified probability, that her…
We consider a class of Wasserstein distributionally robust Nash equilibrium problems, where agents construct heterogeneous data-driven Wasserstein ambiguity sets using private samples and radii, in line with their individual risk-averse…
The aim of this paper is to formulate and study a stochastic model for the management of environmental assets in a geographical context where in each place the local authorities take their policy decisions maximizing their own welfare,…
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…
This paper studies the dynamic pricing mechanism for data products in demand-driven markets through a game-theoretic framework. We develop a three-tier Stackelberg game model to capture the hierarchical strategic interactions among key…
In this paper, we study deterministic mean field games for agents who operate in a bounded domain. In this case, the existence and uniqueness of Nash equilibria cannot be deduced as for unrestricted state space because, for a large set of…
In this tutorial, we provide an introduction to machine learning methods for finding Nash equilibria in games with large number of agents. These types of problems are important for the operations research community because of their…
Quantilized mean-field game models involve quantiles of the population's distribution. We study a class of such games with a capacity for ranking games, where the performance of each agent is evaluated based on its terminal state relative…
In this paper we present a scalable deep learning framework for finding Markovian Nash Equilibria in multi-agent stochastic games using fictitious play. The motivation is inspired by theoretical analysis of Forward Backward Stochastic…
In this article, we concern a kind of partially observed non-zero sum stochastic differential game based on forward and backward stochastic differential equations (FBSDEs). It is required that each player has his own observation equation,…
This paper considers mean field games in a multi-agent Markov decision process (MDP) framework. Each player has a continuum state and binary action, and benefits from the improvement of the condition of the overall population. Based on an…
Mean-field games (MFG) were introduced to efficiently analyze approximate Nash equilibria in large population settings. In this work, we consider entropy-regularized mean-field games with a finite state-action space in a discrete time…
A mean-field game (MFG) seeks the Nash Equilibrium of a game involving a continuum of players, where the Nash Equilibrium corresponds to a fixed point of the best-response mapping. However, simple fixed-point iterations do not always…
The standard game-theoretic solution concept, Nash equilibrium, assumes that all players behave rationally. If we follow a Nash equilibrium and opponents are irrational (or follow strategies from a different Nash equilibrium), then we may…
We investigate the sensitivity of the Nash equilibrium of constrained network aggregative games to changes in exogenous parameters affecting the cost function of the players. This setting is motivated by two applications. The first is the…
To verify the robustness of a program or protocol, it is common in the computer science community to rely on the theoretical framework of game theory. In particular, if one seeks to enforce a desired property, or specification, despite an…