most citedNear-Optimal Privacy-Preserving Learning for Max-Min Fair Multi-Agent Bandits

1 citations · 1 across the 1 of their papers we have counts for

collaborators

1 paper

cs.LG2026★ 1 cited

Near-Optimal Privacy-Preserving Learning for Max-Min Fair Multi-Agent Bandits

Amir Leshem

We study fair multi-agent multi-armed bandit learning under collision-only coordination. Agents cannot communicate explicitly during learning and observe only their own rewards and…