State dependent pricing policies: Differentiating customers through valuations and waiting costs

被引:3
作者
Giloni A. [1 ]
Koçaǧa Y.L. [1 ]
Troy P. [2 ]
机构
[1] Sy Syms School of Business, Yeshiva University, New York, NY, 10033
[2] Les Entreprises TROYWARE, QC
关键词
delay sensitive customers; dynamic pricing; Markov decision process; queueing; revenue management; state dependent pricing;
D O I
10.1057/rpm.2012.17
中图分类号
学科分类号
摘要
In this article, we study the dynamic pricing problem of a multi-server facility that processes requests from several customer classes on a first come first served basis. We assume an arrival belongs to one of a finite number of customer classes and that each class is distinguished by known and arbitrary service valuations and arbitrary but non-decreasing waiting cost functions. We model the facility as an M/M/S/I queue and use the theory of Markov Decision Processes to identify dynamic pricing strategies that maximize the revenues obtained from customers who are assumed to be acting individually to maximize their utility. The key to our approach is recognizing, that a single generic model can be used to understand and optimize social benefit and revenue. Through analyzing that model we can determine that the maximum revenue obtainable from a service facility is bounded by the maximum collective benefits less waiting costs that customers could receive in such a facility, which is achieved through state dependent social (welfare) optimization. For our model, we show that this upper limit can be achieved with state dependent revenue maximization when it is possible to exactly charge customers the benefit they receive less the waiting costs they incur. This in turn can be accomplished when it is possible to identify the group of customers to which each customer belongs, where customers in each group have the same benefit and waiting cost function. We also conduct a detailed numerical study to examine the value of full and partial differentiation via super-groups by comparing the resulting revenue to the revenue of a state dependent pricing policy that offers a single price to all customer groups. We demonstrate the effect of several input parameters on the revenue associated with each level of differentiation and in particular asses the value of differentiation by studying the interplay between the gross benefits and waiting costs. We find that, when customer groups with higher gross benefits have higher or lower waiting costs, partial differentiation through super-groups results in significant revenue increases over no differentiation. We also find that when customer groups with different gross benefits have similar waiting costs, forming super-groups through gross benefits is much more beneficial than forming super-groups by waiting costs. Finally, we illustrate that the revenue maximizing pricing policy might actually increase arrival rates as system occupancy increases, by admitting customer classes that were not admitted in previous states. © 2013 Macmillan Publishers Ltd.
引用
收藏
页码:139 / 161
页数:22
相关论文
共 24 条
[1]  
Afeche P., Mendelson H., Pricing and priority auctions in queueing systems with a generalized delay cost structure, Management Science, 50, 7, pp. 869-882, (2004)
[2]  
Ata B., Shneorson S., Dynamic control of an M/M/1 service system with adjustable arrival and service rates, Management Science, 52, 11, pp. 1778-1791, (2005)
[3]  
Bitran G., Caldentey R., An overview of pricing models for revenue management, Manufacturing & Service Operations Management, 11, 3, pp. 203-229, (2003)
[4]  
Chen H., Frank M.Z., State dependent pricing with a queue, IIE Transactions, 33, 10, pp. 847-860, (2001)
[5]  
Dewan S., Mendelson H., User delay costs and internal pricing for a service facility, Management Science, 36, 12, pp. 1502-1517, (1990)
[6]  
Elmaghraby W., Keskinocak P., Dynamic pricing: Research overview, current practices and future directions, Management Science, 49, 10, pp. 1287-1309, (2003)
[7]  
Federgruen A., Tijms H.C., The optimality equation in average cost denumerable state semi-Markov decision problems, recurrency conditions and algorithms, Journal of Applied Probability, 15, pp. 356-373, (1978)
[8]  
Feinberg E.A., Reiman M.I., Optimality of randomized trunk reservation, Probability in the Engineering and Informational Sciences, 8, 4, pp. 463-489, (1994)
[9]  
Feinberg E.A., Yang F., Optimality of trunk reservation for an M/M/k/N queue with several customer types and holding costs, Probability in the Engineering and Informational Sciences, (2011)
[10]  
Howard R., Dynamic Programming and Markov Processes, (1960)