On the Convergence of Alternating Regret Matching Algorithms
cs.GT, cs.LG
Submitted: 2026-11-02
Updated: 2026-11-02
Terminology
Sources
- IR-PRM+ with Previous-Utility Prediction: Constant Regret and Best-Iterate Convergence
- Solving Large Imperfect Information Games Using CFR+
- Optimal Alternating Regret for Online Learning and Games
- Scale-Invariant Regret Matching and Online Learning with Optimal Convergence: Bridging Theory and Practice in Zero-Sum Games
Related papers
- How Many Votes is a Lie Worth? Measuring Strategyproofness through Resource Augmentation
- Effective Horizons for Prophet Inequalities with Discounted I.I.D. Rewards
- Truthful-in-Expectation Mechanism with Constant Maximin-Share Guarantee
- The Power of Recruiting the Smaller Side: Two Additional Traders Suffice in Two-Sided Markets
- From signaling to interviews in random matching markets
- Optimizing Social Utility in Sequential Experiments