4 citations · 17 across the 9 of their papers we have counts for
Showing 2022 · cs.LGShow all
2 papers · 2 filters
cs.LG2022★ 2 cited
Minimax Regret for Cascading Bandits
Daniel Vial, Sujay Sanghavi, Sanjay Shakkottai +1
Cascading bandits is a natural and popular model that frames the task of learning to rank from Bernoulli click feedback in a bandit setting. For the case of unstructured rewards, w…
cs.LG2022
Robust Multi-Agent Bandits Over Undirected Graphs
Daniel Vial, Sanjay Shakkottai, R. Srikant
We consider a multi-agent multi-armed bandit setting in which honest agents collaborate over a network to minimize regret but malicious agents can disrupt learning arbitrar…