Mean Field Portfolio Games with Consumption
We study mean field portfolio games with consumption. For general market parameters, we establish a one-to-one correspondence between Nash equilibria of the game and solutions to some FBSDE, which is proved to be equivalent to some BSDE. Our approach, which is general enough to cover power, exponential and log utilities, relies on martingale optimality principle in [3,9] and dynamic programming principle in [6,7]. When the market parameters do not depend on the Brownian paths, we get the unique Nash equilibrium in closed form. As a byproduct, when all market parameters are time-independent, we answer the question proposed in [12]: the strong equilibrium obtained in [12] is unique in the essentially bounded space.
Code (0)
등록된 구현이 없습니다.
Similar Papers 제목 키워드 기반
Mean Field Portfolio Games with Epstein-Zin Preferences
We study mean field portfolio games under Epstein-Zin preferences, which naturally encompass the classical time-additive power utility as a special case. In a general non-Markovian framework, we establish a uniqueness re…
Time-inconsistent mean field and n-agent games under relative performance criteria
In this paper we study a time-inconsistent portfolio optimization problem for competitive agents with CARA utilities and non-exponential discounting. The utility of each agent depends on her own wealth and consumption as…
Portfolio OptimizationMean Field Games for Optimal Investment Under Relative Performance Criteria
In this paper, we study the portfolio optimization problem formulated by Lacker and Soret. They formulate a finite time horizon model that allows agents to be competitive, measuring their utility not only by their absolu…
Portfolio OptimizationMean Field Portfolio Games
We study mean field portfolio games with random market parameters, where each player is concerned with not only her own wealth but also relative performance to her competitors. We use the martingale optimality principle …
Signatured Deep Fictitious Play for Mean Field Games with Common Noise
Existing deep learning methods for solving mean-field games (MFGs) with common noise fix the sampling common noise paths and then solve the corresponding MFGs. This leads to a nested-loop structure with millions of simul…