Skip to main navigation Skip to search Skip to main content

Asymptotic Optimality for Decentralised Bandits

Research output: Contribution to journal › Article (Academic Journal) › peer-review

4 Citations (Scopus)
32 Downloads (Pure)

Abstract

We consider a large number of agents collaborating on a multi-armed bandit problem with a large number of arms. We present an algorithm which improves upon the Gossip- Insert-Eliminate method of Chawla et al. [3]. We provide a regret bound which shows that our algorithm is asymptotically optimal and present empirical results demonstrating lower regret on simulated data.
Original languageEnglish
Pages (from-to)51-53
Number of pages3
JournalACM SIGMETRICS Performance Evaluation Review
Volume49
Issue number2
DOIs
Publication statusPublished - 20 Jan 2022
EventReinforcement Learning in Networks and Queues, Sigmetrics 2021 -
Duration: 14 Jun 2021 → 14 Jun 2021

Fingerprint

Dive into the research topics of 'Asymptotic Optimality for Decentralised Bandits'. Together they form a unique fingerprint.
  • Asymptotic Optimality for Decentralised Bandits

    Newton, C. J., Ganesh, A. & Reeve, H. W. J., 1 Mar 2023, In: Dynamic Games and Applications. 13, p. 307-325

    Research output: Contribution to journal › Article (Academic Journal) › peer-review

    Open Access
    File
    1 Citation (Scopus)
    132 Downloads (Pure)

Cite this