The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
Distributed Learning in Multi-Armed Bandit With Multiple Players
Open accessAbstract
We formulate and study a decentralized multi-armed bandit (MAB) problem. There are M distributed players competing for N independent arms. Each arm, when played, offers i.i.d. reward according to a distribution with an unknown parameter. At each time, each player chooses one arm to play without exchanging observations or any information with other players. Players choosing the same arm collide, and, depending on the collision model, either no one receives reward or the colliding players share the reward in an arbitrary way. We show that the minimum system regret of the decentralized MAB grows with time at the same logarithmic order as in the centralized counterpart where players act collectively as a single entity by exchanging observations and making decisions jointly. A decentralized policy is constructed to achieve this optimal order while ensuring fairness among players and without assuming any pre-agreement or information exchange among players. Based on a time-division fair sharing (TDFS) of the M best arms, the proposed policy is constructed and its order optimality is proven under a general reward model. Furthermore, the basic structure of the TDFS policy can be used with any order-optimal single-player policy to achieve order optimality in the decentralized setting. We also establish a lower bound on the system regret for a general class of decentralized polices, to which the proposed policy belongs. This problem finds potential applications in cognitive radio networks, multi-channel communication systems, multi-agent systems, web search and advertising, and social networks.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Finite-time Analysis of the Multiarmed Bandit Problem
Auer, P., Cesa-Bianchi, N., & Fischer, P. (2002) · Machine Learning · doi:10.1023/a:1013689704352 · Cited by 6,033
Cited by
Spectrum Sensing for Cognitive Radio : State-of-the-Art and Recent Advances
Axell, E., Leus, G., Larsson, E. G., & Poor, H. V. (2012) · IEEE Signal Processing Magazine · doi:10.1109/msp.2012.2183771 · Cited by 1,116
Multi-Armed Bandit-Based Client Scheduling for Federated Learning
Xia, W., Quek, T. Q. S., Guo, K., Wen, W., Yang, H. H., & Zhu, H. (2020) · IEEE Transactions on Wireless Communications · doi:10.1109/twc.2020.3008091 · Cited by 313
Xu, Y., Wang, J., Wu, Q., Anpalagan, A., & Yao, Y.-D. (2012) · IEEE Transactions on Wireless Communications · doi:10.1109/twc.2012.020812.110025 · Cited by 280
Learning Based Content Caching and Sharing for Wireless Networks
Song, J., Sheng, M., Quek, T. Q. S., Xu, C., & Wang, X. (2017) · IEEE Transactions on Communications · doi:10.1109/tcomm.2017.2713384 · Cited by 144
Learning State Selection for Reconfigurable Antennas: A Multi-Armed Bandit Approach
Gulati, N., & Dandekar, K. R. (2014) · IEEE Transactions on Antennas and Propagation · doi:10.1109/tap.2013.2276414 · Cited by 69
Metadata
- Authors
- Liu, K., & Zhao, Q.
- Venue
- IEEE Transactions on Signal Processing
- Published
- 2010-11
- Volume
- 58
- Issue
- 11
- Pages
- 5667-5681
- ISSN
- 1053-587X (ISSN-L)
- 1941-0476
- OpenAlex
- W2140571193
- Cited by
- 385
- References
- 1
- FWCI
- 38.37
- Type
- journal article
- Language
- en
- Open access
- green
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Distributed Learning in Multi-Armed Bandit With Multiple Players. https://app.cochat.ai/papers/10.1109/tsp.2010.2062509
- The paper
- Liu, K., & Zhao, Q. (2010). Distributed Learning in Multi-Armed Bandit With Multiple Players. IEEE Transactions on Signal Processing. https://doi.org/10.1109/tsp.2010.2062509
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.