arXiv (All)
open access
Multi-Armed Bernoulli Bandits via Minimax Single-Arm Stopping
We develop an index policy for finite-horizon Bernoulli multi-armed bandits from minimax solutions to single-arm bandit (SAB) problems. Each SAB problem involves choosing between an unknown Bernoulli arm and a known reward. We show that minimizing worst-case regret of SAB problems over all non-antic
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
- Meritocratic Fairness in Budgeted Combinatorial Multi-armed Bandits via Shapley Values#151720
- MESHA: Mechanism-Enforced Sequential Halving for Strategic Linear Bandits#373413
- Projection-Free Algorithms for Nonsmooth Stochastic Convex-Concave Saddle-Point Problems#1129869
- Bandits with Probing: Optimal Regret and the Limits of Winner Feedback#1109288
- Minimization Prophet Inequality with Bounded Costs#974040
Record · ID 1037373
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