Constrained Combinatorial Multi-Armed Bandit Model

• The topic is a framework that generalizes classical multi-armed bandit problems by integrating combinatorial action spaces with explicit resource constraints.
• It employs UCB-based strategies and approximation oracles to efficiently allocate resources under budget limits and minimize cumulative regret.
• The model applies to wireless spectrum allocation, computing-time sharing, and smart grid systems, demonstrating broad practical relevance.

A constrained combinatorial multi-armed bandit (CMAB) model generalizes classical stochastic bandit problems by incorporating combinatorial action spaces together with explicit feasibility constraints on the selection or allocation of arms. The model formalizes sequential decision-making in resource allocation settings—such as budgeted assignment, scheduling, subset selection under side constraints—where, at each round, the learner selects a feasible combination of arms, each delivering potentially stochastic, arm-specific rewards. The combinatorial structure enables modeling of discrete or continuous allocations, cardinality-bounded selections, cost-limited subsets, matroid independence, and more, making CMABs an expressive framework for learning under resource or operational constraints.

1. Formal Model Specification

Let $K$ denote the number of resources (or arms), indexed by $k=1,\dots,K$. At each time step $t$, the learner selects an allocation vector $a_t=(a_{1,t},\dots,a_{K,t})$, where $a_{k,t}$ denotes the amount assigned to resource $k$ (discrete: $a_{k,t} \in \mathcal{A}_d = \{0,1,\dots,N-1\}$; continuous: $a_{k,t} \in \mathcal{A}_c = [0,Q]$). The set of feasible allocations is prescribed by the constraint

$$\mathcal{X} = \left\{ a \in \mathcal{A}^K : \sum_{k=1}^K a_k \leq Q \right\}$$

where $Q$ is the total available budget.

Upon allocating $k=1,\dots,K$0 to arm $k=1,\dots,K$1, the learner observes an individual reward

$k=1,\dots,K$2

with $k=1,\dots,K$3 drawn i.i.d. from an unknown distribution $k=1,\dots,K$4. Functions $k=1,\dots,K$5 are bounded in $k=1,\dots,K$6. The mean reward of allocating $k=1,\dots,K$7 to $k=1,\dots,K$8 is $k=1,\dots,K$9. In the semi-bandit setting, after each round the learner receives feedback on all $t$0.

The generic objective is to maximize expected reward $t$1 or, equivalently, to minimize cumulative regret over $t$2 rounds:

$t$3

where $t$4 and the $t$5-oracle provides approximate solutions.

2. Optimization Formulation and Combinatorial Structure

The offline combinatorial optimization can be reformulated in terms of base arms and an allocation indicator vector $t$6, where $t$7:

$t$8

Alternatively, when treating $t$9 as the decision variable, the problem reduces to

$a_t=(a_{1,t},\dots,a_{K,t})$0

with the given combinatorial constraints.

3. Algorithmic Approaches

3.1 CUCB-DRA: Discrete Resource Allocation

For discrete actions, the CUCB-DRA algorithm maintains, for each base arm $a_t=(a_{1,t},\dots,a_{K,t})$1, its play count $a_t=(a_{1,t},\dots,a_{K,t})$2 and empirical mean $a_t=(a_{1,t},\dots,a_{K,t})$3, and computes a UCB index:

$a_t=(a_{1,t},\dots,a_{K,t})$4

If $a_t=(a_{1,t},\dots,a_{K,t})$5, set the index to infinity. At round $a_t=(a_{1,t},\dots,a_{K,t})$6, the algorithm

1. Computes UCBs for all base arms.
2. Runs the offline $a_t=(a_{1,t},\dots,a_{K,t})$7-approximation oracle $a_t=(a_{1,t},\dots,a_{K,t})$8 to select $a_t=(a_{1,t},\dots,a_{K,t})$9.
3. Executes $a_{k,t}$0, observes semi-bandit feedback.
4. Updates statistics for each base arm played.

3.2 CUCB-CRA: Continuous Resource Allocation

For continuously-valued allocations, under an $a_{k,t}$1-Lipschitz assumption on $a_{k,t}$2, allocate via discretization with step size

$a_{k,t}$3

Construct the discretized set $a_{k,t}$4 and run CUCB-DRA on $a_{k,t}$5.

Both algorithms guarantee exploration due to UCB indices, while ensuring feasibility via the oracle enforcing the budget constraints.

4. Regret Analysis

The expected reward function $a_{k,t}$6 is monotone in $a_{k,t}$7, possesses $a_{k,t}$8-norm bounded smoothness $a_{k,t}$9, and enables tight regret analysis.

Discrete Case

Let $k$0 denote the minimal gap for base-arm $k$1. Distribution-dependent regret satisfies:

$k$2

Distribution-independent regret is:

$k$3

Continuous Case

Balancing discretization and learning error, with $k$4,

$k$5

The proof employs concentration bounds (Hoeffding’s inequality), structural decomposition of regret, and summing over rounds as determined by confidence intervals and gap parameters.

5. Key Applications

The constrained CMAB framework addresses numerous real-world resource allocation tasks:

• Wireless Spectrum Allocation: $k$6 models spectrum power or channel capacity; resources are users/messages; $k$7 encodes throughput, latency.
• Computing-Time Sharing: $k$8 is total CPU time; allocation distributes time slots to jobs.
• Smart Grid/Energy Procurement: $k$9 is aggregate energy, arms are stations or generators, allocation optimizes charging schedules.

The semi-bandit feedback and constraint handling are intrinsic to operational domains with partial observability and explicit resource limits.

6. Extensions and Generalizations

The model generalizes to broader combinatorial families, such as knapsack, matroid, or matching constraints, by leveraging generic $a_{k,t} \in \mathcal{A}_d = \{0,1,\dots,N-1\}$0-approximating offline oracles. Richer feedback regimes (full-bandit/censored/contextual models) and adaptive/hierarchical discretization for continuous actions represent further directions for performance improvement and theoretical optimality assessment.

Analysis of regret lower bounds under constrained semi-bandit feedback, and design of optimal algorithms for these settings, remain key open questions. The flexible model architecture supports plug-in of advances from combinatorial optimization, multi-resource scheduling, and online learning theory, facilitating applications across network management, energy systems, and parallel computing (Zuo et al., 2021).