Bayesian Dynamic Pricing with Unknown Customer Willingness-to-Pay and Limited Inventory

作者: Li Chen , Chengyu Wu

DOI: 10.2139/SSRN.2689924

关键词: Dynamic pricingBenchmark (computing)HeuristicsWillingness to payMathematical optimizationStylized factBayesian probabilityMicroeconomicsHeuristicRevenue managementEconomics

摘要: We consider a stylized dynamic pricing problem with an unknown distribution of customer willingness-to-pay (WTP) and limited inventory. The seller learns customers' WTP from their binary purchase decisions, where the posted price serves as either left- or right-censoring point customer's WTP. is formulated finite-horizon Bayesian program. find that better information always improves revenue performance, but learning may bring negative value when inventory level becomes low. A derivative approximation heuristic devised for numerically solving problem. further develop performance bound to compare our proposed other benchmark heuristics. Numerical experiments demonstrate consistently outperforms others.

参考文章(49)
Kalyan T Talluri, Garrett Van Ryzin, Garrett Van Ryzin, The Theory and Practice of Revenue Management ,(2004)
Suresh Sethi, M. Çakanyıldırım, Alain Bensoussan, A Note on 'The Censored Newsvendor and the Optimal Acquisition of Information' Social Science Research Network. ,(2008)
Edward Lazear, Retail Pricing and Clearance Sales Social Science Research Network. ,(1984) , 10.3386/W1446
M. Çakanyıldırım, J. Adolfo Minjarez-Sosa, Alain Bensoussan, Alain Bensoussan, Alain Bensoussan, Suresh Sethi, Andrew Royal, Inventory Problems with Partially Observed Demands and Lost Sales Social Science Research Network. ,(2008)
Alain Bensoussan, Metin Cakanyildirim, Suresh Sethi, On the Optimal Control of Partially Observed Inventory Systems Social Science Research Network. ,(2008) , 10.2139/SSRN.1087603
Omar Besbes, Assaf Zeevi, On the Minimax Complexity of Pricing in a Changing Environment Social Science Research Network. ,(2011)
Omar Besbes, Assaf Zeevi, Dynamic Pricing Without Knowing the Demand Function: Risk Bounds and Near-Optimal Algorithms Social Science Research Network. ,(2009)
Zhe Wang, Adam J. Mersereau, Li Chen, Optimal Merchandise Testing with Limited Inventory Social Science Research Network. ,(2016) , 10.2139/SSRN.2689935
Paul R. Milgrom, Ilya R. Segal, Envelope Theorems for Arbitrary Choice Sets Social Science Research Network. ,(2002)