arXiv (All)
open access
Mean-based algorithms: A lower bound and regret
Mean-based algorithms are online learning algorithms that assign low probability to actions with low average rewards. Recent research shows that they converge to serially undominated actions, which serve as approximations to Nash equilibria in economic games. However, empirical studies indicate that
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
- Evolutionary Analysis of Continuous-time Finite-state Mean Field Games with Discounted Payoffs#1156229
- Robustness and Approximation of Discrete-time Mean-field Games under Discounted Cost Criterion#128268
- A Unified Optimism-Agnostic Framework for Linear Bandits over Spherical Action Sets#1116480
- Constant regret in general games via higher-order optimism#926951
- $Q$ Can Play That Game: Online Fitted $Q$-Iteration for Continuous-Action Zero-Sum Markov Games with Convex-Concave Function Approximation#1199284
Record · ID 1217490
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