# Optimal Data Driven Resource Allocation under Multi-Armed Bandit Observations

arXiv: https://arxiv.org/abs/1811.12852 · HTML: https://mlsanity.com/paper/1811.12852/

## Key facts

- Cited by 1 papers in the map (data through 14 Oct 2026).
- First posted on arXiv 30 Nov 2018.

## Built on by (most cited first, 1 of 1)

- [Analyzing homogenous and heterogeneous multi-server queues via neural networks](https://mlsanity.com/paper/2504.01052/) (2025)

## Abstract (arXiv)

This paper introduces the first asymptotically optimal strategy for a multi armed bandit (MAB) model under side constraints. The side constraints model situations in which bandit activations are limited by the availability of certain resources that are replenished at a constant rate. The main result involves the derivation of an asymptotic lower bound for the regret of feasible uniformly fast policies and the construction of policies that achieve this lower bound, under pertinent conditions. Further, we provide the explicit form of such policies for the case in which the unknown distributions are Normal with unknown means and known variances, for the case of Normal distributions with unknown means and unknown variances and for the case of arbitrary discrete distributions with finite support.