arXiv (All)
open access
Exact Regret Frontiers and Externality Scheduling in Centralized Serial-Dictatorship Bandits
Exploration in centralized serial-dictatorship matching bandits must use complete matchings, so learning one player--arm pair can impose regret on others. We study this externality under a known common priority order and Gaussian rewards with unit variance. We show that the matching-level Graves--La
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
- On the Complexity of Preference-Based Bandits#1144318
- Calibration-Gated LLM Pseudo-Observations for Online Contextual Bandits#19029
- Memory--Batch Tradeoffs in Lipschitz Bandits#1118682
- On Pareto Optimality for Parametric Choice Bandits#163088
- Retroactive Monotonic Priority Queues via Range Searching#144345
Record · ID 1033745
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