Research map / Bandits and online learning / Multi-armed bandits
Fair Algorithms for Multi-Agent Multi-Armed Bandits
Safwan Hossain, Evi Micha, Nisarg Shah
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 UCB rather than the Explore-First or Epsilon-Greedy regret approach | Multi-agent bandit algorithms · MA-MAB | dependence on horizon T in expected regret: T^{2/3} -> T^{1/2} | Improved |
Closest papers by meaning
- Nash Social Welfare for Multi Armed Bandits: Trajectory-wise Expected and High Probability Regret (NeurIPS 2026 · similarity 0.91)
- No-Regret Learning for Fair Multi-Agent Social Welfare Optimization (NeurIPS 2024 · similarity 0.91)
- Honor Among Bandits: No-Regret Learning for Online Fair Division (NeurIPS 2024 · similarity 0.90)
- Robust Performance Incentivizing Algorithms for Multi-Armed Bandits with Strategic Agents (AAAI 2025 · similarity 0.89)
- Optimal Algorithm for Max-Min Fair Bandit (ICML 2025 · similarity 0.89)
- Heterogeneous Multi-Agent Bandits with Parsimonious Hints (AAAI 2025 · 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.
