On-Demand Communication for Asynchronous Multi-Agent Bandits

This paper studies a cooperative multi-agent multi-armed stochastic bandit problem where agents operate asynchronously -- agent pull times and rates are unknown, irregular, and heterogeneous -- and face the same instance of a K-armed bandit problem. Agents can share reward information to speed up th...

Ausführliche Beschreibung

Bibliographische Detailangaben

Hauptverfasser:	Chen, Yu-Zhen Janice, Yang, Lin, Wang, Xuchuang, Liu, Xutong, Hajiesmaili, Mohammad, Lui, John C. S, Towsley, Don
Format:	Artikel
Sprache:	eng
Schlagworte:	Computer Science - Distributed, Parallel, and Cluster Computing Computer Science - Learning Computer Science - Multiagent Systems Statistics - Machine Learning
Online-Zugang:	Volltext bestellen
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!