Dynamic Pricing Through Data Sampling

  title={Dynamic Pricing Through Data Sampling},
  author={Maxime C. Cohen and Ruben Lobel and Georgia Perakis},
  journal={The Wharton School},
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 over the entire selling season. We develop a tractable optimization model that directly uses demand data, therefore creating a practical decision tool. We show numerically that… Expand
Dynamic Pricing Over Finite Horizons
In this chapter, this work focuses on models that explicitly consider the stochastic and dynamic nature of demand and uses dynamic programming formulations to compute an optimal policy as a function of the remaining inventory and the time-to-go. Expand
Dynamic Pricing to Minimize Maximum Regret
We consider a dynamic pricing problem that involves selling a given inventory of a single product over a short, two-period selling season. There is insufficient time to replenish inventory duringExpand
Recent Developments in Dynamic Pricing Research: Multiple Products, Competition, and Limited Demand Information
Dynamic pricing enables a firm to increase revenue by better matching supply with demand, responding to shifting demand patterns, and achieving customer segmentation. In the last 20 years, numerousExpand
A relative robust approach on expected returns with bounded CVaR for portfolio selection
A model is formulated that minimizes the maximum regret on the expected returns while the conditional value-at-risk is upper bounded under different scenario settings and it will be seen that using scenarios usually improves the realized portfolio returns. Expand
Robust Pricing and Production with Information Partitioning and Adaptation
We introduce a new distributionally robust optimization model to address a two-period, multi-item joint pricing and production problem, which can be implemented in a data-driven setting usingExpand
Robust Capacity Control in Revenue Management: A Literature Review
Theoretical basis of revenue management is introduced and detailed review of literature on robust revenue management are provided, and potential directions of future research are identified. Expand
Promotion Optimization for Multiple Items in Supermarkets
Promotions are a critical decision for supermarket managers who must decide the price promotions for a large number of items. Retailers often use promotions to boost the sales of the different itemsExpand
Dynamic Pricing and Learning: Historical Origins, Current Research, and New Directions
A brief introduction to the historical origins of quantitative research on pricing and demand estimation is provided, point to different subfields in the area of dynamic pricing, and an in-depth overview of the available literature on dynamic pricing and learning is provided. Expand
Dynamic Pricing and Learning: Historical Origins, Current Research, and New Directions
The topic of dynamic pricing and learning has received a considerable amount of attention in recent years, from different scientific communities. We survey these literature streams: we provide aExpand
Promotion Optimization in Retail
This chapter presents some recent developments in retail promotions and presents an efficient approximate solution approach by using a discrete linearization method that allows the retailer to solve large-scale instances within seconds. Expand


Dynamic Pricing with a Prior on Market Response
Computer results demonstrate that decay balancing offers significant revenue gains over recently studied certainty equivalent and greedy heuristics, and establish that changes in inventory and uncertainty in the arrival rate bear appropriate directional impacts on decay balancing prices in contrast to these alternatives. Expand
Multi-product pricing via robust optimisation
We propose an approach to model demand uncertainty in pricing problems with capacitated resources that builds upon: (i) range forecasts for various product lines and (ii) bounds on the amount of theExpand
Pricing of Short Life-Cycle Products through Active Learning∗
Revenue management techniques, practiced for many years in the airline and hotel industries, have gained popularity with retailers. One such technique — dynamic pricing — refers to the intelligentExpand
Competitive Multi-period Pricing for Perishable Products: A Robust Optimization Approach
This paper is believed to be the first paper that uses robust optimization for dynamic pricing under competition in a multi-period oligopolistic market for a single perishable product with fixed inventory using ideas from robust optimization and variational inequalities. Expand
Dynamic pricing with real-time demand learning
  • K. Lin
  • Economics, Computer Science
  • Eur. J. Oper. Res.
  • 2006
This paper considers a situation where the firm does not have an accurate demand forecast, but can only roughly estimate the customer arrival rate before the sale begins, and shows how this modified arrival rate estimation can be used to dynamically adjust the product price in order to maximize the expected total revenue. Expand
Dynamic Pricing for Nonperishable Products with Demand Learning
The retailer's problem is formulated as a (Poisson) intensity control problem and the structural properties of an optimal solution are derived, and a simple and efficient approximated solution is suggested. Expand
Toward Robust Revenue Management: Competitive Analysis of Online Booking
This paper addresses the two-fare problem in greatest detail, but also treats the general multifare problem and the bid-price control problem. Expand
Monopoly pricing with limited demand information
Traditional monopoly pricing models assume that firms have full information about the market demand and consumer preferences. In this article, we study a prototypical monopoly pricing problem for aExpand
Robust Controls for Network Revenue Management
This paper develops robust formulations for the capacity allocation problem in revenue management using the maximin and the minimax regret criteria under general polyhedral uncertainty sets and reveals that the minimx regret controls perform very well on average, despite their worst-case focus, and outperform the traditional controls when demand is correlated or censored. Expand
Relative Entropy, Exponential Utility, and Robust Dynamic Pricing
This paper presents an approach to single-product dynamic revenue management that accounts for errors in the underlying model at the optimization stage and obtains an optimal pricing policy through a version of the so-called Isaacs' equation for stochastic differential games. Expand