Author
Listed:
- Jacob Feldman
(Olin Business School, Washington University, St. Louis, Missouri 63130)
- Danny Segev
(School of Mathematical Sciences and Coller School of Management, Tel Aviv University, Tel Aviv 69978, Israel)
Abstract
Problem definition : We study a multiperiod, multiproduct, dynamic pricing problem with price adjustment costs known as “menu costs.” In this setting, decision makers, such as retailers or online platforms, incur a fixed menu cost whenever prices are updated between periods as well as a variable menu cost that linearly scales with the number of between-period price changes. From a demand standpoint, the random number of customers arriving in each period is assumed to be arbitrarily distributed, whereas purchasing decisions are dictated by a time-dependent multinomial logit choice model. Methodology/results : Our first main contribution consists of establishing fundamental hardness results for the dynamic pricing problem of interest, unveiling inherent computational hurdles even when stripped down to its simplest form. On the positive side, we identify grocery retail as a particular application domain whose distinguishing features allow us to develop a fully polynomial time approximation scheme (FPTAS), through which optimal expected revenues are shown to be approachable within any degree of accuracy. In this context, our methodology synthesizes compact enumeration ideas, novel coupling arguments, and approximate dynamic programming techniques. Managerial implications : Finally, we present two extensive numerical experiments aimed at studying the impacts of menu costs, albeit from distinct vantage points. Both studies make use of a large and diverse test bed of problem instances that we painstakingly construct from a NielsenIQ scanner grocery data set. Given the novelty of incorporating menu costs within dynamic pricing environments, we use the first set of numerical experiments to present what constitutes one of the first close looks at how these price adjustment costs shape pricing patterns and influence optimal gross margins in a multiproduct setting. The second set of experiments is used to evaluate the efficacy of our FPTAS, ultimately showing its mean revenue performance to be within 1%–2% of optimal. In this way, not only do we break ground from a theoretical perspective when it comes to multiproduct dynamic pricing problems in the presence of menu costs, but we also extensively demonstrate the practical viability of our approach.
Suggested Citation
Jacob Feldman & Danny Segev, 2025.
"Dynamic Pricing with Menu Costs: Approximation Schemes and Applications to Grocery Retail,"
Manufacturing & Service Operations Management, INFORMS, vol. 27(4), pages 1087-1106, July.
Handle:
RePEc:inm:ormsom:v:27:y:2025:i:4:p:1087-1106
DOI: 10.1287/msom.2024.0832
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:ormsom:v:27:y:2025:i:4:p:1087-1106. 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.