PulseExploreJournal ClubDebatesTrendingResearchersJournals
Instagram
HomeExploreJournal ClubTrending
Synapse
⌘+K
Synapse
October 17, 2025Manufacturing & Service Operations Management1 citations

A Unified Framework to Impose Market Share Constraints for Selected Product Classes: Randomized and Deterministic Assortments Under the Multinomial Logit Model

View Full Paper
WZWenchang ZhuPRPaat RusmevichientongHTHüseyin Topaloğlu

Key Points

  • Maximizing expected revenue under market share constraints leads to operational efficiency for retailers.
  • The randomized variant of assortment optimization is NP-hard, while the deterministic variant has a pseudopolynomial runtime.
  • A polynomial-time approximation scheme can optimize revenue by addressing constraints effectively in both assortment variations.
  • Employing market share thresholds ensures that demand quantities for products are sufficient, minimizing operational burdens.

Abstract

Problem definition: We study assortment optimization problems with market share constraints. The products are partitioned into product classes, each with a market share threshold. If a product class is represented in the offered assortment, then the total purchase probability of the products offered in the class should be above the market share threshold of the product class. Customers choose among offered products according to the multinomial logit model. The goal is to maximize the expected revenue while satisfying the market share constraints. Our work is motivated by the fact that focusing only on maximizing the expected revenue often results in offering many products with small demand quantities, causing operational burden. Retailers are interested in ensuring that the products represented in their assortments command reasonably large demand quantities. Methodology/results: Imposing the market share constraints only for product classes represented in the offered assortment brings unique unexplored dynamics. In the randomized variant, we randomize the offered assortments. In the deterministic variant, we offer a single assortment. The randomized variant is NP-hard, whereas the deterministic variant is NP-hard to approximate within a factor of Formula: see text. Our main contributions are a fully polynomial-time approximation scheme for the randomized variant, an approximation scheme for the deterministic variant that yields a Formula: see text-approximate solution while violating market share constraints with a Formula: see text-factor in running time that is polynomial in Formula: see text, and a Formula: see text-approximation algorithm for the deterministic variant that yields a solution satisfying market share constraints exactly in running time that is pseudopolynomial in the input size. We develop a unified approximation framework that applies to both variants and leverage this approximation framework. Managerial implications: We are motivated by a practical need for assortments where the offered products command reasonably large demand quantities. Imposing market share constraints for the selected product classes is a natural way to satisfy this need. Supplemental Material: The online appendix is available at https://doi.org/10.1287/msom.2024.1396 .

Ask AI
Helpful
Bookmark
Share
View Full Paper

Cite This Study

Zhu et al. (2025) studied this question.

synapsesocial.com/papers/68f199d1de32064e504dd645https://doi.org/10.1287/msom.2024.1396
Ask AI
Helpful
Bookmark
Share
View Full Paper