×

Competitive analysis of online revenue management with hierarchical resources. (English) Zbl 1471.91256

Summary: This paper studies an online revenue management problem of accepting and assigning two classes of customers to two levels of resources with capacity constraints. A customer’s request may be either accepted or rejected immediately upon its arrival without the information of further demand. One class of customers can be served either by a low-level resource at the resource’s regular price, or by a high-level resource at the customer’s reservation price. Another class of customers can be served by either level of resource at the regular price of the corresponding resource. Given the capacities of both levels of resources, the objective is to accept appropriate customers and assign them to appropriate resources so as to maximize the total revenue. From the perspective of competitive analysis, we derive an upper bound of competitive ratio for the problem and develop an optimal online strategy whose competitive ratio matches the upper bound.

MSC:

91B42 Consumer behavior, demand theory
68W27 Online algorithms; streaming algorithms
PDFBibTeX XMLCite
Full Text: DOI

References:

[1] Ball, M. O.; Queyranne, M., Toward robust revenue management: competitive analysis of online booking, Oper. Res., 57, 4, 950-963, (2009) · Zbl 1233.90184
[2] Besbes, O.; Zeevi, A., Dynamic pricing without knowing the demand function: risk bounds and near-optimal algorithms, Oper. Res., 57, 6, 1407-1420, (2009) · Zbl 1233.90011
[3] Borodin, A.; El-Yaniv, R., Online Computation and Competitive Analysis, (1998), Cambridge University Press: Cambridge University Press Cambridge · Zbl 0931.68015
[4] Boyd, E. A.; Bilegan, I. C., Revenue management and e-commerce, Manag. Sci., 49, 10, 1363-1386, (2003)
[5] Fisher, M.; Raman, A., Reducing the cost of demand uncertainty through accurate response to early sales, Oper. Res., 44, 1, 87-99, (1996) · Zbl 0847.90065
[6] Kurawarwala, A. A.; Matsuo, H., Forecasting and inventory management of short life-cycle products, Oper. Res., 44, 1, 131-150, (1996) · Zbl 0847.90043
[7] Lan, Y.; Ball, M. O.; Karaesmen, I., Regret in overbooking and fare-class allocation for single leg, Manuf. Serv. Oper. Manag., 13, 2, 194-208, (2011)
[8] Lan, Y.; Ball, M. O.; Karaesmen, I.; Zhang, J. X.; Liu, G. X., Analysis of seat allocation and overbooking decisions with hybrid information, Eur. J. Oper. Res., 240, 2, 493-504, (2015) · Zbl 1357.90068
[9] Lan, Y.; Gao, H.; Ball, M. O.; Karaesmen, I., Revenue management with limited demand information, Manag. Sci., 54, 9, 1594-1609, (2008) · Zbl 1232.91391
[10] McGill, J. I.; van Ryzin, G. J., Revenue management: research overview and prospects, Transp. Sci., 33, 2, 233-256, (1999) · Zbl 1002.90032
[11] Ni, G.; Luo, L.; Xu, Y.; Xu, J., Optimal online markdown and markup pricing policies with demand uncertainty, Inf. Process. Lett., 115, 11, 804-811, (2015) · Zbl 1414.91144
[12] Talluri, K.; van Ryzin, G. J., The Theory and Practice of Revenue Management, (2005), Springer
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.