atlas

Research map / Bandits and online learning / Multi-armed bandits

My Fair Bandit: Distributed Learning of Max-Min Fairness with Multi-player Bandits

ICML 2020 · Bandits and online learning › Multi-armed bandits · approach: Multi-agent bandits · 3 citations (OpenAlex)

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 changedWhereMeasuredEffect
Use the epoch-based distributed max-min fairness algorithm with exploration, matching, consensus, and exploitation phasesMulti-player bandits with heterogeneous rewards and no communication · General problemexpected regretHelped
Optimize sum of rewards instead of max-min fairnessMulti-player bandit allocation · U1 (N=4)max-min regret: \Omega\left(\frac{T}{4}\right)Hurt
Optimize sum of rewards instead of max-min fairnessMulti-player bandit allocation · U2 (N=10)max-min regret: \Omega\left(\frac{T}{10}\right)Hurt
Warm-start the matching phase from the last exploitation action when eligible (ablation)My Fair Bandit · U1 and U2 simulationspractical performanceHelped
Multiply confidence intervals by 0.01 (ablation)My Fair Bandit · U1 and U2 simulationspractical performanceHelped

Closest papers by meaning

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.

Open scime draft

Get the next scime Dispatch and a monthly field update

Free. We send a confirmation link first; every email has a one-click unsubscribe. Privacy