Assortment Optimization Under the Mallows model

We consider the assortment optimization problem when customer preferences follow a mixture of Mallows distributions. The assortment optimization problem focuses on determining the revenue/profit maximizing subset of products from a large universe of products; it is an important decision that is commonly faced by retailers in determining what to offer their customers. There are two key challenges: (a) the Mallows distribution lacks a closed-form expression (and requires summing an exponential number of terms) to compute the choice probability and, hence, the expected revenue/profit per customer; and (b) finding the best subset may require an exhaustive search. Our key contributions are an efficiently computable closed-form expression for the choice probability under the Mallows model and a compact mixed integer linear program (MIP) formulation for the assortment problem.

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

[2]  Danny Segev,et al.  The Approximability of Assortment Optimization Under Ranking Preferences , 2015, Oper. Res..

[3]  Peter Winkler,et al.  Counting linear extensions is #P-complete , 1991, STOC '91.

[4]  Huseyin Topaloglu,et al.  Constrained Assortment Optimization for the Nested Logit Model , 2014, Manag. Sci..

[5]  Jeff A. Bilmes,et al.  Consensus ranking under the exponential model , 2007, UAI.

[6]  Craig Boutilier,et al.  Learning Mallows Models with Pairwise Preferences , 2011, ICML.

[7]  Moni Naor,et al.  Rank aggregation methods for the Web , 2001, WWW '01.

[8]  John Guiver,et al.  Bayesian inference for Plackett-Luce ranking models , 2009, ICML '09.

[9]  J. Yellott.  The relationship between Luce's Choice Axiom, Thurstone's Theory of Comparative Judgment, and the double exponential distribution , 1977 .

[10]  Garrett J. van Ryzin,et al.  Revenue Management Under a General Discrete Choice Model of Consumer Behavior , 2004, Manag. Sci..

[11]  J. Tukey,et al.  An algorithm for the machine calculation of complex Fourier series , 1965 .

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

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

[14]  J. Marden.  Analyzing and Modeling Rank Data , 1996 .

[15]  R. Duncan Luce,et al.  Individual Choice Behavior , 1959 .

[16]  D. McFadden.  Econometric Models for Probabilistic Choice Among Products , 1980 .

[17]  Mark D. Uncles,et al.  Discrete Choice Analysis: Theory and Application to Travel Demand , 1987 .

[18]  Daniel McFadden,et al.  Modelling the Choice of Residential Location , 1977 .

[19]  Yi Mao,et al.  Non-parametric Modeling of Partially Ranked Data , 2007, NIPS.

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

[21]  Danny Segev,et al.  Near-Optimal Algorithms for the Assortment Planning Problem Under Dynamic Substitution and Stochastic Demand , 2015, Oper. Res..

[22]  R. Plackett.  The Analysis of Permutations , 1975 .

[23]  Thomas Brendan Murphy,et al.  Mixtures of distance-based models for ranking data , 2003, Comput. Stat. Data Anal..

[24]  J. Blanchet,et al.  A markov chain approximation to choice modeling , 2013, EC '13.

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

[26]  Garrett J. van Ryzin,et al.  A Market Discovery Algorithm to Estimate a General Class of Nonparametric Choice Models , 2015, Manag. Sci..

[27]  Dorothée Honhon,et al.  Optimal Algorithms for Assortment Selection Under Ranking-Based Consumer Choice Models , 2012, Manuf. Serv. Oper. Manag..

[28]  C. L. Mallows.  NON-NULL RANKING MODELS. I , 1957 .

[29]  A. Pekec,et al.  The repeated insertion model for rankings: Missing link between two subset choice models , 2004 .