34 citations · 58 across the 22 of their papers we have counts for
Showing 2023Show all
2 papers · 1 filter
cs.LG2023
BanditQ: Fair Bandits with Guaranteed Rewards
Abhishek Sinha
Classic no-regret multi-armed bandit algorithms, including the Upper Confidence Bound (UCB), Hedge, and EXP3, are inherently unfair by design. Their unfairness stems from their obj…
cs.LG2023★ 1 cited
No-regret Algorithms for Fair Resource Allocation
Abhishek Sinha, Ativ Joshi, Rajarshi Bhattacharjee +2
We consider a fair resource allocation problem in the no-regret setting against an unrestricted adversary. The objective is to allocate resources equitably among several agents in…