Pareto UCB1 Gossip achieves O(log T) Pareto regret while Simulated NSW UCB Gossip achieves O(T^{3/4}) regret under fairness, showing the cost of the fairness constraint.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
citation-role summary
method 1
citation-polarity summary
fields
cs.LG 1years
2026 1verdicts
UNVERDICTED 1roles
method 1polarities
use method 1representative citing papers
citing papers explorer
-
Multi-Objective Multi-Agent Bandits: From Learning Efficiency to Fairness Optimization
Pareto UCB1 Gossip achieves O(log T) Pareto regret while Simulated NSW UCB Gossip achieves O(T^{3/4}) regret under fairness, showing the cost of the fairness constraint.