Technical Note—Assortment Optimization with Small Consideration Sets

Jacob Feldman (), Alice Paul () and Huseyin Topaloglu ()
Additional contact information
Jacob Feldman: Olin Business School, Washington University, St. Louis, Missouri 63108
Alice Paul: Data Science Initiative, Brown University, Providence, Rhode Island 02912
Huseyin Topaloglu: School of Operations Research and Information Engineering, Cornell Tech, New York, New York 11011

Operations Research, 2019, vol. 67, issue 5, 1283-1299

Abstract: We study a customer choice model that captures purchasing behavior when there is a limit on the number of times that a customer will substitute among the offered products. Under this model, we assume each customer is characterized by a ranked preference list of products and, upon arrival, will purchase the highest ranking offered product. Because we restrict ourselves to settings in which customers consider a limited number of products, we assume that these rankings contain at most k products. We call this model the k -product nonparametric choice model. We focus on the assortment optimization problem under this choice model. In this problem, the retailer wants to find the revenue-maximizing set of products to offer when the buying process of each customer is governed by the k -product nonparametric choice model. First, we show that the assortment problem is strongly NP-hard even for k = 2. Motivated by this result, we develop a linear programming–based randomized rounding algorithm that gives the best known approximation guarantee. We tighten the approximation guarantee further when each preference list contains at most two products and consider the case in which there is a limit on the number of products that can be offered to the customers.

Keywords: assortment optimization; customer choice models; linear programming; approximation algorithms (search for similar items in EconPapers)
Date: 2019
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (9)

Downloads: (external link)
https://doi.org/opre.2018.1803 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:oropre:v:67:y:2019:i:5:p:1283-1299

Access Statistics for this article

More articles in Operations Research from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().