Cover Image

Learning in Markov Games with Adaptive Adversaries: Policy Regret, Fundamental Barriers, and Efficient Algorithms

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Nguyen-Tang, Thanh, Arora, Raman
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

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

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

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

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

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

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

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

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

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

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

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)

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

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

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)

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

Human Choice Prediction in Language-based Persuasion Games: Simulation-based Off-Policy Evaluation
by: Shapira, Eilam, et al.
Published: (2023)

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

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

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

Efficiently Training Neural Networks for Imperfect Information Games by Sampling Information Sets
by: Bertram, Timo, et al.
Published: (2024)

Meta-Computing Enhanced Federated Learning in IIoT: Satisfaction-Aware Incentive Scheme via DRL-Based Stackelberg Game
by: Li, Xiaohuan, et al.
Published: (2025)

Trustworthy Machine Learning under Social and Adversarial Data Sources
by: Shao, Han
Published: (2024)

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

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)

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

Online Test Synthesis From Requirements: Enhancing Reinforcement Learning with Game Theory
by: Sankur, Ocan, 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)

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

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

Mirror Mode in Fire Emblem: Beating Players at their own Game with Imitation and Reinforcement Learning
by: Smid, Yanna Elizabeth, et al.
Published: (2025)

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

Policy Aggregation
by: Alamdari, Parand A., et al.
Published: (2024)

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

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

NePPO: Near-Potential Policy Optimization for General-Sum Multi-Agent Reinforcement Learning
by: Kalanther, Addison, et al.
Published: (2026)

Bandits with Preference Feedback: A Stackelberg Game Perspective
by: Pásztor, Barna, et al.
Published: (2024)

Incentivizing Truthful Language Models via Peer Elicitation Games
by: Chen, Baiting, et al.
Published: (2025)