Optimizing Revenue over Data-driven Assortments

We revisit the problem of assortment optimization under the multinomial logit choice model with general constraints and propose new efficient optimization algorithms. Our algorithms do not make any assumptions on the structure of the feasible sets and in turn do not require a compact representation of constraints describing them. For the case of cardinality constraints, we specialize our algorithms and achieve time complexity sub-quadratic in the number of products in the assortment (existing methods are quadratic or worse). Empirical validations using the billion prices dataset and several retail transaction datasets show that our algorithms are competitive even when the number of items is 10^5 and beyond (100x larger instances than previously studied), supporting their practicality in data driven revenue management applications.

[1]  Wei Liu,et al.  Learning to Hash for Indexing Big Data—A Survey , 2015, Proceedings of the IEEE.

[2]  Lars Schmidt-Thieme,et al.  Real-time top-n recommendation in social streams , 2012, RecSys.

[3]  Sihem Amer-Yahia,et al.  Real-time recommendation of diverse related articles , 2013, WWW.

[4]  Robert Nowak,et al.  Active Learning and Sampling , 2008 .

[5]  M. Lepper,et al.  The Construction of Preference: When Choice Is Demotivating: Can One Desire Too Much of a Good Thing? , 2006 .

[6]  P. Rusmevichientong,et al.  Assortment Optimization under the Multinomial Logit Model with Random Choice Parameters , 2014 .

[7]  Devavrat Shah,et al.  A Nonparametric Approach to Modeling Choice with Limited Data , 2009, Manag. Sci..

[8]  Andrei Z. Broder,et al.  On the resemblance and containment of documents , 1997, Proceedings. Compression and Complexity of SEQUENCES 1997 (Cat. No.97TB100171).

[9]  Alexandr Andoni,et al.  LSH Forest: Practical Algorithms Made Theoretical , 2017, SODA.

[10]  Juan José Miranda Bront,et al.  A Column Generation Algorithm for Choice-Based Network Revenue Management , 2008, Oper. Res..

[11]  Huseyin Topaloglu,et al.  Assortment Optimization Under Variants of the Nested Logit Model , 2014, Oper. Res..

[12]  Vashist Avadhanula,et al.  A Near-Optimal Exploration-Exploitation Approach for Assortment Selection , 2016, EC.

[13]  Gerhard Weikum,et al.  Best-Effort Top-k Query Processing Under Budgetary Constraints , 2009, 2009 IEEE 25th International Conference on Data Engineering.

[14]  Nathan Srebro,et al.  On Symmetric and Asymmetric LSHs for Inner Product Search , 2014, ICML.

[15]  David B. Shmoys,et al.  Dynamic Assortment Optimization with a Multinomial Logit Choice Model and Capacity Constraint , 2010, Oper. Res..

[16]  Jimmy J. Lin,et al.  Ranking under temporal constraints , 2010, CIKM.

[17]  R. Duncan Luce,et al.  Individual Choice Behavior: A Theoretical Analysis , 1979 .

[18]  Jitendra Malik,et al.  Fast k-Nearest Neighbour Search via Prioritized DCI , 2017, ICML.

[19]  Dimitris Bertsimas.  Data-driven assortment optimization , 2015 .

[20]  R. Nowak,et al.  Upper and Lower Error Bounds for Active Learning , 2006 .

[21]  Alexandr Andoni,et al.  Near-Optimal Hashing Algorithms for Approximate Nearest Neighbor in High Dimensions , 2006, 2006 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS'06).

[22]  Danny Segev,et al.  Capacity Constrained Assortment Optimization Under the Markov Chain Based Choice Model , 2015 .

[23]  Nicole Immorlica,et al.  Locality-sensitive hashing scheme based on p-stable distributions , 2004, SCG '04.

[24]  Heng Tao Shen,et al.  Hashing for Similarity Search: A Survey , 2014, ArXiv.

[25]  Aydin Alptekinoglu,et al.  The Exponomial Choice Model: A New Alternative for Assortment and Price Optimization , 2015, Oper. Res..

[26]  Srikanth Jagabathula.  Assortment Optimization Under General Choice , 2011, 1108.3596.

[27]  Gaël Varoquaux,et al.  Scikit-learn: Machine Learning in Python , 2011, J. Mach. Learn. Res..

[28]  G. Gallego,et al.  Assortment Planning Under the Multinomial Logit Model with Totally Unimodular Constraint Structures , 2013 .

[29]  M. Fisher,et al.  Assortment Planning: Review of Literature and Industry Practice , 2008 .

[30]  Ping Li,et al.  Asymmetric LSH (ALSH) for Sublinear Time Maximum Inner Product Search (MIPS) , 2014, NIPS.

[31]  Antonio Gomariz,et al.  SPMF: a Java open-source pattern mining library , 2014, J. Mach. Learn. Res..

[32]  A. Cavallo.  Scraped Data and Sticky Prices , 2015, Review of Economics and Statistics.

[33]  Florian Heiss,et al.  Discrete Choice Methods with Simulation , 2016 .

[34]  Piotr Indyk,et al.  Approximate Nearest Neighbor: Towards Removing the Curse of Dimensionality , 2012, Theory Comput..

[35]  Christian Borgelt,et al.  Frequent item set mining , 2012, WIREs Data Mining Knowl. Discov..