The DOI matches its Crossref record; 24 of the 24 references it cites were found in a registry or an index.
Assortment Optimization under the Multinomial Logit Model with Random Choice Parameters
Abstract
We consider assortment optimization problems under the multinomial logit model, where the parameters of the choice model are random. The randomness in the choice model parameters is motivated by the fact that there are multiple customer segments, each with different preferences for the products, and the segment of each customer is unknown to the firm when the customer makes a purchase. This choice model is also called the mixture‐of‐logits model. The goal of the firm is to choose an assortment of products to offer that maximizes the expected revenue per customer, across all customer segments. We establish that the problem is NP complete even when there are just two customer segments. Motivated by this complexity result, we focus on assortments consisting of products with the highest revenues, which we refer to as revenue‐ordered assortments. We identify specially structured cases of the problem where revenue‐ordered assortments are optimal. When the randomness in the choice model parameters does not follow a special structure, we derive tight approximation guarantees for revenue‐ordered assortments. We extend our model to the multi‐period capacity allocation problem, and prove that, when restricted to the revenue‐ordered assortments, the mixture‐of‐logits model possesses the nesting‐by‐fare‐order property. This result implies that revenue‐ordered assortments can be incorporated into existing revenue management systems through nested protection levels. Numerical experiments show that revenue‐ordered assortments perform remarkably well, generally yielding profits that are within a fraction of a percent of the optimal.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
(1979) · Cited by 43,841
Discrete Choice Methods with Simulation
Train, K. E. (2001) · doi:10.1017/cbo9780511805271 · Cited by 7,784
Discrete Choice Analysis: Theory and Application to Travel Demand.
Uncles, M. D., Ben-Akiva, M., & Lerman, S. R. (1987) · The Journal of the Operational Research Society · doi:10.2307/2582065 · Cited by 5,527
Mixed MNL models for discrete response
McFadden, D., & Train, K. (2000) · Journal of Applied Econometrics · doi:10.1002/1099-1255(200009/10)15:5<447::aid-jae570>3.0.co;2-1 · Cited by 4,322
Discrete Choice Methods with Simulation
Train, K. E. (2003) · Cambridge University Press eBooks · doi:10.1017/cbo9780511753930 · Cited by 3,890
Discrete choice analysis: Theory and application to travel demand
Prashker, J. N. (1988) · Transportation Research Part A: General · doi:10.1016/0191-2607(88)90064-7 · Cited by 3,257
The Theory and Practice of Revenue Management
Talluri, K. T., & Van Ryzin, G. J. (2004) · International Series in Operations Research & Management Science · doi:10.1007/b139000 · Cited by 2,243
Revenue Management Under a General Discrete Choice Model of Consumer Behavior
Talluri, K., & van Ryzin, G. (2004) · Management Science · doi:10.1287/mnsc.1030.0147 · Cited by 1,108
Dynamic Assortment Optimization with a Multinomial Logit Choice Model and Capacity Constraint
Rusmevichientong, P., Shen, Z. M., & Shmoys, D. B. (2010) · Operations Research · doi:10.1287/opre.1100.0866 · Cited by 474
Self-citationAssortment Planning: Review of Literature and Industry Practice
Kök, A. G., Fisher, M. L., & Vaidyanathan, R. (2008) · International Series in Operations Research & Management Science · doi:10.1007/978-0-387-78902-6_6 · Cited by 413
On the Choice-Based Linear Programming Model for Network Revenue Management
Liu, Q., & van Ryzin, G. (2008) · Manufacturing & Service Operations Management · doi:10.1287/msom.1070.0169 · Cited by 366
A Column Generation Algorithm for Choice-Based Network Revenue Management
Bront, J. J. M., Méndez-Díaz, I., & Vulcano, G. (2009) · Operations Research · doi:10.1287/opre.1080.0567 · Cited by 310
A Nonparametric Approach to Modeling Choice with Limited Data
Farias, V. F., Jagabathula, S., & Shah, D. (2013) · Management Science · doi:10.1287/mnsc.1120.1610 · Cited by 304
Assortment Optimization Under Variants of the Nested Logit Model
Davis, J. M., Gallego, G., & Topaloglu, H. (2014) · Operations Research · doi:10.1287/opre.2014.1256 · Cited by 295
Self-citationConstrained Assortment Optimization for the Nested Logit Model
Gallego, G., & Topaloglu, H. (2014) · Management Science · doi:10.1287/mnsc.2014.1931 · Cited by 228
Self-citationAn Approximate Dynamic Programming Approach to Network Revenue Management with Customer Choice
Zhang, D., & Adelman, D. (2009) · Transportation Science · doi:10.1287/trsc.1090.0262 · Cited by 226
Managing Flexible Products on a Network
Gallego, G., Iyengar, G., Phillips, R., & Dubey, A. (2004) · SSRN Electronic Journal · doi:10.2139/ssrn.3567371 · Cited by 200
A branch-and-cut algorithm for the latent-class logit assortment problem
Méndez‐Díaz, I., Miranda‐Bront, J. J., Vulcano, G. J., & Zabala, P. (2012) · Discrete Applied Mathematics · doi:10.1016/j.dam.2012.03.003 · Cited by 122
Network revenue management with inventory-sensitive bid prices and customer choice
Meissner, J., & Strauss, A. (2011) · European Journal of Operational Research · doi:10.1016/j.ejor.2011.06.033 · Cited by 120
Goyal, V., Levi, R., & Segev, D. (2016) · Operations Research · doi:10.1287/opre.2015.1450 · Cited by 107
Kunnumkal, S., & Topaloğlu, H. (2008) · Naval Research Logistics (NRL) · doi:10.1002/nav.20296 · Cited by 62
An Enhanced Concave Program Relaxation for Choice Network Revenue Management
Meissner, J., Strauss, A., & Talluri, K. T. (2012) · Production and Operations Management · doi:10.1111/j.1937-5956.2012.01345.x · Cited by 52
A Randomized Concave Programming Method for Choice Network Revenue ManagementPreprint
Talluri, K. T. (2010) · RePEc: Research Papers in Economics · Cited by 28
Farias, V. F., Jagabathula, S., & Shah, D. (2012) · Conference on Information Sciences and Systems · doi:10.1109/ciss.2012.6310952 · Cited by 12
Cited by
Assortment Optimization Under Variants of the Nested Logit Model
Davis, J. M., Gallego, G., & Topaloglu, H. (2014) · Operations Research · doi:10.1287/opre.2014.1256 · Cited by 295
Self-citation
Metadata
- Authors
- Rusmevichientong, P., Shmoys, D., Tong, C., & Topaloglu, H.
- Venue
- Production and Operations Management
- Publisher
- SAGE Publications
- Published
- 2014-11
- Volume
- 23
- Issue
- 11
- Pages
- 2023-2039
- ISSN
- 1059-1478 (ISSN-L)
- 1937-5956
- OpenAlex
- W2148648976
- Cited by
- 279
- References
- 24
- FWCI
- 36.43
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.