One for All and All for One: Distributed Learning of Fair Allocations With Multi-Player Bandits
IEEE Journal on Selected Areas in Information Theory(2021)
Abstract
Consider $N$ cooperative but non-communicating players where each plays one out of $M$ arms for $T$ turns. Players have different utilities for each arm, represented as an $N\times M$ matrix. These utilities are unknown to the players. In each turn, players select an arm and receive a noisy observation of their utility for it. However, if any other players selected the same arm in that tur...
MoreTranslated text
Key words
Quality of service,Resource management,Protocols,Task analysis,Information theory,Throughput,Games
AI Read Science
Must-Reading Tree
Example
![](https://originalfileserver.aminer.cn/sys/aminer/pubs/mrt_preview.jpeg)
Generate MRT to find the research sequence of this paper
Chat Paper
Summary is being generated by the instructions you defined