Cover Image

Regret Minimization and Convergence to Equilibria in General-sum Markov Games

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Erez, Liad, Lancewicki, Tal, Sherman, Uri, Koren, Tomer, Mansour, Yishay
Format:	Preprint
Published:	2022
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

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

Regret Minimization in Population Network Games: Vanishing Heterogeneity and Convergence to Equilibria
by: Hu, Die, 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)

The Real Price of Bandit Information in Multiclass Classification
by: Erez, Liad, et al.
Published: (2024)

Fast Rates for Bandit PAC Multiclass Classification
by: Erez, Liad, et al.
Published: (2024)

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

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

From Contextual Combinatorial Semi-Bandits to Bandit List Classification: Improved Sample Complexity with Sparse Rewards
by: Erez, Liad, et al.
Published: (2025)

Next-Token Prediction and Regret Minimization
by: Mohri, Mehryar, 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)

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

Convergence of Policy Mirror Descent Beyond Compatible Function Approximation
by: Sherman, Uri, et al.
Published: (2025)

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

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

Convergence and Sample Complexity of First-Order Methods for Agnostic Reinforcement Learning
by: Sherman, Uri, et al.
Published: (2025)

Parallelizing Counterfactual Regret Minimization
by: Kim, Juho, et al.
Published: (2026)

Optimal Correlated Equilibria in General-Sum Extensive-Form Games: Fixed-Parameter Algorithms, Hardness, and Two-Sided Column-Generation
by: Zhang, Brian, et al.
Published: (2022)

Minimally Modifying a Markov Game to Achieve Any Nash Equilibrium and Value
by: Wu, Young, et al.
Published: (2023)

Do LLM Agents Have Regret? A Case Study in Online Learning and Games
by: Park, Chanwoo, et al.
Published: (2024)

The Intelligent Disobedience Game: Formulating Disobedience in Stackelberg Games and Markov Decision Processes
by: Hornig, Benedikt, et al.
Published: (2026)

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

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

Near-optimal Regret Using Policy Optimization in Online MDPs with Aggregate Bandit Feedback
by: Lancewicki, Tal, et al.
Published: (2025)

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

The Battling Influencers Game: Nash Equilibria Structure of a Potential Game and Implications to Value Alignment
by: Wu, Young, et al.
Published: (2025)

Incentives, Equilibria, and the Limits of Healthcare AI: A Game-Theoretic Perspective
by: Ercole, Ari
Published: (2026)

Reasoning and Behavioral Equilibria in LLM-Nash Games: From Mindsets to Actions
by: Zhu, Quanyan
Published: (2025)

The Sample Complexity of Multiclass and Sparse Contextual Bandits
by: Erez, Liad, et al.
Published: (2026)

Improving Sample Efficiency of Model-Free Algorithms for Zero-Sum Markov Games
by: Feng, Songtao, et al.
Published: (2023)

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

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

Cooperation Dynamics in Multi-Agent Systems: Exploring Game-Theoretic Scenarios with Mean-Field Equilibria
by: Sathi, Vaigarai, et al.
Published: (2023)

Rate-Optimal Policy Optimization for Linear Markov Decision Processes
by: Sherman, Uri, et al.
Published: (2023)

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

Computational Lower Bounds for Regret Minimization in Normal-Form Games
by: Anagnostides, Ioannis, 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)

Bidding Games on Markov Decision Processes with Quantitative Reachability Objectives
by: Avni, Guy, et al.
Published: (2024)

Endogenous Information in Routing Games: Memory-Constrained Equilibria, Recall Braess Paradoxes, and Memory Design
by: Alqithami, Saad
Published: (2026)

LLM-Stackelberg Games: Conjectural Reasoning Equilibria and Their Applications to Spearphishing
by: Zhu, Quanyan
Published: (2025)