Dynamic Pricing through Sampling Based Optimization

• Main Authors: Lobel, Ruben (Contributor), Perakis, Georgia (Contributor)
• Other Authors: Massachusetts Institute of Technology. Operations Research Center (Contributor), Sloan School of Management (Contributor)
• Format: Article
• Language: English
• Published: Airline Group of the International Federation of Operational Research Societies, 2014-06-30T16:18:47Z.
• Subjects: Article
• Online Access: Get fulltext

 In this paper we develop an approach to dynamic pricing that combines ideas from data-driven and robust optimization to address the uncertain and dynamic aspects of the problem. In our setting, a firm off ers multiple products to be sold over a fixed discrete time horizon. Each product sold consumes one or more resources, possibly sharing the same resources among di fferent products. The firm is given a fixed initial inventory of these resources and cannot replenish this inventory during the selling season. We assume there is uncertainty about the demand seen by the fi rm for each product and seek to determine a robust and dynamic pricing strategy that maximizes revenue over the time horizon. While the traditional robust optimization models are tractable, they give rise to static policies and are often too conservative. The main contribution of this paper is the exploration of closed-loop pricing policies for di fferent robust objectives, such as MaxMin, MinMax Regret and MaxMin Ratio. We introduce a sampling based optimization approach that can solve this problem in a tractable way, with a con fidence level and a robustness level based on the number of samples used. We will show how this methodology can be used for data-driven pricing or adapted for a random sampling optimization approach when limited information is known about the demand uncertainty. Finally, we compare the revenue performance of the di fferent models using numerical simulations, exploring the behavior of each model under diff erent sample sizes and sampling distributions.