atlas

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

An Efficient Algorithm for Fair Multi-Agent Multi-Armed Bandit with Low Regret

AAAI 2023 · 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 Fair multi-agent UCB instead of Prior UCBMA-MAB (N=4, K=2) · MA-MAB (N=4, K=2), t=2·10^5 and t=5·10^5average cumulative regret: 1226 -> 1222; 1832 -> 1806Helped
Use Fair multi-agent UCB instead of Prior UCBMA-MAB (N=20, K=4) · MA-MAB (N=20, K=4), t=2·10^5 and t=5·10^5average cumulative regret: 10801 -> 8313; 21655 -> 15322Helped
Use Fair multi-agent UCB instead of Prior UCBMA-MAB (N=80, K=8) · MA-MAB (N=80, K=8), t=2·10^5 and t=5·10^5average cumulative regret: 5230 -> 4521; 12874 -> 9966Helped
Use Fair multi-agent UCB instead of Prior UCB at early iterationsMA-MAB with small N and K · MA-MAB, small sizes and t under 10,000cumulative regretMixed
Use the confidence-bound UCB variant with α_t = √(12NK log(NKt)) instead of α_t = N (ablation)Prior UCB · MA-MAB experimentscumulative regretHurt

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