mlsanityData to 7 Oct 2026

Multi-user Communication Networks: A Coordinated Multi-armed Bandit Approach

arXiv 1808.04875 ↗First posted 14 Aug 2018cs.LG cs.MA stat.MLcited by 7

Not on the map. Why?

Abstract (arXiv)

Communication networks shared by many users are a widespread challenge nowadays. In this paper we address several aspects of this challenge simultaneously: learning unknown stochastic network characteristics, sharing resources with other users while keeping coordination overhead to a minimum. The proposed solution combines Multi-Armed Bandit learning with a lightweight signalling-based coordination scheme, and ensures convergence to a stable allocation of resources. Our work considers single-user level algorithms for two scenarios: an unknown fixed number of users, and a dynamic number of users. Analytic performance guarantees, proving convergence to stable marriage configurations, are presented for both setups. The algorithms are designed based on a system-wide perspective, rather than focusing on single user welfare. Thus, maximal resource utilization is ensured. An extensive experimental analysis covers convergence to a stable configuration as well as reward maximization. Experiments are carried out over a wide range of setups, demonstrating the advantages of our approach over existing state-of-the-art methods.

Key facts. Cited by 7 papers in the map (data through 7 Oct 2026). First posted on arXiv 14 Aug 2018.

Builds on

No reference list yet.

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2021: 3; 2022: 2; 2023: 1; 2024: 0; 2025: 0; 2026: 1.

7 papers.