arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2212.02855math.OC
收藏

可重用资源的在线资源分配

Online Resource Allocation for Reusable Resources

Xilin Zhang, Wang Chi Cheung

摘要:

研究了模型不确定性条件下可复用资源分配的一般模型。客户的非齐性总体顺序地到达决策者(DM)的平台。在观察客户的类型时,DM选择分配决策,这导致获得奖励和占用资源。每个资源单元被占用一个随机的持续时间,并且该单元在使用持续时间之后可用于另一个分配。我们的模型捕获了许多应用程序,涉及准入控制和分类规划。DM的目标是同时最大化多种类型的回报,同时满足资源约束和不确定的客户的到来过程。我们开发了一个接近最优的算法,实现最优预期回报的$(1-ε)$分数,其中的误差参数$ε$衰减为零的资源容量单位和地平线的长度增长。该算法以一种新颖的方式迭代地应用乘法权重更新算法,该算法平衡了获得的奖励量、占用的资源和使用持续时间之间的权衡。

英文摘要:

We study a general model on reusable resource allocation under model uncertainty. A heterogeneous population of customers arrive at the decision maker's (DM's) platform sequentially. Upon observing a customer's type, the DM selects an allocation decision, which leads to rewards earned and resources occupied. Each resource unit is occupied for a random duration, and the unit is available for another allocation after the usage duration. Our model captures numerous applications involving admission control and assortment planning. The DM aims to simultaneously maximize multiple types of rewards, while satisfying the resource constraints and being uncertain about the customers' arrival process. We develop a near-optimal algorithm that achieves $(1-ε)$ fraction of the optimal expected rewards, where the error parameter $ε$ decays to zero as the resource capacity units and the length of the horizon grow. The algorithm iteratively applies the Multiplicative Weight Update algorithm in a novel manner, which balances the trade-off among the amounts of rewards earned, resources occupied and usage durations.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑