Optimal Data Driven Resource Allocation under Multi-Armed Bandit Observations
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.
Code (0)
등록된 구현이 없습니다.
Similar Papers 제목 키워드 기반
The Limits of AI-Driven Allocation: Optimal Screening under Aleatoric Uncertainty
The rise of machine learning has shifted targeted resource allocation in policy and humanitarian settings toward algorithmic targeting based on predicted risk scores. This approach is typically cheaper and faster than tr…
Data-Driven Online Resource Allocation for User Experience Improvement in Mobile Edge Clouds
As the cloud is pushed to the edge of the network, resource allocation for user experience improvement in mobile edge clouds (MEC) is increasingly important and faces multiple challenges. This paper studies quality of ex…
Uncertainty Informed Optimal Resource Allocation with Gaussian Process based Bayesian Inference
We focus on the problem of uncertainty informed allocation of medical resources (vaccines) to heterogeneous populations for managing epidemic spread. We tackle two related questions: (1) For a compartmental ordinary diff…
Bayesian InferenceGaussian ProcessesStochastic OptimizationStochastic Averaging for Constrained Optimization with Application to Online Resource Allocation
Existing approaches to resource allocation for nowadays stochastic networks are challenged to meet fast convergence and tolerable delay requirements. The present paper leverages online learning advances to facilitate sto…
Welfare Measure for Resource Allocation with Algorithmic Implementation: Beyond Average and Max-Min
In this work, we propose an axiomatic approach for measuring the performance/welfare of a system consisting of concurrent agents in a resource-driven system. Our approach provides a unifying view on popular system optima…
Fairness