:: Library Catalog

Cover Image

Saved in:

Bibliographic Details
Main Authors:	Chen, Sijin, Hagrass, Omar, Klusowski, Jason M.
Format:	Preprint
Published:	2024
Subjects:	Machine Learning Artificial Intelligence Computer Science and Game Theory Optimization and Control
Online Access:	https://arxiv.org/abs/2410.03968
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Near Optimal Convergence to Coarse Correlated Equilibrium in General-Sum Markov Games
by: Yorulmaz, Asrin Efe, et al.
Published: (2025)

Graphon Mean Field Games with a Representative Player: Analysis and Learning Algorithm
by: Zhou, Fuzhong, et al.
Published: (2024)

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

Incentivize without Bonus: Provably Efficient Model-based Online Multi-agent RL for Markov Games
by: Yang, Tong, et al.
Published: (2025)

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

MF-OML: Online Mean-Field Reinforcement Learning with Occupation Measures for Large Population Games
by: Hu, Anran, et al.
Published: (2024)

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

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

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

PREFER: Personalized Review Summarization with Online Preference Learning
by: Roy, Millend, et al.
Published: (2026)

Meta-Learning for Repeated Bayesian Persuasion
by: Turna, Ata Poyraz, et al.
Published: (2026)

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

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

Indirect Dynamic Negotiation in the Nash Demand Game
by: Guy, Tatiana V., et al.
Published: (2024)

Monotone Near-Zero-Sum Games: A Generalization of Convex-Concave Minimax
by: Luo, Ruichen, et al.
Published: (2025)

From Average-Iterate to Last-Iterate Convergence in Games: A Reduction and Its Applications
by: Cai, Yang, et al.
Published: (2025)

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

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

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

Convergence of Regret Matching in Potential Games and Constrained Optimization
by: Anagnostides, Ioannis, et al.
Published: (2025)

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

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

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

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

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

Achieving Logarithmic Regret in KL-Regularized Zero-Sum Markov Games
by: Nayak, Anupam, et al.
Published: (2025)

Small-Gain Nash: Certified Contraction to Nash Equilibria in Differentiable Games
by: Sharma, Vedansh
Published: (2025)

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

Data-Scarce Identification of Game Dynamics via Sum-of-Squares Optimization
by: Sakos, Iosif, et al.
Published: (2023)

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

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

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

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

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

A Deep Learning Method for Optimal Investment Under Relative Performance Criteria Among Heterogeneous Agents
by: Laurière, Mathieu, et al.
Published: (2024)

A General Equilibrium Theory of Orchestrated AI Agent Systems
by: Garnier, Jean-Philippe
Published: (2026)

Zero-Sum Positional Differential Games as a Framework for Robust Reinforcement Learning: Deep Q-Learning Approach
by: Plaksin, Anton, et al.
Published: (2024)

Policy Iteration for Two-Player General-Sum Stochastic Stackelberg Games
by: Kudo, Mikoto, et al.
Published: (2024)

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

A game-theoretic approach for Generative Adversarial Networks
by: Franci, Barbara, et al.
Published: (2020)