Joint Assortment Optimization and Customization under a Mixture of Multinomial Logit Models: On the Value of Personalized Assortments

42 Pages Posted: 20 Apr 2021

See all articles by Omar El Housni

Omar El Housni

Cornell University - School of Operations Research and Information Engineering

Huseyin Topaloglu

Cornell University - School of Operations Research and Industrial Engineering

Date Written: April 19, 2021

Abstract


We consider a joint assortment optimization and customization problem under a mixture of multinomial logit models. In this problem, a firm faces customers of different types, each making a choice within an offered assortment according to the multinomial logit model with different parameters. The problem takes place in two stages. In the first stage, the firm picks an assortment of products to carry subject to a cardinality constraint. In the second stage, a customer of a certain type arrives into the system. Observing the type of the customer, the firm customizes the assortment that it carries by, possibly, dropping products from the assortment. The goal of the firm is to find an assortment to carry and a customized assortment for each customer type that can arrive in the second stage to maximize the expected revenue from a customer visit. The problem arises, for example, in online platforms, where retailers commit to a selection of products before the start of the selling season, but they could potentially customize the displayed assortments for each customer type. We refer to this problem as the Customized Assortment Problem (CAP). Letting m be the number of customer types, we show that the expected revenue of CAP can be $\Omega(m)$ times greater than the optimal expected revenue of the corresponding model without customization and this bound is tight. We establish that CAP is NP-hard to approximate within a factor better than (1-1/e), so we focus on providing an approximation framework for CAP. As our main technical contribution, we design a novel algorithm, which we refer to as Augmented Greedy, and building on it, we give a $\Omega(1/ \log m)$-approximation algorithm to CAP. Lastly, we present a fully polynomial-time approximation scheme for CAP when the number of customer types is constant. In our computational experiments, we demonstrate the value of customization by using a dataset from Expedia and check the practical performance of our approximation algorithm.

Keywords: Assortment Optimization, Mixture of Multinomial Logit Models, Customization, Approximation Algorithms

Suggested Citation

El Housni, Omar and Topaloglu, Huseyin, Joint Assortment Optimization and Customization under a Mixture of Multinomial Logit Models: On the Value of Personalized Assortments (April 19, 2021). Available at SSRN: https://ssrn.com/abstract=3830082 or http://dx.doi.org/10.2139/ssrn.3830082

Omar El Housni (Contact Author)

Cornell University - School of Operations Research and Information Engineering ( email )

2 E Loop Rd
New York, NY 10044
United States

HOME PAGE: http://https://people.orie.cornell.edu/oe46/

Huseyin Topaloglu

Cornell University - School of Operations Research and Industrial Engineering ( email )

Ithaca, NY
United States

Do you have a job opening that you would like to promote on SSRN?

Paper statistics

Downloads
62
Abstract Views
214
rank
419,629
PlumX Metrics