Dynamic Pricing through Data Sampling

被引:31
作者
Cohen, Maxime C. [1 ]
Lobel, Ruben [2 ]
Perakis, Georgia [3 ]
机构
[1] NYU, Stern Sch Business, 550 1St Ave, New York, NY 10012 USA
[2] Airbnb, San Francisco, CA 94103 USA
[3] MIT, Sloan Sch Management, 77 Massachusetts Ave, Cambridge, MA 02139 USA
关键词
dynamic pricing; data-driven; sampling-based optimization; MULTISTAGE ROBUST OPTIMIZATION; AVERAGE APPROXIMATION METHOD; UNCERTAIN CONVEX-PROGRAMS; RANDOMIZED SOLUTIONS; REVENUE MANAGEMENT;
D O I
10.1111/poms.12854
中图分类号
T [工业技术];
学科分类号
08 ;
摘要
We study a dynamic pricing problem, where a firm offers a product to be sold over a fixed time horizon. The firm has a given initial inventory level, but there is uncertainty about the demand for the product in each time period. The objective of the firm is to determine a dynamic pricing strategy that maximizes revenue throughout the entire selling season. We develop a tractable optimization model that directly uses demand data, therefore creating a practical decision tool. We show computationally that regret-based objectives can perform well when compared to average revenue maximization and to a Bayesian approach. The modeling approach proposed in this study could be particularly useful for risk-averse managers with limited access to historical data or information about the true demand distribution. Finally, we provide theoretical performance guarantees for this sampling-based solution.
引用
收藏
页码:1074 / 1088
页数:15
相关论文
共 33 条
[11]   A Hierarchy of Near-Optimal Policies for Multistage Adaptive Optimization [J].
Bertsimas, Dimitris ;
Iancu, Dan Andrei ;
Parrilo, Pablo A. .
IEEE TRANSACTIONS ON AUTOMATIC CONTROL, 2011, 56 (12) :2803-2818
[12]   Optimality of Affine Policies in Multistage Robust Optimization [J].
Bertsimas, Dimitris ;
Iancu, Dan A. ;
Parrilo, Pablo A. .
MATHEMATICS OF OPERATIONS RESEARCH, 2010, 35 (02) :363-394
[13]   Uncertain convex programs: randomized solutions and confidence levels [J].
Calafiore, G ;
Campi, MC .
MATHEMATICAL PROGRAMMING, 2005, 102 (01) :25-46
[14]   On the Expected Probability of Constraint Violation in Sampled Convex Programs [J].
Calafiore, G. C. .
JOURNAL OF OPTIMIZATION THEORY AND APPLICATIONS, 2009, 143 (02) :405-412
[15]   The scenario approach to robust control design [J].
Calafiore, Giuseppe C. ;
Campi, Marco C. .
IEEE TRANSACTIONS ON AUTOMATIC CONTROL, 2006, 51 (05) :742-753
[16]   THE EXACT FEASIBILITY OF RANDOMIZED SOLUTIONS OF UNCERTAIN CONVEX PROGRAMS [J].
Campi, M. C. ;
Garatti, S. .
SIAM JOURNAL ON OPTIMIZATION, 2008, 19 (03) :1211-1230
[17]  
Caramanis C, 2006, THESIS
[18]   Dynamic pricing in the presence of inventory considerations: Research overview, current practices, and future directions [J].
Elmaghraby, W ;
Keskinocak, P .
MANAGEMENT SCIENCE, 2003, 49 (10) :1287-1309
[19]   Monopoly pricing with limited demand information [J].
Eren S.S. ;
Maglaras C. .
Journal of Revenue and Pricing Management, 2010, 9 (1-2) :23-48
[20]   Dynamic Pricing with a Prior on Market Response [J].
Farias, Vivek F. ;
Van Roy, Benjamin .
OPERATIONS RESEARCH, 2010, 58 (01) :16-29