Technical Note—An Improved Analysis of LP-Based Control for Revenue Management
Operations Research · 2024-05 · 72 (3) · 1124-1138
DOI: 10.1287/opre.2022.2358 ↗Kurz gefasst
Fachartikel in der Zeitschrift Operations Research, 2024-05. Verfasst von Guanting Chen und 2 weiteren Autor:innen. Die Arbeit wurde bisher 12-mal zitiert (Crossref) und nennt 23 Literaturangaben.
Abstract (Originalsprache)
Bounded Regret for LP-Based Revenue-Management Problems In “An Improved Analysis of LP-Based Control for Revenue Management,” Chen, Li, and Ye study a class of quantity-based network revenue-management problems. The authors consider a stochastic setting where all the orders are i.i.d. sampled and the customers are of finite type. They focus on the classic LP-based adaptive algorithm and consider regret as the performance measure. They found that when the underlying LP is nondegenerate, the algorithm achieves a problem-dependent regret upper bound that is independent of the horizon/number of time periods T; when the underlying LP is degenerate, the algorithm achieves a tight regret upper bound that scales on the order of T log(T) and matches the lower bound up to a logarithmic order.
Zitieren
APA
Chen, G., Li, X., & Ye, Y. (2024). Technical Note—An Improved Analysis of LP-Based Control for Revenue Management. Operations Research, 72(3), 1124-1138. https://doi.org/10.1287/opre.2022.2358
Vancouver
Chen G, Li X, Ye Y. Technical Note—An Improved Analysis of LP-Based Control for Revenue Management. Operations Research. 2024;72(3):1124-1138. doi:10.1287/opre.2022.2358
BibTeX
@article{Chen2024,
author = {Chen, Guanting and Li, Xiaocheng and Ye, Yinyu},
title = {Technical Note—An Improved Analysis of LP-Based Control for Revenue Management},
journal = {Operations Research},
year = {2024},
volume = {72},
number = {3},
pages = {1124--1138},
doi = {10.1287/opre.2022.2358}
}
EUVIMED