mlsanityData to 7 Oct 2026

Combinatorial Inference on the Optimal Assortment in Multinomial Logit Models

arXiv 2301.12254 ↗First posted 28 Jan 2023stat.ML cs.LGcited by 1

Not on the map. Why?

Abstract (arXiv)

Assortment optimization has received active explorations in the past few decades due to its practical importance. Despite the extensive literature dealing with optimization algorithms and latent score estimation, uncertainty quantification for the optimal assortment still needs to be explored and is of great practical significance. Instead of estimating and recovering the complete optimal offer set, decision-makers may only be interested in testing whether a given property holds true for the optimal assortment, such as whether they should include several products of interest in the optimal set, or how many categories of products the optimal set should include. This paper proposes a novel inferential framework for testing such properties. We consider the widely adopted multinomial logit (MNL) model, where we assume that each customer will purchase an item within the offered products with a probability proportional to the underlying preference score associated with the product. We reduce inferring a general optimal assortment property to quantifying the uncertainty associated with the sign change point detection of the marginal revenue gaps. We show the asymptotic normality of the marginal revenue gap estimator, and construct a maximum statistic via the gap estimators to detect the sign change point. By approximating the distribution of the maximum statistic with multiplier bootstrap techniques, we propose a valid testing procedure. We also conduct numerical experiments to assess the performance of our method.

Key facts. Cited by 1 paper in the map (data through 7 Oct 2026). Builds on 10 of its 63 references that are in the map. First posted on arXiv 28 Jan 2023.

Builds on

10 of 63 references.

References · 10

  1. 2014Convex Optimization: Algorithms and Complexitycited by 569
  2. 2015An Introduction to Matrix Concentration Inequalitiescited by 391
  3. 2020An Evaluation of Change Point Detection Algorithmscited by 62
  4. 2017MNL-Bandit: A Dynamic Learning Approach to Assortment Selectioncited by 50
  5. 2017Spectral Method and Regularized MLE Are Both Optimal for Top-K Rankingcited by 46
  6. 2017Thompson Sampling for the MNL-Banditcited by 35
  7. 2018Dynamic Assortment Optimization with Changing Contextual Informationcited by 28
  8. 2021Uncertainty quantification in the Bradley-Terry-Luce modelcited by 28
  9. 2021Lagrangian Inference for Ranking Problemscited by 19
  10. 2019Robust Dynamic Assortment Optimization in the Presence of Outlier Customerscited by 8

Built on by

Cited by year

Citing papers per year: 2023: 1.

1 paper.