No Coin Left Behind: Maximizing Strategic Surplus Against No-Regret Dynamics
Not on the map. Why?
Abstract (arXiv)
We investigate the strategic surplus obtainable against a Follow-the-Regularized-Leader (FTRL) learner with constant step size η in n× m two-player zero-sum games played over T rounds against a clairvoyant optimizer. In contrast with prior analysis, we show that the extraction of such regret-scale surplus is an inherent feature of the FTRL family, rather than an artifact of specific instantiations. First, for a fixed max-min optimizer, we establish a sweeping law of order Omega(Nsub/η), proving that utility surplus scales with the number of the learner's suboptimal actions N and vanishes in their absence. Second, for an alternating optimizer, a surplus of Omega(η T/poly(n,m)) can be guaranteed regardless of the equilibrium structure, with high probability, in random games. Our analysis uncovers a sharp geometric dichotomy: non-steep regularizers allow the optimizer to realize the maximal transient surplus via finite-time elimination of suboptimal actions, whereas steep regularizers introduce a vanishing tail correction that can delay surplus saturation. Finally, we discuss whether this leverage persists under bilateral payoff uncertainty and propose a susceptibility measure quantifying which regularizers are most vulnerable to learner-aware strategic steering.
Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 14 of its 30 references that are in the map. First posted on arXiv 6 Apr 2026.
Builds on
14 of 30 references.
References · 14
- 2014Convex Optimization: Algorithms and Complexitycited by 575
- 2020Bias no more: high-probability data-dependent regret bounds for adversarial bandits and MDPscited by 51
- 2019Strategizing against No-regret Learnerscited by 50
- 2015Fighting Bandits with a New Kind of Smoothnesscited by 47
- 2022Strategizing against Learners in Bayesian Gamescited by 34
- 2021Survival of the strictest: Stable and unstable equilibria under regularized learning with partial informationcited by 23
- 2024Contracting with a Learning Agentcited by 23
- 2023Is Learning in Games Good for the Learners?cited by 20
- 2020Matrix games with bandit feedbackcited by 16
- 2014A continuous-time approach to online optimizationcited by 13
- 2024Maximizing utility in multi-agent environments by anticipating the behavior of other learnerscited by 8
- 2024Generalized Principal-Agent Problem with a Learning Agentcited by 6
Built on by
Not cited yet.