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

接近最优的贝叶斯在线可重复资源 assortments

Near-Optimal Bayesian Online Assortment of Reusable Resources

Hong Kong University of Science & Technology (HKUST)(香港科技大学);University of Chicago Booth School of Business(芝加哥大学布斯商学院);Stanford University(斯坦福大学)

Yiding Feng, Rad Niazadeh, Amin Saberi

AI总结:

本文提出了一种接近最优的贝叶斯在线算法,用于可重复资源的 assortments,通过期望 LP 基准和随机化取整实现库存可行性,并引入 discard 策略和 post-processing 程序来优化资源分配和收益。

摘要:

受电子商务中租赁服务应用的启发,我们考虑在线可重复资源 assortments 的收入最大化问题,针对到来的消费者流,这些消费者具有不同的类型。我们设计了与贝叶斯设定中最优在线策略相竞争的在线算法,在此设定中,类型独立地从已知的异质分布中抽取。在初始库存 $c_0 $ 的最小值较大的情况下,我们的主要结果是一个接近最优的 $1-\min\left(\frac{1}{2},\sqrt{\log(c_0)/c_0}\right)$ 竞争算法,适用于可重复资源的一般情况。我们的算法依赖于问题的一个期望线性规划(LP)基准,解决这个 LP,并通过独立的随机化取整来模拟解决方案。主要挑战是高效地从这些基于模拟的算法中获得点状库存可行性。为此,我们使用几种技术成分来设计 discard 策略——每个资源一个。这些策略处理在可重复性下库存可行性和每个资源的收入损失之间的权衡。然而,丢弃一个资源的单位会改变其他资源的未来消耗。为了解决这个新挑战,我们还引入了 post-processing assortments 程序,帮助在并行运行时设计和分析我们的 discard 策略,这可能具有独立的兴趣。作为副结果,通过利用文献中关于 prophet 不等式的技术,我们进一步展示了非可重复资源的改进的接近最优 $1-1/\sqrt{c_0+3}$ 竞争算法。最后,我们使用合成数据的数值模拟来评估我们的算法性能。

英文摘要:

Motivated by the applications of rental services in e-commerce, we consider revenue maximization in online assortment of reusable resources for a stream of arriving consumers with different types. We design competitive online algorithms with respect to the optimum online policy in the Bayesian setting, in which types are drawn independently from known heterogeneous distributions over time. In the regime where the minimum of initial inventories $c_0$ is large, our main result is a near-optimal $1-\min\left(\frac{1}{2},\sqrt{\log(c_0)/c_0}\right)$ competitive algorithm for the general case of reusable resources. Our algorithm relies on an expected LP benchmark for the problem, solves this LP, and simulates the solution through an independent randomized rounding. The main challenge is obtaining point-wise inventory feasibility in a computationally efficient fashion from these simulation-based algorithms. To this end, we use several technical ingredients to design $\textit{discarding policies}$ -- one for each resource. These policies handle the trade-off between the inventory feasibility under reusability and the revenue loss of each of the resources. However, discarding a unit of a resource changes the future consumption of other resources. To handle this new challenge, we also introduce $\textit{post-processing}$ assortment procedures that help with designing and analyzing our discarding policies as they run in parallel, which might be of independent interest. As a side result, by leveraging techniques from the literature on prophet inequality, we further show an improved near-optimal $1-1/\sqrt{c_0+3}$ competitive algorithm for the special case of non-reusable resources. We finally evaluate the performance of our algorithms using the numerical simulations on the synthetic data.

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

↑