52 citations · 314 across the 32 of their papers we have counts for
Showing stat.MLShow all
3 papers · 1 filter
stat.ML2022
Private and Byzantine-Proof Cooperative Decision-Making
Abhimanyu Dubey, Alex Pentland
The cooperative bandit problem is a multi-agent decision problem involving a group of agents that interact simultaneously with a multi-armed bandit, while communicating over a netw…
stat.ML2021★ 5 cited
One More Step Towards Reality: Cooperative Bandits with Imperfect Communication
Udari Madhushani, Abhimanyu Dubey, Naomi Ehrich Leonard +1
The cooperative bandit problem is increasingly becoming relevant due to its applications in large-scale decision-making. However, most research for this problem focuses exclusively…
stat.ML2021★ 2 cited
No-Regret Algorithms for Private Gaussian Process Bandit Optimization
Abhimanyu Dubey
The widespread proliferation of data-driven decision-making has ushered in a recent interest in the design of privacy-preserving algorithms. In this paper, we consider the ubiquito…