Assortment Optimization Under Consider-then-Choose Choice Models

Aouad, A, Farias, V and Levi, R (2020) Assortment Optimization Under Consider-then-Choose Choice Models. Management Science. ISSN 0025-1909 (Accepted)

Abstract

Consider-then-choose models, borne out by empirical literature in marketing and psychology, explain that customers choose among alternatives in two phases, by first screening products to decide which alternatives to consider, before then ranking them. In this paper, we develop a dynamic programming framework to study the computational aspects of assortment optimization under consider-then-choose premises. Although non-parametric choice models generally lead to computationally intractable assortment optimization problems, we are able to show that for many empirically vetted assumptions on how customers consider and choose, our resulting dynamic program is efficient. Our approach unifies and subsumes several specialized settings analyzed in previous literature. Empirically, we demonstrate the predictive power of our modeling approach on a combination of synthetic and real industry data sets, where prediction errors are significantly reduced against common parametric choice models. In synthetic experiments, our algorithms lead to practical computation schemes that outperform a state-of-the-art integer programming solver in terms of running time, in several parameter regimes of interest.

More Details

Item Type: Article
Subject Areas: Management Science and Operations
Additional Information:

© 2020 INFORMS

Subjects: C > Choice
S > Simulation models
Date Deposited: 26 Jun 2020 11:26
Last Modified: 19 Oct 2020 19:16
URI: https://lbsresearch.london.edu/id/eprint/1426
More

Export and Share


Download

Accepted Version - Text
  • Restricted to Repository staff only

Statistics

Downloads from LBS Research Online

View details

Actions (login required)

Edit Item Edit Item