# Fully distributed optimal channel assignment for open spectrum access

arXiv: https://arxiv.org/abs/1312.7685 · HTML: https://mlsanity.com/paper/1312.7685/

## Key facts

- Cited by 3 papers in the map (data through 14 Oct 2026).
- First posted on arXiv 30 Dec 2013.

## Built on by (most cited first, 3 of 3)

- [Decentralized Task Offloading in Edge Computing: A Multi-User Multi-Armed Bandit Approach](https://mlsanity.com/paper/2112.11818/) (2021)
- [Medium Access Control protocol for Collaborative Spectrum Learning in Wireless Networks](https://mlsanity.com/paper/2111.12581/) (2021)
- [Near-Optimal Privacy-Preserving Learning for Max-Min Fair Multi-Agent Bandits](https://mlsanity.com/paper/2306.04498/) (2023)

## Abstract (arXiv)

In this paper we address the problem of fully distributed assignment of users to sub-bands such that the sum-rate of the system is maximized. We introduce a modified auction algorithm that can be applied in a fully distributed way using an opportunistic CSMA assignment scheme and is ε optimal. We analyze the expected time complexity of the algorithm and suggest a variant to the algorithm that has lower expected complexity. We then show that in the case of i.i.d Rayleigh channels a simple greedy scheme is asymptotically optimal as SNR increases or as the number of users is increased to infinity. We conclude by providing simulated results of the suggested algorithms.