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

带资源约束的定价学习:从完全信息到机器学习价格

Learning to Price with Resource Constraints: From Full Information to Machine-Learned Prices

Massachusetts Institute of Technology(麻省理工学院);Institute of Data, System and Society at Massachusetts Institute of Technology(麻省理工学院数据、系统与社会研究所);Hong Kong University of Science and Technology(香港科技大学)

Ruicheng Ao, Jiashuo Jiang, David Simchi-Levi

AI总结:

本研究针对带背包约束的动态定价问题,提出三种适应不同信息环境的算法,分别实现对数遗憾、最优平方根遗憾及利用离线数据改进遗憾界,并通过实验验证其有效性。

摘要:

我们研究了带有背包约束的动态定价问题,解决了在资源约束下平衡探索与利用的挑战。我们提出了三种针对不同信息环境的算法:一种用于完全信息的边界吸引重解法,一种用于无先验信息场景的在线学习算法,以及一种利用已知估计误差上界的机器学习知情价格的估计后选择重解算法。边界吸引重解法在不要求非退化条件的情况下实现了对数遗憾,而在线学习算法达到了最优的$O(\sqrt{T})$遗憾。我们的估计后选择方法弥合了这些设置之间的差距,在可靠的离线数据可用时提供了改进的遗憾界。数值实验验证了我们的算法在各种场景下的有效性和鲁棒性。这项工作推进了对在线资源分配和动态定价的理解,提供了适应不同信息结构的实用解决方案。

英文摘要:

We study the dynamic pricing problem with knapsack, addressing the challenge of balancing exploration and exploitation under resource constraints. We introduce three algorithms tailored to different informational settings: a Boundary Attracted Re-solve Method for full information, an online learning algorithm for scenarios with no prior information, and an estimate-then-select re-solve algorithm that leverages machine-learned informed prices with known upper bound of estimation errors. The Boundary Attracted Re-solve Method achieves logarithmic regret without requiring the non-degeneracy condition, while the online learning algorithm attains an optimal $O(\sqrt{T})$ regret. Our estimate-then-select approach bridges the gap between these settings, providing improved regret bounds when reliable offline data is available. Numerical experiments validate the effectiveness and robustness of our algorithms across various scenarios. This work advances the understanding of online resource allocation and dynamic pricing, offering practical solutions adaptable to different informational structures.

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

↑