Flooding with Absorption: An Efficient Protocol for Heterogeneous
Bandits over Complex Networks

v1v2v3v4 (latest)

Flooding with Absorption: An Efficient Protocol for Heterogeneous Bandits over Complex Networks

9 March 2023

ArXiv (abs)PDF HTML

Papers citing "Flooding with Absorption: An Efficient Protocol for Heterogeneous Bandits over Complex Networks"

8 / 8 papers shown

Title
Collaborative Multi-Agent Heterogeneous Multi-Armed Bandits Ronshee Chawla Daniel Vial Sanjay Shakkottai R. Srikant 60 4 0 30 May 2023
One More Step Towards Reality: Cooperative Bandits with Imperfect Communication Udari Madhushani Abhimanyu Dubey Naomi Ehrich Leonard Alex Pentland 74 25 0 24 Nov 2021
Cooperative Multi-Agent Bandits with Heavy Tails Abhimanyu Dubey Alex Pentland 41 50 0 14 Aug 2020
Robust Multi-Agent Multi-Armed Bandits Daniel Vial Sanjay Shakkottai R. Srikant 59 37 0 07 Jul 2020
Multi-Armed Bandit Based Client Scheduling for Federated Learning Wenchao Xia Tony Q.S. Quek Kun Guo Wanli Wen Howard H. Yang Hongbo Zhu FedML 103 221 0 05 Jul 2020
Spectrum Bandit Optimization Marc Lelarge Alexandre Proutiere Sadegh Talebi 61 28 0 27 Feb 2013
Information Spreading in Dynamic Graphs A. Clementi R. Silvestri Luca Trevisan 95 72 0 02 Nov 2011
Global Computation in a Poorly Connected World: Fast Rumor Spreading with No Dependence on Conductance K. Censor-Hillel Bernhard Haeupler Jonathan A. Kelner P. Maymounkov LRM 70 84 0 14 Apr 2011