Assortment Optimization with α-Similar Substitutes: Insights from Customer Browsing Patterns

We propose an approach to model assortment optimization problems based on two observations we made from customer browsing history on Taobao. First, most customers consider very few items (no more than five) before purchasing. Second, there exists a sorting of items so that most customer consideration sets are contained in small intervals in this sorting. This sorting can be discovered by the Cuthill-McKee algorithm, which is designed to work with sparse matrices. We encode these two observations into the [Formula: see text]-similar substitutes property, which requires that all customers have consideration sets that lie in intervals (in the sorting) of length at most [Formula: see text], where [Formula: see text] is a parameter we select and is fitted from data. The assortment optimization and pricing problems associated with this property are fixed-parameter tractable for a fixed [Formula: see text]. Moreover, we show that the assortment optimization for some specific choice model with [Formula: see text]-similar substitutes property is polynomial-time solvable. We demonstrate our approach—going from data to modeling (i.e., selecting an appropriate [Formula: see text]) and finally to optimization—on another data set of customer click history on JD.com. Lastly, we conduct sensitivity tests on choice models that satisfy the [Formula: see text]-similar substitutes property in the presence of customers with large consideration sets. We provide an approximation guarantee in terms of revenue when asserting the [Formula: see text]-similar substitutes property. Both theoretical and numerical results show that the optimal assortment of our estimated model captures most of the revenue even when there are customers with large consideration sets. This paper was accepted by Vivek Farias, data science. Funding: B. Jiang’s research is supported by the National Natural Science Foundation of China [Grants 72394364, 72394363, 72394360, 72171141, and 72442013]. C. T. Ryan is supported by the NSERC [Grant RGPIN-2020-06488] and the SSHRC [Grant AWD-029333]. N. Zhang is supported by Ivey Business School. Supplemental Material: The online appendices and data files are available at https://doi.org/10.1287/mnsc.2023.00786 .

Authors

Institutions

Publication Details

Journal
Management Science
Published
2025-11-24
DOI
https://doi.org/10.1287/mnsc.2023.00786
Citations
1
Primary Topic
Supply Chain and Inventory Management
Type
article
Field-Weighted Citation Impact
2.28
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Assortment Optimization with α-Similar Substitutes: Insights from Customer Browsing Patterns

Bo Jiang, Nanxi Zhang, Renjie Chen, Christopher Ryan
1 citations
Management Science
Supply Chain and Inventory Management
2.28
article

Assortment Optimization with α-Similar Substitutes: Insights from Customer Browsing Patterns

Bo Jiang, Nanxi Zhang, Renjie Chen, Christopher Ryan
article en
1 citations

Abstract

We propose an approach to model assortment optimization problems based on two observations we made from customer browsing history on Taobao. First, most customers consider very few items (no more than five) before purchasing. Second, there exists a sorting of items so that most customer consideration sets are contained in small intervals in this sorting. This sorting can be discovered by the Cuthill-McKee algorithm, which is designed to work with sparse matrices. We encode these two observations into the [Formula: see text]-similar substitutes property, which requires that all customers have consideration sets that lie in intervals (in the sorting) of length at most [Formula: see text], where [Formula: see text] is a parameter we select and is fitted from data. The assortment optimization and pricing problems associated with this property are fixed-parameter tractable for a fixed [Formula: see text]. Moreover, we show that the assortment optimization for some specific choice model with [Formula: see text]-similar substitutes property is polynomial-time solvable. We demonstrate our approach—going from data to modeling (i.e., selecting an appropriate [Formula: see text]) and finally to optimization—on another data set of customer click history on JD.com. Lastly, we conduct sensitivity tests on choice models that satisfy the [Formula: see text]-similar substitutes property in the presence of customers with large consideration sets. We provide an approximation guarantee in terms of revenue when asserting the [Formula: see text]-similar substitutes property. Both theoretical and numerical results show that the optimal assortment of our estimated model captures most of the revenue even when there are customers with large consideration sets. This paper was accepted by Vivek Farias, data science. Funding: B. Jiang’s research is supported by the National Natural Science Foundation of China [Grants 72394364, 72394363, 72394360, 72171141, and 72442013]. C. T. Ryan is supported by the NSERC [Grant RGPIN-2020-06488] and the SSHRC [Grant AWD-029333]. N. Zhang is supported by Ivey Business School. Supplemental Material: The online appendices and data files are available at https://doi.org/10.1287/mnsc.2023.00786 .

Management Science
Western University (CA), University of British Columbia (CA), Chinese University of Hong Kong (HK), Shanghai University of Finance and Economics (CN)
Openalex Percentile: Top 8%
Supply Chain and Inventory Management
2.28
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.