Research map / Bandits and online learning / Multi-armed bandits
Multiple-Play Stochastic Bandits with Shareable Finite-Capacity Arms
Read the paperCheck your idea against 108,967 papers
AI-extracted summary. Written by AI from the paper's title only (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.
Measured effects reported in the paper
| What was changed | Where | Measured | Effect |
|---|---|---|---|
| Use OrchExplore instead of MP-SE-SA or ETC-UCB | MP-MAB-SA · Bernoulli-reward simulation | regret | Helped |
| Use the proposed uniform confidence interval (UCI) instead of Hoeffding-based intervals (ablation) | OrchExplore · Bernoulli-reward simulation | regret | Helped |
| Learn unknown capacities rather than use known capacities (ablation) | OrchExplore · Bernoulli-reward simulation | regret | Hurt |
| Model shareable arms explicitly and use OrchExplore instead of treating each allocation as an independent arm | MP-MAB-SA · Bernoulli-reward simulation | regret | Helped |
Closest papers by meaning
- Multiple-play Stochastic Bandits with Prioritized Arm Capacity Sharing (AAAI 2026 · similarity 0.93)
- Observe Before Play: Multi-Armed Bandit with Pre-Observations (AAAI 2020 · similarity 0.91)
- Budget-Constrained Multi-Armed Bandits With Multiple Plays (AAAI 2018 · similarity 0.90)
- Multi-Player Bandits – a Musical Chairs Approach (ICML 2016 · similarity 0.90)
- Regret Minimisation in Multi-Armed Bandits Using Bounded Arm Memory (AAAI 2020 · similarity 0.89)
- Statistical and Computational Trade-off in Multi-Agent Multi-Armed Bandits (NeurIPS 2023 · similarity 0.89)
Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.