A Deep Learning Method for Optimal Investment Under Relative Performance Criteria Among Heterogeneous Agents

• URL: http://arxiv.org/abs/2402.07365v2
• Date: Sat, 30 Mar 2024 09:29:01 GMT
• Title: A Deep Learning Method for Optimal Investment Under Relative Performance Criteria Among Heterogeneous Agents
• Authors: Mathieu Laurière, Ludovic Tangpi, Xuchen Zhou,
• Abstract summary: Graphon games have been introduced to study games with many players who interact through a weighted graph of interaction. We focus on a graphon game for optimal investment under relative performance criteria, and we propose a deep learning method.
• Score: 2.330509865741341
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Graphon games have been introduced to study games with many players who interact through a weighted graph of interaction. By passing to the limit, a game with a continuum of players is obtained, in which the interactions are through a graphon. In this paper, we focus on a graphon game for optimal investment under relative performance criteria, and we propose a deep learning method. The method builds upon two key ingredients: first, a characterization of Nash equilibria by forward-backward stochastic differential equations and, second, recent advances of machine learning algorithms for stochastic differential games. We provide numerical experiments on two different financial models. In each model, we compare the effect of several graphons, which correspond to different structures of interactions.

Related papers

• Game Theory Meets Statistical Mechanics in Deep Learning Design [0.06990493129893112]
  We present a novel deep representation that seamlessly merges principles of game theory with laws of statistical mechanics. It performs feature extraction, dimensionality reduction, and pattern classification within a single learning framework.
  arXiv  Detail & Related papers  (2024-10-16T06:02:18Z)
• Energy-based Potential Games for Joint Motion Forecasting and Control [0.125828876338076]
  This work uses game theory as a mathematical framework to address interaction modeling in motion forecasting and control. We establish a connection between differential games, optimal control, and energy-based models, demonstrating how existing approaches can be unified under our proposed Energy-based Potential Game formulation. We introduce a new end-to-end learning application that combines neural networks for game- parameter inference with a differentiable game-theoretic optimization layer, acting as an inductive bias.
  arXiv  Detail & Related papers  (2023-12-04T11:30:26Z)
• Visual Commonsense based Heterogeneous Graph Contrastive Learning [79.22206720896664]
  We propose a heterogeneous graph contrastive learning method to better finish the visual reasoning task. Our method is designed as a plug-and-play way, so that it can be quickly and easily combined with a wide range of representative methods.
  arXiv  Detail & Related papers  (2023-11-11T12:01:18Z)
• On a Connection between Differential Games, Optimal Control, and Energy-based Models for Multi-Agent Interactions [0.13499500088995461]
  We show a connection between differential games, optimal control, and energy-based models. Building upon this formulation, this work introduces a new end-to-end learning application. Experiments using simulated mobile robot pedestrian interactions and real-world automated driving data provide empirical evidence.
  arXiv  Detail & Related papers  (2023-08-31T08:30:11Z)
• Finding mixed-strategy equilibria of continuous-action games without gradients using randomized policy networks [83.28949556413717]
  We study the problem of computing an approximate Nash equilibrium of continuous-action game without access to gradients. We model players' strategies using artificial neural networks. This paper is the first to solve general continuous-action games with unrestricted mixed strategies and without any gradient information.
  arXiv  Detail & Related papers  (2022-11-29T05:16:41Z)
• Representing Videos as Discriminative Sub-graphs for Action Recognition [165.54738402505194]
  We introduce a new design of sub-graphs to represent and encode theriminative patterns of each action in the videos. We present MUlti-scale Sub-Earn Ling (MUSLE) framework that novelly builds space-time graphs and clusters into compact sub-graphs on each scale.
  arXiv  Detail & Related papers  (2022-01-11T16:15:25Z)
• Learning Graphon Mean Field Games and Approximate Nash Equilibria [33.77849245250632]
  We propose a novel discrete-time formulation for graphon mean field games with weak interaction. On the theoretical side, we give extensive and rigorous existence and approximation properties of the graphon mean field solution. We successfully obtain plausible approximate Nash equilibria in otherwise infeasible large dense graph games with many agents.
  arXiv  Detail & Related papers  (2021-11-29T16:16:11Z)
• TCL: Transformer-based Dynamic Graph Modelling via Contrastive Learning [87.38675639186405]
  We propose a novel graph neural network approach, called TCL, which deals with the dynamically-evolving graph in a continuous-time fashion. To the best of our knowledge, this is the first attempt to apply contrastive learning to representation learning on dynamic graphs.
  arXiv  Detail & Related papers  (2021-05-17T15:33:25Z)
• Hawkes Processes on Graphons [85.6759041284472]
  We study Hawkes processes and their variants that are associated with Granger causality graphs. We can generate the corresponding Hawkes processes and simulate event sequences. We learn the proposed model by minimizing the hierarchical optimal transport distance between the generated event sequences and the observed ones.
  arXiv  Detail & Related papers  (2021-02-04T17:09:50Z)
• A Differentiable Newton Euler Algorithm for Multi-body Model Learning [34.558299591341]
  We motivate a computation graph architecture that embodies the Newton Euler equations. We describe the used virtual parameters that enable unconstrained physical plausible dynamics. We show that the kinematic parameters, required by previous white-box system identification methods, can be accurately inferred from data.
  arXiv  Detail & Related papers  (2020-10-19T19:30:33Z)
• Model-Based Reinforcement Learning for Atari [89.3039240303797]
  We show how video prediction models can enable agents to solve Atari games with fewer interactions than model-free methods. Our experiments evaluate SimPLe on a range of Atari games in low data regime of 100k interactions between the agent and the environment.
  arXiv  Detail & Related papers  (2019-03-01T15:40:19Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.