Cover Image

Do LLM Agents Have Regret? A Case Study in Online Learning and Games

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Park, Chanwoo, Liu, Xiangyu, Ozdaglar, Asuman, Zhang, Kaiqing
Format:	Preprint
Published:	2024
Subjects:	Machine Learning Artificial Intelligence Computer Science and Game Theory
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Multi-Player Zero-Sum Markov Games with Networked Separable Interactions
by: Park, Chanwoo, et al.
Published: (2023)

LiteEFG: An Efficient Python Library for Solving Extensive-form Games
by: Liu, Mingyang, et al.
Published: (2024)

The Power of Regularization in Solving Extensive-Form Games
by: Liu, Mingyang, et al.
Published: (2022)

A Policy-Gradient Approach to Solving Imperfect-Information Games with Best-Iterate Convergence
by: Liu, Mingyang, et al.
Published: (2024)

Differentially Private Equilibrium Finding in Polymatrix Games
by: Liu, Mingyang, et al.
Published: (2025)

Last-Iterate Convergence of Payoff-Based Independent Learning in Zero-Sum Stochastic Games
by: Chen, Zaiwei, et al.
Published: (2024)

Online Learning and Equilibrium Computation with Ranking Feedback
by: Liu, Mingyang, et al.
Published: (2026)

Computing Equilibrium beyond Unilateral Deviation
by: Liu, Mingyang, et al.
Published: (2026)

Optimistic Thompson Sampling for No-Regret Learning in Unknown Games
by: Li, Yingru, et al.
Published: (2024)

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

Partially Observable Multi-Agent Reinforcement Learning with Information Sharing
by: Liu, Xiangyu, et al.
Published: (2023)

Post-Training LLMs as Better Decision-Making Agents: A Regret-Minimization Approach
by: Park, Chanwoo, et al.
Published: (2025)

Minimizing Weighted Counterfactual Regret with Optimistic Online Mirror Descent
by: Xu, Hang, et al.
Published: (2024)

RLHF from Heterogeneous Feedback via Personalization and Preference Aggregation
by: Park, Chanwoo, et al.
Published: (2024)

Learning in Markov Games with Adaptive Adversaries: Policy Regret, Fundamental Barriers, and Efficient Algorithms
by: Nguyen-Tang, Thanh, et al.
Published: (2024)

Regret Minimization and Convergence to Equilibria in General-sum Markov Games
by: Erez, Liad, et al.
Published: (2022)

A Single Online Agent Can Efficiently Learn Mean Field Games
by: Zhang, Chenyu, et al.
Published: (2024)

Online Test Synthesis From Requirements: Enhancing Reinforcement Learning with Game Theory
by: Sankur, Ocan, et al.
Published: (2024)

Next-Token Prediction and Regret Minimization
by: Mohri, Mehryar, et al.
Published: (2026)

Online Learning for Uninformed Markov Games: Empirical Nash-Value Regret and Non-Stationarity Adaptation
by: Liu, Junyan, et al.
Published: (2026)

Deep (Predictive) Discounted Counterfactual Regret Minimization
by: Xu, Hang, et al.
Published: (2025)

Real-Time Parallel Counterfactual Regret Minimization
by: Li, Boning, et al.
Published: (2026)

Evaluating LLM Agent Collusion in Double Auctions
by: Agrawal, Kushal, et al.
Published: (2025)

Game-theoretic LLM: Agent Workflow for Negotiation Games
by: Hua, Wenyue, et al.
Published: (2024)

Solving Pasur Using GPU-Accelerated Counterfactual Regret Minimization
by: Baghal, Sina
Published: (2025)

Meta-Inverse Reinforcement Learning for Mean Field Games via Probabilistic Context Variables
by: Chen, Yang, et al.
Published: (2025)

Do LLMs Strategically Reveal, Conceal, and Infer Information? A Theoretical and Empirical Analysis in The Chameleon Game
by: Karabag, Mustafa O., et al.
Published: (2025)

Online Learning of Counter Categories and Ratings in PvP Games
by: Lin, Chiu-Chou, et al.
Published: (2025)

Model-Based RL for Mean-Field Games is not Statistically Harder than Single-Agent RL
by: Huang, Jiawei, et al.
Published: (2024)

Socially-Weighted Alignment: A Game-Theoretic Framework for Multi-Agent LLM Systems
by: Mumcu, Furkan, et al.
Published: (2026)

Scale-Invariant Regret Matching and Online Learning with Optimal Convergence: Bridging Theory and Practice in Zero-Sum Games
by: Zhang, Brian Hu, et al.
Published: (2025)

From External to Swap Regret 2.0: An Efficient Reduction and Oblivious Adversary for Large Action Spaces
by: Dagan, Yuval, et al.
Published: (2023)

LLM Strategic Reasoning: Agentic Study through Behavioral Game Theory
by: Jia, Jingru, et al.
Published: (2025)

Gradient-based Learning in State-based Potential Games for Self-Learning Production Systems
by: Yuwono, Steve, et al.
Published: (2024)

Robust Deep Monte Carlo Counterfactual Regret Minimization: Addressing Theoretical Risks in Neural Fictitious Self-Play
by: Jaafari, Zakaria El
Published: (2025)

RuleSmith: Multi-Agent LLMs for Automated Game Balancing
by: Zeng, Ziyao, et al.
Published: (2026)

Iterative Nash Policy Optimization: Aligning LLMs with General Preferences via No-Regret Learning
by: Zhang, Yuheng, et al.
Published: (2024)

Paths to Equilibrium in Games
by: Yongacoglu, Bora, et al.
Published: (2024)

The Hidden Game Problem
by: Buzaglo, Gon, et al.
Published: (2025)

Proximal Regret and Proximal Correlated Equilibria: A New Tractable Solution Concept for Online Learning and Games
by: Cai, Yang, et al.
Published: (2025)