Multi-player multi-armed bandits for stable allocation in heterogeneous ad-hoc networks
SJ Darak, MK Hanawal - IEEE Journal on Selected Areas in …, 2019 - ieeexplore.ieee.org
Next generation networks are expected to be ultra-dense and aim to explore spectrum
sharing paradigm that allows users to communicate in licensed, shared as well as …
sharing paradigm that allows users to communicate in licensed, shared as well as …
Distributed learning and optimal assignment in multiplayer heterogeneous networks
We consider an ad hoc network where multiple users access the same set of channels. The
channel characteristics are unknown and could be different for each user (heterogeneous) …
channel characteristics are unknown and could be different for each user (heterogeneous) …
A survey on multi-player bandits
E Boursier, V Perchet - arXiv preprint arXiv:2211.16275, 2022 - arxiv.org
Due mostly to its application to cognitive radio networks, multiplayer bandits gained a lot of
interest in the last decade. A considerable progress has been made on its theoretical aspect …
interest in the last decade. A considerable progress has been made on its theoretical aspect …
Multiplayer bandits: A trekking approach
MK Hanawal, SJ Darak - IEEE Transactions on Automatic …, 2021 - ieeexplore.ieee.org
In this article, we study stochastic multiarmed bandits with many players. The players do not
know the number of players, cannot communicate with each other, and if multiple players …
know the number of players, cannot communicate with each other, and if multiple players …
Observe before play: Multi-armed bandit with pre-observations
We consider the stochastic multi-armed bandit (MAB) problem in a setting where a player
can, at a cost, pre-observe one or multiple arms before playing one of them in each round …
can, at a cost, pre-observe one or multiple arms before playing one of them in each round …
A Survey on Multi-player Bandits
E Boursier, V Perchet - Journal of Machine Learning Research, 2024 - jmlr.org
Due mostly to its application to cognitive radio networks, multiplayer bandits gained a lot of
interest in the last decade. A considerable progress has been made on its theoretical aspect …
interest in the last decade. A considerable progress has been made on its theoretical aspect …
Multiplayer multi-armed bandits for optimal assignment in heterogeneous networks
We consider an ad hoc network where multiple users access the same set of channels. The
channel characteristics are unknown and could be different for each user (heterogeneous) …
channel characteristics are unknown and could be different for each user (heterogeneous) …
Distributed algorithms for efficient learning and coordination in ad hoc networks
A distributed sampling strategy for multiple (N) agents is considered that minimizes the
sample complexity and regret of acquiring the best subset of size N among total K≥ N …
sample complexity and regret of acquiring the best subset of size N among total K≥ N …
Multi-players bandit algorithms for internet of things networks
L Besson - 2019 - theses.hal.science
In this PhD thesis, we study wireless networks and reconfigurable end-devices that can
access Cognitive Radio networks, in unlicensed bands and without central control. We focus …
access Cognitive Radio networks, in unlicensed bands and without central control. We focus …
Distributed learning and coordination in cognitive infrastructureless networks of unknown size
The cognitive infrastructureless network has received significant attention to reduce
signaling load in next-generation networks, which are expected to be ultradense with very …
signaling load in next-generation networks, which are expected to be ultradense with very …