Cover Image

Last-Iterate Convergence of No-Regret Learning for Equilibria in Bargaining Games

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Kamp, Serafina, Liebman, Reese, Fish, Benjamin
Format:	Preprint
Published:	2025
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

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

Equal Merit Does Not Imply Equality: Discrimination at Equilibrium in a Hiring Market with Symmetric Agents
by: Kamp, Serafina, et al.
Published: (2024)

Efficient Last-Iterate Convergence in Regret Minimization via Adaptive Reward Transformation
by: Ren, Hang, et al.
Published: (2025)

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

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

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

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

Fast Last-Iterate Convergence of Learning in Games Requires Forgetful Algorithms
by: Cai, Yang, 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)

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

Learning Zero-Sum Linear Quadratic Games with Improved Sample Complexity and Last-Iterate Convergence
by: Wu, Jiduan, et al.
Published: (2023)

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

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)

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

Last-iterate Convergence Separation between Extra-gradient and Optimism in Constrained Periodic Games
by: Feng, Yi, et al.
Published: (2024)

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

On Tractable $Φ$-Equilibria in Non-Concave Games
by: Cai, Yang, et al.
Published: (2024)

Efficient Last-iterate Convergence Algorithms in Solving Games
by: Meng, Linjian, et al.
Published: (2023)

Last-Iterate Convergence of Adaptive Riemannian Gradient Descent for Equilibrium Computation
by: Cai, Yang, et al.
Published: (2023)

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

Last-iterate Convergence for Symmetric, General-sum, $2 \times 2$ Games Under The Exponential Weights Dynamic
by: Wang, Guanghui, et al.
Published: (2025)

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

Last-Iterate Convergence in Adaptive Regret Minimization for Approximate Extensive-Form Perfect Equilibrium
by: Ren, Hang, et al.
Published: (2025)

Market Games for Generative Models: Equilibria, Welfare, and Strategic Entry
by: Wei, Xiukun, et al.
Published: (2026)

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

Boosting Perturbed Gradient Ascent for Last-Iterate Convergence in Games
by: Abe, Kenshi, et al.
Published: (2024)

Learning not to Regret
by: Sychrovský, David, et al.
Published: (2023)

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

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

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

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

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

Efficient Uncoupled Learning Dynamics with $\tilde{O}\!\left(T^{-1/4}\right)$ Last-Iterate Convergence in Bilinear Saddle-Point Problems over Convex Sets under Bandit Feedback
by: Maiti, Arnab, et al.
Published: (2026)

NashPG: A Policy Gradient Method with Iteratively Refined Regularization for Finding Nash Equilibria
by: Yu, Eason, et al.
Published: (2025)

$\widetilde{O}(T^{-1})$ Convergence to (Coarse) Correlated Equilibria in Full-Information General-Sum Markov Games
by: Mao, Weichao, et al.
Published: (2024)

Maximin Relative Improvement: Fair Learning as a Bargaining Problem
by: Han, Jiwoo, et al.
Published: (2026)

Towards Performatively Stable Equilibria in Decision-Dependent Games for Arbitrary Data Distribution Maps
by: Zhong, Guangzheng, et al.
Published: (2025)

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

Learning and Computation of $Φ$-Equilibria at the Frontier of Tractability
by: Zhang, Brian Hu, et al.
Published: (2025)

Scale-Invariant Fast Convergence in Games
by: Tsuchiya, Taira, et al.
Published: (2026)