On the Regularity and Fairness of Combinatorial Multi-Armed Bandit

Combinatorial multi-armed bandit (CMAB) model is designed to maximize cumulative rewards in the presence of uncertainty by selecting a subset of arms in each round. This paper is inspired by two critical applications in wireless networks, where it’s not only essential to maximize cumulative rewards but also to guarantee fairness among arms (i.e., the minimum average reward required by each arm) and ensure reward regularity (i.e., how often each arm receives the reward). In this paper, we propose a parameterized regular and fair learning algorithm to achieve these three objectives. In particular, the proposed algorithm linearly combines virtual queue-lengths (tracking the fairness violations), Time-Since-Last-Reward (TSLR) metrics, and Upper Confidence Bound (UCB) estimates in its weight measure. Here, TSLR is inspired by age-of-information and measures the elapsed number of rounds since an arm last received a reward, capturing the reward regularity performance, and UCB estimates are utilized to balance the tradeoff between exploration and exploitation in online learning. By uncovering a key relationship between the dynamics of virtual queue-lengths and TSLR metrics and utilizing several non-trivial Lyapunov functions, we analytically characterize zero cumulative fairness violation, reward regularity, and cumulative regret performance under our proposed algorithm. These theoretical outcomes are verified by simulations based on two real-world datasets.