Assortment Planning for Recommendations at Checkout Under Inventory Constraints

References

• [1] Adamczyk M, Grandoni F, Mukherjee J (2015) Improved approximation algorithms for stochastic matching. Bansal N, Finocchi I, eds. Algorithms—ESA 2015 (Springer, Berlin, Heidelberg), 1–12.Google Scholar
• [2] Aggarwal G, Goel G, Karande C, Mehta A (2011) Online vertex-weighted bipartite matching and single-bid budgeted allocations. Proc. 22nd Annual ACM-SIAM Sympos. Discrete Algorithms (Society for Industrial and Applied Mathematics, Philadelphia), 1253–1264.Google Scholar
• [3] Ball MO, Queyranne M (2009) Toward robust revenue management: Competitive analysis of online booking. Oper. Res. 57(4):950–963.Link, Google Scholar
• [4] 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
• [5] Bitran G, Caldentey R (2003) An overview of pricing models for revenue management. Manufacturing Service Oper. Management 5(3):203–229.Link, Google Scholar
• [6] Blanchet J, Gallego G, Goyal V (2016) A Markov chain approximation to choice modeling. Oper. Res. 64(4):886–905.Link, Google Scholar
• [7] Borodin A, El-Yaniv R (2005) Online Computation and Competitive Analysis (Cambridge University Press, Cambridge, UK).Google Scholar
• [8] Brubach B, Sankararaman KA, Srinivasan A, Xu P (2017) Attenuate locally, win globally: An attenuation-based framework for online stochastic matching with timeouts. Das S, Durfee E, Larson K, Winikoff M, eds. Proc. 16th Conf. Autonomous Agents Multiagent Systems (International Foundation for Autonomous Agents and Multiagent Systems), 1223–1231.Google Scholar
• [9] Bubeck S, Devanur NR, Huang Z, Niazadeh R (2019) Multi-scale online learning and its applications to online auctions. J. Machine Learn. Res. 20(62):1–37.Google Scholar
• [10] Buchbinder N, Jain K, Naor JS (2007) Online primal-dual algorithms for maximizing ad-auctions revenue. Arge L, Hoffmann M, Welzl E, eds. Algorithms—ESA 2007 (Springer, Berlin), 253–264.Google Scholar
• [11] Buchbinder N, Chen S, Naor J, Shamir O (2016) Unified algorithms for online learning and competitive analysis. Math. Oper. Res. 41(2):612–625.Link, Google Scholar
• [12] Chan CW, Farias VF (2009) Stochastic depletion problems: Effective myopic policies for a class of dynamic optimization problems. Math. Oper. Res. 34(2):333–350.Link, Google Scholar
• [13] Cheung WC, Simchi-Levi D (2016) Efficiency and performance guarantees for choice-based network revenue management problems with flexible products. Preprint, submitted August 15, http://dx.doi.org/10.2139/ssrn.2823339.Google Scholar
• [14] Cohen MC, Lobel I, Paes Leme R (2020) Feature-based dynamic pricing. Management Sci. 66(11):4921–4943.Link, Google Scholar
• [15] Dean BC, Goemans MX, Vondrák J (2008) Approximating the stochastic knapsack problem: The benefit of adaptivity. Math. Oper. Res. 33(4):945–964.Link, Google Scholar
• [16] Désir A, Goyal V, Zhang J (2022) Capacitated assortment optimization: Hardness and approximation. Oper Res. 70(2):893–904.Link, Google Scholar
• [17] Désir A, Goyal V, Segev D, Ye C (2020) Constrained assortment optimization under the Markov chain–based choice model. Management Sci. 66(2):698–721.Link, Google Scholar
• [18] Devanur NR, Jain K, Kleinberg RD (2013) Randomized primal-dual analysis of RANKING for online bipartite matching. Khanna S, ed. Proc. 24th Annual ACM-SIAM Sympos. Discrete Algorithms (Society for Industrial and Applied Mathematics, Philadelphia), 101–107.Google Scholar
• [19] Elmaghraby W, Keskinocak P (2003) Dynamic pricing in the presence of inventory considerations: Research overview, current practices, and future directions. Management Sci. 49(10):1287–1309.Link, Google Scholar
• [20] Gallego G, Topaloglu H (2014) Constrained assortment optimization for the nested logit model. Management Sci. 60(10):2583–2601.Link, Google Scholar
• [21] Gallego G, van Ryzin G (1994) Optimal dynamic pricing of inventories with stochastic demand over finite horizons. Management Sci. 40(8):999–1020.Link, Google Scholar
• [22] Gallego G, Iyengar G, Phillips R, Dubey A (2004) Managing flexible products on a network. Preprint, submitted July 1, http://dx.doi.org/10.2139/ssrn.3567371.Google Scholar
• [23] Gallego G, Li A, Truong VA, Wang X (2016) Online personalized resource allocation with customer choice. Technical report, Columbia University, New York.Google Scholar
• [24] Golrezaei N, Nazerzadeh H, Rusmevichientong P (2014) Real-time optimization of personalized assortments. Management Sci. 60(6):1532–1551.Link, Google Scholar
• [25] Kalyanasundaram B, Pruhs KR (2000) An optimal deterministic algorithm for online b-matching. Theoret. Comput. Sci. 233(1):319–325.Crossref, Google Scholar
• [26] Karp RM, Vazirani UV, Vazirani VV (1990) An optimal algorithm for on-line bipartite matching. Proc. 22nd Annual ACM Sympos. Theory Comput. (ACM, New York), 352–358.Google Scholar
• [27] Krumke SO (2002) Online optimization: Competitive analysis and beyond. Postdoctoral thesis, Technische Universität Berlin, Berlin.Google Scholar
• [28] Lan Y, Gao H, Ball MO, Karaesmen I (2008) Revenue management with limited demand information. Management Sci. 54(9):1594–1609.Link, Google Scholar
• [29] Li G, Rusmevichientong P, Topaloglu H (2015) The d-level nested logit model: Assortment and price optimization problems. Oper. Res. 63(2):325–342.Link, Google Scholar
• [30] Linden G, Smith B, York J (2003) Amazon.com recommendations: Item-to-item collaborative filtering. IEEE Internet Comput. 7(1):76–80.Crossref, Google Scholar
• [31] Lugosi G (2009) Concentration-of-measure inequalities. Working paper, Pompeu Fabra University, Barcelona, Spain. http://www.econ.upf.edu/lugosi/anu.pdf.Google Scholar
• [32] Ma W (2018) Improvements and generalizations of stochastic knapsack and Markovian bandits approximation algorithms. Math. Oper. Res. 43(3):789–812.Link, Google Scholar
• [33] Maglaras C, Meissner J (2006) Dynamic pricing strategies for multiproduct revenue management problems. Manufacturing Service Oper. Management 8(2):136–148.Link, Google Scholar
• [34] Mahajan S, van Ryzin G (2001) Stocking retail assortments under dynamic consumer substitution. Oper. Res. 49(3):334–351.Link, Google Scholar
• [35] Mehta A, Panigrahi D (2012) Online matching with stochastic rewards. IEEE 53rd Annual Sympos. Foundations Comput. Sci. (IEEE, Piscataway, NJ), 728–737.Google Scholar
• [36] Mehta A, Waggoner B, Zadimoghaddam M (2015) Online stochastic matching with unequal probabilities. Proc. 26th Annual ACM-SIAM Sympos. Discrete Algorithms (SIAM, Philadelphia), 1388–1404.Google Scholar
• [37] Mehta A, Saberi A, Vazirani U, Vazirani V (2007) AdWords and generalized online matching. J. ACM 54(5):Article 22.Crossref, Google Scholar
• [38] Rusmevichientong P, Shen ZJ, Shmoys D (2010) Dynamic assortment optimization with a multinomial logic choice model and capacity constraint. Oper. Res. 58(6):1666–1680.Link, Google Scholar
• [39] Talluri K, van Ryzin G (2004) Revenue management under a general discrete choice model of consumer behavior. Management Sci. 50(1):15–33.Link, Google Scholar
• [40] van Ryzin G, Mahajan S (1999) On the relationship between inventory costs and variety benefits in retail assortments. Management Sci. 45(11):1496–1509.Link, Google Scholar
• [41] 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
• [42] Xu Y, Wang Z (2018) Assortment optimization for a multi-stage choice model. Preprint, submitted September 4, http://dx.doi.org/10.2139/ssrn.3243742.Google Scholar
• [43] Yao ACC (1977) Probabilistic computations: Toward a unified measure of complexity. 18th Annual Sympos. Foundations Comput. Sci. (IEEE, Piscataway, NJ), 222–227.Google Scholar
• [44] Yuan M, Pavlidis Y, Jain M, Caster K (2016) Walmart online grocery personalization: Behavioral insights and basket recommendations. Link S, Trujillo JC, eds. Adv. Conceptual Modeling: ER 2016 Workshops (Springer, Cham, Switzerland), 49–64.Google Scholar