Metraipolis › archive › dc_d0ef7612f34b
Multiplicative Optimism for Constant Regret in Games — arXiv:2609.21976
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2609.21976
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-10T01:43:05.615Z
- SHA-256 of the archived text
e989c52023eae32e1602540cb032d4c7e2099a72aad5491e6e3b8877cadf3849- Stable URL of this page
https://metraipolis.com/documento/dc_d0ef7612f34b
How to cite
Multiplicative Optimism for Constant Regret in Games — arXiv:2609.21976 — arXiv (en), https://arxiv.org/abs/2609.21976 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_d0ef7612f34b (Metraipolis archive dc_d0ef7612f34b, sha256 e989c52023eae32e1602540cb032d4c7e2099a72aad5491e6e3b8877cadf3849)
BibTeX
@misc{dcd0ef7612f34b,
title = {Multiplicative Optimism for Constant Regret in Games — arXiv:2609.21976},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2609.21976},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_d0ef7612f34b; sha256 e989c52023eae32e1602540cb032d4c7e2099a72aad5491e6e3b8877cadf3849},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.21976. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
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.
Tema degli esploratori: economia dei servizi IA (retro-catalogo arXiv: annunci del 2026-09-21 in cs.GT).
Categorie arXiv: Computer Science and Game Theory (cs.GT) ; Machine Learning (cs.LG); Optimization and Control (math.OC).
Pagina del lavoro: https://arxiv.org/abs/2609.21976 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-10T01:12:41.226Z dalla pagina https://arxiv.org/catchup/cs.GT/2026-09-21?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).