Research map / Bandits and online learning / Multi-armed bandits
Bandit Learning with Positive Externalities
Virag Shah, Jose Blanchet, Ramesh Johari
Read the paperCheck your idea against 137,217 papers
AI-extracted. The measured effects below were read by AI from the paper's full text (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 BE-AE confidence-bound parameter p = 5c^{-1/2} rather than p = 1/2 (ablation) | BE with Arm Elimination · Simulation setup, α = 1 | pseudo-regret | Hurt |
| Use BE-AE confidence-bound parameter p = 5/2 (ablation) | BE with Arm Elimination · Simulation setup, α = 1 | pseudo-regret | Hurt |
| Use BE instead of BE-AE | Balanced exploration algorithms · Simulation setup, α = 1 | pseudo-regret | Mixed |
Closest papers by meaning
- A Closer Look at the Worst-case Behavior of Multi-armed Bandit Algorithms (NeurIPS 2021 · similarity 0.90)
- Adaptive Regret for Bandits Made Possible: Two Queries Suffice (ICLR 2024 · similarity 0.89)
- Causal Bandits: The Pareto Optimal Frontier of Adaptivity, a Reduction to Linear Bandits, and Limitations around Unknown Marginals (ICML 2024 · similarity 0.89)
- Bandits with Ranking Feedback (NeurIPS 2024 · similarity 0.88)
- Greedy Algorithms for Structured Bandits: A Sharp Characterization of Asymptotic Success / Failure (NeurIPS 2025 · similarity 0.88)
- Forced Exploration in Bandit Problems (AAAI 2024 · similarity 0.88)
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.
