Cover Image

Minimizing Weighted Counterfactual Regret with Optimistic Online Mirror Descent

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Xu, Hang, Li, Kai, Liu, Bingyun, Fu, Haobo, Fu, Qiang, Xing, Junliang, Cheng, Jian
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

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

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

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)

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

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

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

Regret Minimization in Population Network Games: Vanishing Heterogeneity and Convergence to Equilibria
by: Hu, Die, et al.
Published: (2025)

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

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

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

Configurable Mirror Descent: Towards a Unification of Decision Making
by: Li, Pengdeng, et al.
Published: (2024)

KrwEmd: Revising the Imperfect-Recall Abstraction from Forgetting Everything
by: Fu, Yanchang, et al.
Published: (2025)

Beyond Outcome-Based Imperfect-Recall: Higher-Resolution Abstractions for Imperfect-Information Games
by: Fu, Yanchang, et al.
Published: (2025)

Combining Counterfactual Regret Minimization with Information Gain to Solve Extensive Games with Unknown Environments
by: Qiu, Chen, et al.
Published: (2021)

Approximate Proportionality in Online Fair Division
by: Choo, Davin, et al.
Published: (2025)

Two-Sided Time-Independent Regret for Matching Markets with Limited Interviews
by: Mirfakhar, Amirmahdi, et al.
Published: (2026)

Online Competitive Information Gathering for Partially Observable Trajectory Games
by: Krusniak, Mel, et al.
Published: (2025)

Online Housing Market
by: Lesca, Julien
Published: (2025)

Strategic Facility Location with Clients that Minimize Total Waiting Time
by: Krogmann, Simon, et al.
Published: (2022)

Online Fair Division with Additional Information
by: Neoh, Tzeh Yuan, et al.
Published: (2025)

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

Truthful Aggregation of LLMs with an Application to Online Advertising
by: Soumalias, Ermis, et al.
Published: (2024)

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

Online Learning from Strategic Human Feedback in LLM Fine-Tuning
by: Hao, Shugang, 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)

From Competition to Collaboration: Designing Sustainable Mechanisms Between LLMs and Online Forums
by: Fono, Niv, et al.
Published: (2026)

HSVI-based Online Minimax Strategies for Partially Observable Stochastic Games with Neural Perception Mechanisms
by: Yan, Rui, et al.
Published: (2024)

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

The Attacker in the Mirror: Breaking Self-Consistency in Safety via Anchored Bipolicy Self-Play
by: La Malfa, Gabriele, et al.
Published: (2026)

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

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

Beyond Right to be Forgotten: Managing Heterogeneity Side Effects Through Strategic Incentives
by: Shao, Jiaqi, et al.
Published: (2024)

Regret-Minimizing Contracts: Agency Under Uncertainty
by: Bernasconi, Martino, et al.
Published: (2024)

MEBS: Multi-task End-to-end Bid Shading for Multi-slot Display Advertising
by: Gong, Zhen, et al.
Published: (2024)

Fast Rates in $α$-Potential Games via Regularized Mirror Descent
by: Chen, Claire, et al.
Published: (2026)

Accelerating Nash Equilibrium Convergence in Monte Carlo Settings Through Counterfactual Value Based Fictitious Play
by: Qi, Ju, et al.
Published: (2023)

Robust Reward Design for Markov Decision Processes
by: Wu, Shuo, et al.
Published: (2024)

Tight Regret Upper and Lower Bounds for Optimistic Hedge in Two-Player Zero-Sum Games
by: Tsuchiya, Taira
Published: (2025)

Enhanced Equilibria-Solving via Private Information Pre-Branch Structure in Adversarial Team Games
by: Qiu, Chen, et al.
Published: (2024)