SOURCE-LINKED INTELLIGENCE

Multiplicative Optimism for Constant Regret in Games

arXiv · AI, language, vision and robotics · article · Sep 18, 2026 · UTC

We introduce Multiplicatively Optimistic Regret Matching (MORM), an uncoupled learning rule for finite general-sum games. Under simultaneous full-information self-play, every player achieves external regret $O(\sqrt n\log d)$ uniformly over all horizons, using only one-step optimism. The analysis combines a potential-based regret-matching argument with multiplicative stability and Hellinger control of strategy movement. A learning-rate safeguard additionally gives $O(\sqrt{T\log d})$ regret in the face of adversarial utilities.

Read original source ↗ Open in workspace

recordType

paper

region

Global