Copertina

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

Fuente: arXiv

Salvato in:

Dettagli Bibliografici
Autori principali:	Laurière, Mathieu, Tangpi, Ludovic, Zhou, Xuchen
Natura:	Preprint
Pubblicazione:	2024
Soggetti:	Optimization and Control Computer Science and Game Theory Machine Learning
Accesso online:	Acceder al recurso
Tags:	Aggiungi Tag Nessun Tag, puoi essere il primo ad aggiungerne!!

Documenti analoghi

Reinforcement Learning for Finite Space Mean-Field Type Games
di: Shao, Kai, et al.
Pubblicazione: (2024)

An Overview of Some Extensions of Mean Field Games beyond Perfect Homogeneity and Anonymity
di: Laurière, Mathieu
Pubblicazione: (2025)

Learning in Mean Field Games: A Survey
di: Laurière, Mathieu, et al.
Pubblicazione: (2022)

Doubly Optimal No-Regret Online Learning in Strongly Monotone Games with Bandit Feedback
di: Ba, Wenjia, et al.
Pubblicazione: (2021)

Adaptive, Doubly Optimal No-Regret Learning in Strongly Monotone and Exp-Concave Games with Gradient Feedback
di: Jordan, Michael I., et al.
Pubblicazione: (2023)

A Game-Theoretic Framework for Network Formation in Large Populations
di: Dayanikli, Gokce, et al.
Pubblicazione: (2025)

Exploiting Approximate Symmetry for Efficient Multi-Agent Reinforcement Learning
di: Yardim, Batuhan, et al.
Pubblicazione: (2024)

Finite-Agent Stochastic Differential Games on Large Graphs: II. Graph-Based Architectures
di: Hu, Ruimeng, et al.
Pubblicazione: (2025)

Satisficing Paths and Independent Multi-Agent Reinforcement Learning in Stochastic Games
di: Yongacoglu, Bora, et al.
Pubblicazione: (2021)

Near-Optimal Policy Optimization for Correlated Equilibrium in General-Sum Markov Games
di: Cai, Yang, et al.
Pubblicazione: (2024)

Online Multi-Agent Control with Adversarial Disturbances
di: Barakat, Anas, et al.
Pubblicazione: (2025)

Online Generalized-mean Welfare Maximization: Achieving Near-Optimal Regret from Samples
di: Yang, Zongjun, et al.
Pubblicazione: (2026)

Convergence Analysis of Gradient-Based Learning with Non-Uniform Learning Rates in Non-Cooperative Multi-Agent Settings
di: Chasnov, Benjamin, et al.
Pubblicazione: (2019)

Near-Optimal Regret-Queue Length Tradeoff in Online Learning for Two-Sided Markets
di: Yang, Zixian, et al.
Pubblicazione: (2025)

An Exponentially Converging Particle Method for the Mixed Nash Equilibrium of Continuous Games
di: Wang, Guillaume, et al.
Pubblicazione: (2022)

Learning Dynamic Mechanisms in Unknown Environments: A Reinforcement Learning Approach
di: Qiu, Shuang, et al.
Pubblicazione: (2022)

Optimal Online Bookmaking for Binary Games
di: Bhatt, Alankrita, et al.
Pubblicazione: (2025)

Optimal Online Bookmaking for Any Number of Outcomes
di: Tal, Hadar, et al.
Pubblicazione: (2025)

Optimistic Online Learning in Symmetric Cone Games
di: Barakat, Anas, et al.
Pubblicazione: (2025)

Machine-Learned Prediction Equilibrium for Dynamic Traffic Assignment
di: Graf, Lukas, et al.
Pubblicazione: (2021)

MALADY: Multiclass Active Learning with Auction Dynamics on Graphs
di: Bhusal, Gokul, et al.
Pubblicazione: (2024)

Operator Splitting for Learning to Predict Equilibria in Convex Games
di: McKenzie, Daniel, et al.
Pubblicazione: (2021)

Deep Learning for the Multiple Optimal Stopping Problem
di: Laurière, Mathieu, et al.
Pubblicazione: (2025)

Faster Rates for No-Regret Learning in General Games via Cautious Optimism
di: Soleymani, Ashkan, et al.
Pubblicazione: (2025)

Fast Last-Iterate Convergence of Learning in Games Requires Forgetful Algorithms
di: Cai, Yang, et al.
Pubblicazione: (2024)

Finite-Sample Guarantees for Learning Dynamics in Zero-Sum Polymatrix Games
di: Faizal, Fathima Zarin, et al.
Pubblicazione: (2024)

Unsupervised Solution Operator Learning for Mean-Field Games via Sampling-Invariant Parametrizations
di: Huang, Han, et al.
Pubblicazione: (2024)

On Separation Between Best-Iterate, Random-Iterate, and Last-Iterate Convergence of Learning in Games
di: Cai, Yang, et al.
Pubblicazione: (2025)

Robust Bilevel Optimization for Near-Optimal Lower-Level Solutions
di: Besançon, Mathieu, et al.
Pubblicazione: (2019)

Last-Iterate Guarantees for Learning in Co-coercive Games
di: Chandak, Siddharth, et al.
Pubblicazione: (2026)

Population-aware Online Mirror Descent for Mean-Field Games by Deep Reinforcement Learning
di: Wu, Zida, et al.
Pubblicazione: (2024)

A pragmatic policy learning approach to account for users' fatigue in repeated auctions
di: Heymann, Benjamin, et al.
Pubblicazione: (2024)

The Oracle Complexity of Simplex-based Matrix Games
di: Kornowski, Guy, et al.
Pubblicazione: (2024)

Mistake, Manipulation and Margin Guarantees in Online Strategic Classification
di: Shen, Lingqing, et al.
Pubblicazione: (2024)

Blind Network Revenue Management and Bandits with Knapsacks under Limited Switches
di: Simchi-Levi, David, et al.
Pubblicazione: (2019)

Last-Iterate Convergence: Zero-Sum Games and Constrained Min-Max Optimization
di: Daskalakis, Constantinos, et al.
Pubblicazione: (2018)

On the Convergence of Min-Max Langevin Dynamics and Algorithm
di: Cai, Yang, et al.
Pubblicazione: (2024)

Cautious Optimism: A Meta-Algorithm for Near-Constant Regret in General Games
di: Soleymani, Ashkan, et al.
Pubblicazione: (2025)

Expected Variational Inequalities
di: Zhang, Brian Hu, et al.
Pubblicazione: (2025)

Stochastic variance reduced extragradient methods for solving hierarchical variational inequalities
di: Dvurechensky, Pavel, et al.
Pubblicazione: (2026)