Cover Image

Learning not to Regret

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Sychrovský, David, Šustr, Michal, Davoodi, Elnaz, Bowling, Michael, Lanctot, Marc, Schmid, Martin
Format:	Preprint
Published:	2023
Subjects:	Computer Science and Game Theory Machine Learning
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Meta-Learning in Self-Play Regret Minimization
by: Sychrovský, David, et al.
Published: (2025)

Approximating Nash Equilibria in General-Sum Games via Meta-Learning
by: Sychrovský, David, et al.
Published: (2025)

Easy as ABCs: Unifying Boltzmann Q-Learning and Counterfactual Regret Minimization
by: D'Amico-Wong, Luca, et al.
Published: (2024)

Reducing Optimism Bias in Incomplete Cooperative Games
by: Úradník, Filip, et al.
Published: (2024)

Barriers to Welfare Maximization with No-Regret Learning
by: Anagnostides, Ioannis, et al.
Published: (2024)

Code-Space Response Oracles: Generating Interpretable Multi-Agent Policies with Large Language Models
by: Hennes, Daniel, et al.
Published: (2026)

The Relationship between No-Regret Learning and Online Conformal Prediction
by: Ramalingam, Ramya, et al.
Published: (2025)

Learning in Games with Progressive Hiding
by: Heymann, Benjamin, et al.
Published: (2024)

No-Regret Learning in Bilateral Trade via Global Budget Balance
by: Bernasconi, Martino, et al.
Published: (2023)

Honor Among Bandits: No-Regret Learning for Online Fair Division
by: Procaccia, Ariel D., et al.
Published: (2024)

ReLExS: Reinforcement Learning Explanations for Stackelberg No-Regret Learners
by: Huang, Xiangge, et al.
Published: (2024)

Improved Regret Bounds for Online Fair Division with Bandit Learning
by: Schiffer, Benjamin, et al.
Published: (2025)

Last-Iterate Convergence of No-Regret Learning for Equilibria in Bargaining Games
by: Kamp, Serafina, et al.
Published: (2025)

Re-evaluating Open-ended Evaluation of Large Language Models
by: Liu, Siqi, et al.
Published: (2025)

Active Evaluation of General Agents: Problem Definition and Comparison of Baseline Algorithms
by: Lanctot, Marc, et al.
Published: (2026)

Regret Analysis of Repeated Delegated Choice
by: Hajiaghayi, MohammadTaghi, et al.
Published: (2023)

GPU-Accelerated Counterfactual Regret Minimization
by: Kim, Juho
Published: (2024)

Full Swap Regret and Discretized Calibration
by: Fishelson, Maxwell, et al.
Published: (2025)

Regret Analysis of Sleeping Competing Bandits
by: Uba, Shinnosuke, et al.
Published: (2026)

p-Mean Regret for Stochastic Bandits
by: Krishna, Anand, et al.
Published: (2024)

Regret Minimization in Stackelberg Games with Side Information
by: Harris, Keegan, et al.
Published: (2024)

Forecasting for Swap Regret for All Downstream Agents
by: Roth, Aaron, et al.
Published: (2024)

Regret Minimization in Bilateral Trade With Perturbed Markets
by: Lunghi, Anna, 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)

Selling Joint Ads: A Regret Minimization Perspective
by: Aggarwal, Gagan, et al.
Published: (2024)

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

Last-Iterate Convergence Properties of Regret-Matching Algorithms in Games
by: Cai, Yang, et al.
Published: (2023)

Autobidders with Budget and ROI Constraints: Efficiency, Regret, and Pacing Dynamics
by: Lucier, Brendan, et al.
Published: (2023)

Tight Regret Bounds for Bilateral Trade under Semi Feedback
by: Jin, Yaonan
Published: (2026)

No-Regret Algorithms in non-Truthful Auctions with Budget and ROI Constraints
by: Aggarwal, Gagan, et al.
Published: (2024)

Dynamic Regret Bounds for Online Omniprediction with Long Term Constraints
by: Bechavod, Yahav, et al.
Published: (2025)

Regret Minimization for Piecewise Linear Rewards: Contracts, Auctions, and Beyond
by: Bacchiocchi, Francesco, et al.
Published: (2025)

Nearly Tight Regret Bounds for Profit Maximization in Bilateral Trade
by: Di Gregorio, Simone, et al.
Published: (2025)

Computational Lower Bounds for Regret Minimization in Normal-Form Games
by: Anagnostides, Ioannis, et al.
Published: (2024)

Optimism Without Regularization: Constant Regret in Zero-Sum Games
by: Lazarsfeld, John, et al.
Published: (2025)

Swap Regret and Correlated Equilibria Beyond Normal-Form Games
by: Arunachaleswaran, Eshwar Ram, et al.
Published: (2025)

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)

An Efficient Black-Box Reduction from Online Learning to Multicalibration, and a New Route to $Φ$-Regret Minimization
by: Farina, Gabriele, et al.
Published: (2026)

No Coin Left Behind: Maximizing Strategic Surplus Against No-Regret Dynamics
by: Su, Yiheng, et al.
Published: (2026)

A Tight Regret Analysis of Non-Parametric Repeated Contextual Brokerage
by: Bachoc, François, et al.
Published: (2025)