arXiv (All)
open access
Multiplicative Optimism for Constant Regret in Games
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 co
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Multiplicative Optimism for Constant Regret in Games#1006841
- Constant Swap Regret in General-Sum Games via Two-Scale Higher-Order Optimism#1048802
- Monotone Inclusion Approach to Weakly Monotone Discrete-Time Finite-Horizon Mean-Field Games#612506
- Monotone Inclusion Approach to Weakly Monotone Discrete-Time Finite-Horizon Mean-Field Games#611029
- Fairness under uncertainty in sequential decisions#126517
Record · ID 1036364
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive