TY - JOUR
T1 - The Click-Based MNL Model
T2 - A Framework for Modeling Click Data in Assortment Optimization
AU - Aouad, Ali
AU - Feldman, Jacob
AU - Segev, Danny
AU - Zhang, Dennis J.
N1 - Publisher Copyright:
© 2024 INFORMS.
PY - 2025/8
Y1 - 2025/8
N2 - We introduce the click-based MNL choice model, a framework for capturing customer purchasing decisions in e-commerce settings. Specifically, we augment the classical Multinomial Logit choice model by assuming that customers only consider the items they have clicked on before they proceed to compare their random utilities. In this context, we study the resulting assortment optimization problem, where the objective is to select a subset of products, made available for purchase, to maximize the expected revenue. Our main algorithmic contribution comes in the form of a polynomial-time approximation scheme (PTAS) for this problem, showing that the optimal expected revenue can be efficiently approached within any degree of accuracy. To establish this result, we develop several technical ideas, including enumeration schemes and stochastic inequalities, which may be of broader interest. Using data from Alibaba’s online marketplace, we fit click-based MNL and latent class MNL models to historical sales and click data in a setting where the online platform recommends a personalized six-product display to each user. We propose an estimation methodology for the click-based MNL model that leverages clickstream data and machine learning classification algorithms. Our numerical results suggest that clickstream data are valuable for predicting choices and that the click-based MNL model can outperform standard logit-based models in certain settings.
AB - We introduce the click-based MNL choice model, a framework for capturing customer purchasing decisions in e-commerce settings. Specifically, we augment the classical Multinomial Logit choice model by assuming that customers only consider the items they have clicked on before they proceed to compare their random utilities. In this context, we study the resulting assortment optimization problem, where the objective is to select a subset of products, made available for purchase, to maximize the expected revenue. Our main algorithmic contribution comes in the form of a polynomial-time approximation scheme (PTAS) for this problem, showing that the optimal expected revenue can be efficiently approached within any degree of accuracy. To establish this result, we develop several technical ideas, including enumeration schemes and stochastic inequalities, which may be of broader interest. Using data from Alibaba’s online marketplace, we fit click-based MNL and latent class MNL models to historical sales and click data in a setting where the online platform recommends a personalized six-product display to each user. We propose an estimation methodology for the click-based MNL model that leverages clickstream data and machine learning classification algorithms. Our numerical results suggest that clickstream data are valuable for predicting choices and that the click-based MNL model can outperform standard logit-based models in certain settings.
KW - Multinomial Logit model
KW - approximation algorithms
KW - clickstream data
KW - consideration sets
UR - https://www.scopus.com/pages/publications/105013268190
U2 - 10.1287/mnsc.2021.00281
DO - 10.1287/mnsc.2021.00281
M3 - Article
AN - SCOPUS:105013268190
SN - 0025-1909
VL - 71
SP - 6943
EP - 6960
JO - Management Science
JF - Management Science
IS - 8
ER -