The DOI matches its Crossref record; 2 of the 2 references it cites were found in a registry or an index.
Learning Multiuser Channel Allocations in Cognitive Radio Networks: A Combinatorial Multi-Armed Bandit Formulation
Abstract
We consider the following fundamental problem in the context of channelized dynamic spectrum access. There are M secondary users and N ¿ M orthogonal channels. Each secondary user requires a single channel for operation that does not conflict with the channels assigned to the other users. Due to geographic dispersion, each secondary user can potentially see different primary user occupancy behavior on each channel. Time is divided into discrete decision rounds. The throughput obtainable from spectrum opportunities on each user-channel combination over a decision period is modeled as an arbitrarily-distributed random variable with bounded support but unknown mean, i.i.d. over time. The objective is to search for an allocation of channels for all users that maximizes the expected sum throughput. We formulate this problem as a combinatorial multi-armed bandit (MAB), in which each arm corresponds to a matching of the users to channels. Unlike most prior work on multi-armed bandits, this combinatorial formulation results in dependent arms. Moreover, the number of arms grows super-exponentially as the permutation P(N, M). We present a novel matching-learning algorithm with polynomial storage and polynomial computation per decision period for this problem, and prove that it results in a regret (the gap between the expected sum-throughput obtained by a genie-aided perfect allocation and that obtained by this algorithm) that is uniformly upper-bounded for all time n by a function that grows as O(M4Nlogn), i.e. polynomial in the number of unknown parameters and logarithmic in time. We also discuss how our results provide a non-trivial generalization of known theoretical results on multi-armed bandits.
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
The Hungarian method for the assignment problem
Kuhn, H. W. (1955) · Naval Research Logistics Quarterly · doi:10.1002/nav.3800020109 · Cited by 13,120
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
Distributed Learning in Multi-Armed Bandit With Multiple Players
Liu, K., & Zhao, Q. (2010) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2010.2062509 · Cited by 385
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 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
- Gai, Y., Krishnamachari, B., & Jain, R.
- Venue
- 2010 IEEE Symposium on New Frontiers in Dynamic Spectrum (DySPAN)
- Publisher
- IEEE
- Published
- 2010-04
- Pages
- 1-9
- OpenAlex
- W2020254732
- Cited by
- 224
- References
- 2
- FWCI
- 15.90
- Type
- conference paper
- Language
- en
- Open access
- closed
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: Learning Multiuser Channel Allocations in Cognitive Radio Networks: A Combinatorial Multi-Armed Bandit Formulation. https://app.cochat.ai/papers/10.1109/dyspan.2010.5457857
- The paper
- Gai, Y., Krishnamachari, B., & Jain, R. (2010). Learning Multiuser Channel Allocations in Cognitive Radio Networks: A Combinatorial Multi-Armed Bandit Formulation. 2010 IEEE Symposium on New Frontiers in Dynamic Spectrum (DySPAN). https://doi.org/10.1109/dyspan.2010.5457857
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.