Author
Listed:
- Yiwei Chen
(Fox School of Business, Temple University, Philadelphia, Pennsylvania 19122)
- Stefanus Jasin
(Ross School of Business, University of Michigan, Ann Arbor, Michigan 48109)
Abstract
We consider a canonical revenue management problem wherein a monopolist seller seeks to maximize expected total revenues from selling a fixed inventory of a product to customers who arrive sequentially over time, and the seller is restricted to implement a pricing policy that is monotonic (either nonincreasing or nondecreasing) over time. Gallego and Van Ryzin [Gallego G, Van Ryzin G (1994) Optimal dynamic pricing of inventories with stochastic demand over finite horizons. Management Sci . 40(8):999–1020] show that the simplest monotonic price policy, the fixed price policy, is asymptotically optimal in the high-volume regime in which both the seller’s initial inventory and the length of the selling horizon are proportionally scaled. Specifically, the revenue loss of the fixed price policy is O ( k 1 / 2 ) , where k is the system’s scaling parameter. Following the publication of Gallego and Van Ryzin [Gallego G, Van Ryzin G (1994) Optimal dynamic pricing of inventories with stochastic demand over finite horizons. Management Sci . 40(8):999–1020], several papers have attempted to improve the performance of the fixed price policy. Among them, Jasin [Jasin S (2014) Reoptimization and self-adjusting price control for network revenue management. Oper. Res . 62(5):1168–1178] develops a simple modification of the fixed price policy (that allows prices to move either up or down) with a guaranteed revenue loss of order O ( ln k ) . In this paper, we propose a novel family of monotonic readjustment policy, which restricts the prices to only move in one direction (i.e., either up or down). We show that, if the seller updates the price for only a single time, then the revenue loss of our policy is O ( k 1 / 3 ( ln k ) 2 α ) for some α > 1 / 2 . If, however, the seller updates the prices with a frequency O ( ln k / ln ln k ) , then the revenue loss of our policy is O ( ( ln k ) 7 α ) for some α > 1 / 2 . These results show the power of dynamic pricing even in the presence of monotonic price restriction. We discuss two applications of our policy: markdown pricing and pricing in the presence of strategic customers. Supplemental Material: The online appendix is available at https://doi.org/10.1287/opre.2020.0774 .
Suggested Citation
Yiwei Chen & Stefanus Jasin, 2024.
"Simple Monotonic Readjustment Policies with Applications to Markdown Pricing and Pricing in the Presence of Strategic Customers,"
Operations Research, INFORMS, vol. 72(5), pages 1893-1905, September.
Handle:
RePEc:inm:oropre:v:72:y:2024:i:5:p:1893-1905
DOI: 10.1287/opre.2020.0774
Download full text from publisher
Corrections
All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:inm:oropre:v:72:y:2024:i:5:p:1893-1905. See general information about how to correct material in RePEc.
If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.
We have no bibliographic references for this item. You can help adding them by using this form .
If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.html .
Please note that corrections may take a couple of weeks to filter through
the various RePEc services.