A Dynamic Clustering Approach to Data-Driven Assortment Personalization

References

• Agrawal S, Goyal N (2012) Analysis of Thompson sampling for the multi-armed bandit problem. JMLR: Proc. 25th Conf. Learn. Theory 23:39.1–39.26.Google Scholar
• Agrawal S, Avadhanula V, Goyal V, Zeevi A (2017) MNL-bandit: A dynamic learning approach to assortment selection. Working paper, Columbia University, New York.Google Scholar
• Anantharam V, Varaiya P, Walrand J (1987) Asymptotically efficient allocation rules for the multiarmed bandit problem with multiple plays—Part I: IID rewards. Automatic Control IEEE Trans. 32(11):968–976.Crossref, Google Scholar
• Ansari A, Mela CF (2003) E-customization. J. Marketing Res. 40(2):131–145.Crossref, Google Scholar
• Antoniak CE (1974) Mixtures of Dirichlet processes with applications to Bayesian nonparametric problems. Ann. Statist. 2(6):1152–1174.Crossref, Google Scholar
• Arora N, Dreze X, Ghose A, Hess JD, Iyengar R, Jing B, Joshi Yet al., (2008) Putting one-to-one marketing to work: Personalization, customization, and choice. Marketing Lett. 19(3–4):305–321.Crossref, Google Scholar
• Auer P, Cesa-Bianchi N, Fischer P (2002) Finite-time analysis of the multiarmed bandit problem. Machine Learn. 47(2–3):235–256.Crossref, Google Scholar
• Bernstein F, Kök AG, Xie L (2015) Dynamic assortment customization with limited inventories. Manufacturing Service Oper. Management 17(4):538–553.Link, Google Scholar
• Besbes O, Sauré D (2016) Product assortment and price competition under multinomial logit demand. Production Oper. Management 25(1):114–127.Crossref, Google Scholar
• Burda M, Harding M, Hausman J (2008) A Bayesian mixed logit–probit model for multinomial choice. J. Econometrics 147(2):232–246.Crossref, Google Scholar
• Caro F, Gallien J (2007) Dynamic assortment with demand learning for seasonal consumer goods. Management Sci. 53(2):276–292.Link, Google Scholar
• Chen X, Owen Z, Pixton C, Simchi-Levi D (2015) A statistical learning approach to personalization in revenue management. Working paper, New York University, New York.Google Scholar
• Ciocan DF, Farias VF (2014) Fast demand learning for display advertising revenue management. Working paper, Massachusetts Institute of Technology Cambridge, MA.Google Scholar
• eMarketer (2017) Worldwide retail and ecommerce sales: eMarketer’s estimates for 2016–2021. eMarketer (July 18), https://www.emarketer.com/Report/Worldwide-Retail-Ecommerce-Sales-eMarketers-Estimates-20162021/2002090.Google Scholar
• Ferguson T (1973) A Bayesian analysis of some nonparametric problems. Ann. Statist. 1(2):209–230.Crossref, Google Scholar
• Ferguson TS (1983) Bayesian density estimation by mixtures of normal distributions. Recent Adv. Statist. 24:287–302.Crossref, Google Scholar
• Fisher M, Vaidyanathan R (2014) A demand estimation procedure for retail assortment optimization with results from implementations. Management Sci. 60(10):2401–2415.Link, Google Scholar
• Gallego G, Li A, Truong V-A, Wang X (2016) Online personalized resource allocation with customer choice. Working Paper, Columbia University, New York.Google Scholar
• Gelman A, Carlin JB, Stern HS, Rubin DB (2014) Bayesian Data Analysis (Taylor & Francis, Boca Raton, FL).Google Scholar
• Golrezaei N, Nazerzadeh H, Rusmevichientong P (2014) Real-time optimization of personalized assortments. Management Sci. 60(6):1532–1551.Link, Google Scholar
• Heller KA, Ghahramani Z (2005) Bayesian hierarchical clustering. Proc. 22nd Internat. Conf. Machine Learn. (ACM), 297–304.Google Scholar
• Jasin S, Kumar S (2012) A re-solving heuristic with bounded revenue loss for network revenue management with customer choice. Math. Oper. Res. 37(2):313–345.Link, Google Scholar
• Kallus N, Udell M (2016) Dynamic assortment personalization in high dimensions. Working paper, Cornell University, Ithaca, NY.Google Scholar
• Kök AG, Fisher ML, Vaidyanathan R (2015) Assortment planning: Review of literature and industry practice. Agrawal N, Smith S, eds. Retail Supply Chain Management, International Series in Operations Research and Management Science, Vol. 223 (Springer Science & Business Media, New York), 175–236.Crossref, Google Scholar
• Lai TL, Robbins H (1985) Asymptotically efficient adaptive allocation rules. Adv. Appl. Math. 6(1):4–22.Crossref, Google Scholar
• Linden G, Smith B, York J (2003) Amazon.com recommendations: Item-to-item collaborative filtering. Internet Comput. IEEE 7(1):76–80.Crossref, Google Scholar
• Modaresi S, Sauré D, Vielma JP (2014) Learning in combinatorial optimization: What and how to explore. Working paper, Duke University, Durham, NC.Google Scholar
• Neal R (2000) Markov chain sampling methods for dirichlet process mixture models. J. Computational Graphical Statist. 9(2):249–265.Google Scholar
• Rusmevichientong P, Shen Z-JM, Shmoys DB (2010) Dynamic assortment optimization with a multinomial logit choice model and capacity constraint. Oper. Res. 58(6):1666–1680.Link, Google Scholar
• Sauré D, Zeevi A (2013) Optimal dynamic assortment planning with demand learning. Manufacturing Service Oper. Management 15(3):387–404.Link, Google Scholar
• Thompson WR (1933) On the likelihood that one unknown probability exceeds another in view of the evidence of two samples. Biometrika 25(3–4):285–294.Crossref, Google Scholar
• Ulu C, Honhon D, Alptekinoğlu A (2012) Learning consumer tastes through dynamic assortments. Oper. Res. 60(4):833–849.Link, Google Scholar
• Wedel M, Kamakura WA (2012) Market Segmentation: Conceptual and Methodological Foundations, Vol. 8 (Springer Science & Business Media, New York).Google Scholar
• Wood M (2014) A new kind of e-commerce adds a personal touch. New York Times (August 13), https://www.nytimes.com/2014/08/14/technology/personaltech/data-driven-shopping-with-the-personal-touch.html.Google Scholar