Optimal Dynamic Assortment Planning with Demand Learning

Published Online:https://doi.org/10.1287/msom.2013.0429

References

  • Anderson S, de Palma A, Thisse J-F. Discrete Choice Theory of Product Differentiation (1992) (MIT Press, Cambridge, MA) CrossrefGoogle Scholar
  • Araman V, Caldentey R. Dynamic pricing for non-perishable products with demand learning. Oper. Res. (2009) 57(5):1169–1188LinkGoogle Scholar
  • Besbes O, Zeevi A. Dynamic pricing without knowing the demand function: Risk bounds and near-optimal algorithms. Oper. Res. (2009) 57(6):1407–1420LinkGoogle Scholar
  • Caro F, Gallien J. Dynamic assortment with demand learning for seasonal consumer goods. Management Sci. (2007) 53(2):276–292LinkGoogle Scholar
  • Daganzo C. Multinomial Probit: The Theory and Its Applications to Demand Forecasting (1979) (Academic Press, New York) Google Scholar
  • Farias V, Madan R. The irrevocable multi-armed bandit problem. Oper. Res. (2011) 59(2):383–399LinkGoogle Scholar
  • Farias V, Van Roy B. Dynamic pricing with a prior on market response. Oper. Res. (2010) 58(1):16–29LinkGoogle Scholar
  • Fisher M, Vaidyanathan R. An algorithm and demand estimation procedure for retail assortment optimization. (2009) . Working paper, The Wharton School, University of Pennsylvania, PhiladelphiaGoogle Scholar
  • Gallego G, van Ryzin G. Optimal dynamic pricing of inventories with stochastic demand over finite horizons. Management Sci. (1994) 50(8):999–1020LinkGoogle Scholar
  • Gaur V, Honhon D. Assortment planning and inventory decisions under a locational choice model. Management Sci. (2006) 52(10):1528–1543LinkGoogle Scholar
  • Goyal V, Levi R, Segev D. Near-optimal algorithms for the assortment planning problem under dynamic substitution and stochastic demand. (2009) . Working paper, Columbia University, New YorkGoogle Scholar
  • Honhon D, Gaur V, Seshadri S. Assortment planning and inventory decisions under stock-out based substitution. Oper. Res. (2009) 58(5):1364–1379LinkGoogle Scholar
  • Honhon D, Ulu C, Alptekinoglu A. Learning consumer tastes through dynamic assortments. Oper. Res. (2012) 60(4):833–849LinkGoogle Scholar
  • Hopp W, Xu X. A static approximation for dynamic demand substitution with applications in a competitive market. Oper. Res. (2008) 56(3):630–645LinkGoogle Scholar
  • Kök AG, Fisher ML, Vaidyanathan R, Agrawal N, Smith SA. Assortment planning: Review of literature and industry practice. Retail Supply Chain Management: Quantitative Models and Empirical Studies (2008) (Springer, New York) 99–154CrossrefGoogle Scholar
  • Lai T, Robbins H. Asymptotically efficient adaptive allocation rules. Adv. Appl. Math. (1985) 6(1):4–22CrossrefGoogle Scholar
  • Lim A, Shanthikumar J. Relative entropy, exponential utility, and robust dynamic pricing. Oper. Res. (2007) 55(2):198–214LinkGoogle Scholar
  • Mahajan S, van Ryzin G. Stocking retail assortments under dynamic consumer substitution. Oper. Res. (2001) 49(3):334–351LinkGoogle Scholar
  • Megiddo N. Combinatorial optimization with rational objective functions. Math. Oper. Res. (1979) 4(4):414–424LinkGoogle Scholar
  • Robbins H. Some aspects of the sequential design of experiments. Bull. Amer. Math. Soc. (1952) 58(5):527–535CrossrefGoogle Scholar
  • Rusmevichientong P, Broder J. Dynamic pricing under a general parametric choice model. Oper. Res. (2012) 60(4):965–980LinkGoogle Scholar
  • Rusmevichientong P, Shen Z-JM, Shmoys DB. Dynamic assortment optimization with a multinomial logit choice model and capacity constraint. Oper. Res. (2010) 58(6):1666–1680LinkGoogle Scholar
  • Thompson WR. On the likelihood that one unknown probability exceeds another in view of the evidence of two samples. Biometrika (1933) 25(3/4):285–294Google Scholar
  • Train K. Discrete Choice Methods with Simulation (2009) (Cambridge University Press, New York) CrossrefGoogle Scholar
  • van Ryzin G, Mahajan S. On the relationship between inventory costs and variety benefits in retail assortments. Management Sci. (1999) 45(11):1496–1509LinkGoogle Scholar
INFORMS site uses cookies to store information on your computer. Some are essential to make our site work; Others help us improve the user experience. By using this site, you consent to the placement of these cookies. Please read our Privacy Statement to learn more.