Deep (Predictive) Discounted Counterfactual Regret Minimization
Fuente:
arXiv
Saved in:
| Main Authors: | Xu, Hang, Li, Kai, Fu, Haobo, Fu, Qiang, Xing, Junliang, Cheng, Jian |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
Minimizing Weighted Counterfactual Regret with Optimistic Online Mirror Descent
by: Xu, Hang, et al.
Published: (2024)
by: Xu, Hang, et al.
Published: (2024)
Real-Time Parallel Counterfactual Regret Minimization
by: Li, Boning, et al.
Published: (2026)
by: Li, Boning, et al.
Published: (2026)
Solving Pasur Using GPU-Accelerated Counterfactual Regret Minimization
by: Baghal, Sina
Published: (2025)
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)
by: Jaafari, Zakaria El
Published: (2025)
Next-Token Prediction and Regret Minimization
by: Mohri, Mehryar, et al.
Published: (2026)
by: Mohri, Mehryar, et al.
Published: (2026)
Parallelizing Counterfactual Regret Minimization
by: Kim, Juho, et al.
Published: (2026)
by: Kim, Juho, et al.
Published: (2026)
GPU-Accelerated Counterfactual Regret Minimization
by: Kim, Juho
Published: (2024)
by: Kim, Juho
Published: (2024)
Regret Minimization and Convergence to Equilibria in General-sum Markov Games
by: Erez, Liad, et al.
Published: (2022)
by: Erez, Liad, et al.
Published: (2022)
Optimistic Thompson Sampling for No-Regret Learning in Unknown Games
by: Li, Yingru, et al.
Published: (2024)
by: Li, Yingru, 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)
by: Nguyen-Tang, Thanh, et al.
Published: (2024)
Do LLM Agents Have Regret? A Case Study in Online Learning and Games
by: Park, Chanwoo, et al.
Published: (2024)
by: Park, Chanwoo, et al.
Published: (2024)
From External to Swap Regret 2.0: An Efficient Reduction and Oblivious Adversary for Large Action Spaces
by: Dagan, Yuval, et al.
Published: (2023)
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)
by: D'Amico-Wong, Luca, et al.
Published: (2024)
Accelerating Nash Equilibrium Convergence in Monte Carlo Settings Through Counterfactual Value Based Fictitious Play
by: Qi, Ju, et al.
Published: (2023)
by: Qi, Ju, et al.
Published: (2023)
Efficient Last-Iterate Convergence in Regret Minimization via Adaptive Reward Transformation
by: Ren, Hang, et al.
Published: (2025)
by: Ren, Hang, et al.
Published: (2025)
Regret Minimization in Stackelberg Games with Side Information
by: Harris, Keegan, et al.
Published: (2024)
by: Harris, Keegan, et al.
Published: (2024)
Meta-Learning in Self-Play Regret Minimization
by: Sychrovský, David, et al.
Published: (2025)
by: Sychrovský, David, et al.
Published: (2025)
Regret Minimization in Bilateral Trade With Perturbed Markets
by: Lunghi, Anna, et al.
Published: (2026)
by: Lunghi, Anna, et al.
Published: (2026)
Iterative Nash Policy Optimization: Aligning LLMs with General Preferences via No-Regret Learning
by: Zhang, Yuheng, et al.
Published: (2024)
by: Zhang, Yuheng, et al.
Published: (2024)
Selling Joint Ads: A Regret Minimization Perspective
by: Aggarwal, Gagan, et al.
Published: (2024)
by: Aggarwal, Gagan, et al.
Published: (2024)
Large-Scale Auto-bidding with Nash Equilibrium Constraints
by: Mou, Zhiyu, et al.
Published: (2025)
by: Mou, Zhiyu, et al.
Published: (2025)
Regret Minimization for Piecewise Linear Rewards: Contracts, Auctions, and Beyond
by: Bacchiocchi, Francesco, et al.
Published: (2025)
by: Bacchiocchi, Francesco, et al.
Published: (2025)
Computational Lower Bounds for Regret Minimization in Normal-Form Games
by: Anagnostides, Ioannis, et al.
Published: (2024)
by: Anagnostides, Ioannis, et al.
Published: (2024)
Deep Reinforcement Learning for Sequential Combinatorial Auctions
by: Ravindranath, Sai Srivatsa, et al.
Published: (2024)
by: Ravindranath, Sai Srivatsa, et al.
Published: (2024)
LLM-Auction: Generative Auction towards LLM-Native Advertising
by: Zhao, Chujie, et al.
Published: (2025)
by: Zhao, Chujie, et al.
Published: (2025)
Decision Theory-Guided Deep Reinforcement Learning for Fast Learning
by: Wan, Zelin, et al.
Published: (2024)
by: Wan, Zelin, et al.
Published: (2024)
Predicting human decisions with behavioral theories and machine learning
by: Plonsky, Ori, et al.
Published: (2019)
by: Plonsky, Ori, et al.
Published: (2019)
Game Theory Meets Large Language Models: A Systematic Survey with Taxonomy and New Frontiers
by: Sun, Haoran, et al.
Published: (2025)
by: Sun, Haoran, et al.
Published: (2025)
Regret Bounds for Competitive Resource Allocation with Endogenous Costs
by: Chai, Rui
Published: (2026)
by: Chai, Rui
Published: (2026)
GemNet: Menu-Based, Strategy-Proof Multi-Bidder Auctions Through Deep Learning
by: Wang, Tonghan, et al.
Published: (2024)
by: Wang, Tonghan, et al.
Published: (2024)
Comparing Uniform Price and Discriminatory Multi-Unit Auctions through Regret Minimization
by: Potfer, Marius, et al.
Published: (2025)
by: Potfer, Marius, et al.
Published: (2025)
Human Choice Prediction in Language-based Persuasion Games: Simulation-based Off-Policy Evaluation
by: Shapira, Eilam, et al.
Published: (2023)
by: Shapira, Eilam, et al.
Published: (2023)
A Game-theoretic Framework for Privacy-preserving Federated Learning
by: Zhang, Xiaojin, et al.
Published: (2023)
by: Zhang, Xiaojin, et al.
Published: (2023)
ElementaryNet: A Non-Strategic Neural Network for Predicting Human Behavior in Normal-Form Games
by: d'Eon, Greg, et al.
Published: (2025)
by: d'Eon, Greg, et al.
Published: (2025)
Federated Learning for Data Market: Shapley-UCB for Seller Selection and Incentives
by: Chen, Kongyang, et al.
Published: (2024)
by: Chen, Kongyang, et al.
Published: (2024)
Learning Truthful Mechanisms without Discretization
by: Ma, Yunxuan, et al.
Published: (2025)
by: Ma, Yunxuan, et al.
Published: (2025)
The Relationship between No-Regret Learning and Online Conformal Prediction
by: Ramalingam, Ramya, et al.
Published: (2025)
by: Ramalingam, Ramya, et al.
Published: (2025)
On the Limitations and Possibilities of Nash Regret Minimization in Zero-Sum Matrix Games under Noisy Feedback
by: Maiti, Arnab, et al.
Published: (2023)
by: Maiti, Arnab, et al.
Published: (2023)
Spot Check Equivalence: an Interpretable Metric for Information Elicitation Mechanisms
by: Xu, Shengwei, et al.
Published: (2024)
by: Xu, Shengwei, et al.
Published: (2024)
Puzzle it Out: Local-to-Global World Model for Offline Multi-Agent Reinforcement Learning
by: Li, Sijia, et al.
Published: (2026)
by: Li, Sijia, et al.
Published: (2026)
Similar Items
-
Minimizing Weighted Counterfactual Regret with Optimistic Online Mirror Descent
by: Xu, Hang, et al.
Published: (2024) -
Real-Time Parallel Counterfactual Regret Minimization
by: Li, Boning, et al.
Published: (2026) -
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)