Author
Listed:
- Ali Aouad
(Sloan School of Management, Massachusetts Institute of Technology, Cambridge, Massachusetts 02142)
- Jacob Feldman
(Olin Business School, Washington University, St. Louis, Missouri 63130)
- Danny Segev
(School of Mathematical Sciences and Coller School of Management, Tel Aviv University, Tel Aviv 69978, Israel)
- Dennis J. Zhang
(Olin Business School, Washington University, St. Louis, Missouri 63130)
Abstract
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.
Suggested Citation
Ali Aouad & Jacob Feldman & Danny Segev & Dennis J. Zhang, 2025.
"The Click-Based MNL Model: A Framework for Modeling Click Data in Assortment Optimization,"
Management Science, INFORMS, vol. 71(8), pages 6943-6960, August.
Handle:
RePEc:inm:ormnsc:v:71:y:2025:i:8:p:6943-6960
DOI: 10.1287/mnsc.2021.00281
Download full text from publisher
Corrections
All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:inm:ormnsc:v:71:y:2025:i:8:p:6943-6960. See general information about how to correct material in RePEc.
If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.
We have no bibliographic references for this item. You can help adding them by using this form .
If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.html .
Please note that corrections may take a couple of weeks to filter through
the various RePEc services.