Robust Multi-Agent Bandits Over Undirected Graphs
Robust Multi-Agent Bandits Over Undirected Graphs
复制标题
无向图上的鲁棒多智能体强盗
DOI:
10.1145/3570614
复制
发表时间:
2022
期刊:
影响因子:
--
通讯作者:
Srikant, R.
中科院分区:
文献类型:
--
作者:
Vial, Daniel;Shakkottai, Sanjay;Srikant, R.
We consider a multi-agent multi-armed bandit setting in whichnhonest agents collaborate over a network to minimize regret butmmalicious agents can disrupt learning arbitrarily. Assuming the network is the complete graph, existing algorithms incur O((m + K/n) łog (T) / Δ ) regret in this setting, whereKis the number of arms and Δ is the arm gap. For m łl K, this improves over the single-agent baseline regret of O(Kłog(T)/Δ). In this work, we show the situation is murkier beyond the case of a complete graph. In particular, we prove that if the state-of-the-art algorithm is used on the undirected line graph, honest agents can suffer (nearly) linear regret until time is doubly exponential inKandn. In light of this negative result, we propose a new algorithm for which thei-th agent has regret O(( dmal (i) + K/n) łog(T)/Δ) on any connected and undirected graph, where dmal(i) is the number ofi's neighbors who are malicious. Thus, we generalize existing regret bounds beyond the complete graph (where dmal(i) = m), and show the effect of malicious agents is entirely local (in the sense that only the dmal (i) malicious agents directly connected toiaffect its long-term regret).
DOI:
10.1145/3393691.3394217
发表时间:
2019
期刊:
Proceedings of the ACM on Measurement and Analysis of Computing Systems
影响因子:
--
作者:
Sankararaman, Abishek;Ganesh, Ayalvadi;Shakkottai, Sanjay
通讯作者:
Shakkottai, Sanjay