Search Results for author: Ayalvadi Ganesh

Found 3 papers, 0 papers with code

Asymptotic Optimality for Decentralised Bandits

no code implementations20 Sep 2021 Conor Newton, Ayalvadi Ganesh, Henry W. J. Reeve

In fact, our regret guarantee matches the asymptotically optimal rate achievable in the full communication setting.

The Gossiping Insert-Eliminate Algorithm for Multi-Agent Bandits

no code implementations15 Jan 2020 Ronshee Chawla, Abishek Sankararaman, Ayalvadi Ganesh, Sanjay Shakkottai

Agents use the communication medium to recommend only arm-IDs (not samples), and thus update the set of arms from which they play.

Social Learning in Multi Agent Multi Armed Bandits

no code implementations4 Oct 2019 Abishek Sankararaman, Ayalvadi Ganesh, Sanjay Shakkottai

Our setting consists of a large number of agents $n$ that collaboratively and simultaneously solve the same instance of $K$ armed MAB to minimize the average cumulative regret over all agents.

Multi-Armed Bandits

Cannot find the paper you are looking for? You can Submit a new open access paper.