101 citations · 451 across the 77 of their papers we have counts for
11 papers · 1 filter
TinyQMIX: Distributed Access Control for mMTC via Multi-agent Reinforcement Learning
Tien Thanh Le, Yusheng Ji, John C. S Lui
Distributed access control is a crucial component for massive machine type communication (mMTC). In this communication scenario, centralized resource allocation is not scalable bec…
Online Search with Predictions: Pareto-optimal Algorithm and its Applications in Energy Markets
Russell Lee, Bo Sun, Mohammad Hajiesmaili +1
This paper develops learning-augmented algorithms for energy trading in volatile electricity markets. The basic problem is to sell (or buy) units of energy for the highest reve…
The Online Knapsack Problem with Departures
Bo Sun, Lin Yang, Mohammad Hajiesmaili +4
The online knapsack problem is a classic online resource allocation problem in networking and operations research. Its basic version studies how to pack online arriving items of di…
Federated Online Clustering of Bandits
Xutong Liu, Haoru Zhao, Tong Yu +2
Contextual multi-armed bandit (MAB) is an important sequential decision-making problem in recommendation systems. A line of works, called the clustering of bandits (CLUB), utilize…
Batch-Size Independent Regret Bounds for Combinatorial Semi-Bandits with Probabilistically Triggered Arms or Independent Arms
Xutong Liu, Jinhang Zuo, Siwei Wang +3
In this paper, we study the combinatorial semi-bandits (CMAB) and focus on reducing the dependency of the batch-size in the regret bound, where is the total number of arms…
Multiple-Play Stochastic Bandits with Shareable Finite-Capacity Arms
Xuchuang Wang, Hong Xie, John C. S. Lui
We generalize the multiple-play multi-armed bandits (MP-MAB) problem with a shareable arm setting, in which several plays can share the same arm. Furthermore, each shareable arm ha…