The Stability of MNL-Based Demand Under Dynamic Customer Substitution and Its Algorithmic Implications

Ali Aouad () and Danny Segev ()
Additional contact information
Ali Aouad: Management Science and Operations, London Business School, Regent’s Park, London NW14SA, United Kingdom
Danny Segev: Department of Statistics and Operations Research, Tel Aviv University, Tel Aviv 69978, Israel

Operations Research, 2023, vol. 71, issue 4, 1216-1249

Abstract: We study the dynamic assortment planning problem under the widely utilized multinomial logit choice model (MNL). In this single-period assortment optimization and inventory management problem, the retailer jointly decides on an assortment, that is, a subset of products to be offered, as well as on the inventory levels of these products, aiming to maximize the expected revenue subject to a capacity constraint on the total number of units stocked. The demand process is formed by a stochastic stream of arriving customers, who dynamically substitute between products according to the MNL model. Although this dynamic setting is extensively studied, the best known approximation algorithm guarantees an expected revenue of at least 0.139 times the optimum, assuming that the demand distribution has an increasing failure rate. In this paper, we establish novel stochastic inequalities showing that, for any given inventory levels, the expected demand of each offered product is “stable” under basic algorithmic operations, such as scaling the MNL preference weights and shifting inventory across comparable products. We exploit this sensitivity analysis to devise the first approximation scheme for dynamic assortment planning under the MNL model, allowing one to efficiently compute inventory levels that approach the optimal expected revenue within any degree of accuracy. The running time of this algorithm is polynomial in all instance parameters except for an exponential dependency on log Δ , where Δ = w max w min stands for the ratio of the extremal MNL preference weights. Finally, we conduct simulations on simple synthetic instances with uniform preference weights (i.e., Δ = 1 ) . Using our approximation scheme to derive tight upper bounds, we gain some insights into the performance of several heuristics proposed by previous literature.

Keywords: Revenue Management and Market Analytics; dynamic substitution; multinomial logit choice model; inventory management; probabilistic couplings (search for similar items in EconPapers)
Date: 2023
References: Add references at CitEc
Citations:

Downloads: (external link)
http://dx.doi.org/10.1287/opre.2022.2391 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:oropre:v:71:y:2023:i:4:p:1216-1249

Access Statistics for this article

More articles in Operations Research from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().