arXiv (All)
open access
Constant Swap Regret in General-Sum Games via Two-Scale Higher-Order Optimism
We give deterministic and uncoupled learning dynamics for finite multiplayer general-sum games under full-information feedback that achieve constant individual swap regret in self-play, independent of the horizon $T$. With $n$ players and at most $m$ actions each, every player's individual swap regr
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#1036364
- Multiplicative Optimism for Constant Regret in Games#1006841
- Independent Reinforcement Learning in Discounted Markov Games#819948
- A Logarithmic Regret Bound for Optimistic Hedge in General-Sum Games#1014265
- Nonstationary Generalized Linear Bandits with Discounted Online Mirror Descent#1117435
Record · ID 1048802
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