A Data-Driven Approach to Personalized Bundle Pricing and Recommendation

References

• Agrawal R, Srikant R (1994) Fast algorithms for mining association rules. Proc. 28th Internat. Conf. Very Large Data Bases, vol. 1215 (ACM, New York), 487–499.Google Scholar
• Agrawal S, Wang Z, Ye Y (2014) A dynamic near-optimal algorithm for online linear programming. Oper. Res. 62(4):876–890.Link, Google Scholar
• Aouad A, Levi R, Segev D (2018) Approximation algorithms for dynamic assortment optimization models. Math. Oper. Res. 44(2):487–511.Link, 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
• Bitran G, Caldentey R (2003) An overview of pricing models for revenue management. Manufacturing Service Oper. Management 5(3):203–229.Link, Google Scholar
• Cavusgil ST, Zou S (1994) Marketing strategy-performance relationship: An investigation of the empirical link in export market ventures. J. Marketing 58(1):1–21.Crossref, Google Scholar
• Chen R, Jiang H (2017) Capacitated assortment and price optimization for customers with disjoint consideration sets. Oper. Res. Lett. 45(2):170–174.Crossref, Google Scholar
• Ferreira KJ, Simchi-Levi D, Wang H (2016) Online network revenue management using thompson sampling. Working paper, Harvard Business School, Boston.Google Scholar
• Gallego G, Topaloglu H (2014) Constrained assortment optimization for the nested logit model. Management Sci. 60(10):2583–2601.Link, Google Scholar
• Gallego G, Li A, Truong VA, Wang X (2015) Online resource allocation with customer choice. Working paper, Columbia University, New York.Google Scholar
• Gallego G, Li A, Truong VA, Wang X (2016) Approximation algorithms for product framing and pricing. Working paper, Columbia University, New York.Google Scholar
• Golrezaei N, Nazerzadeh H, Rusmevichientong P (2014) Real-time optimization of personalized assortments. Management Sci. 60(6):1532–1551.Link, Google Scholar
• Goyal V, Levi R, Segev D (2016) Near-optimal algorithms for the assortment planning problem under dynamic substitution and stochastic demand. Oper. Res. 64(1):219–235.Link, Google Scholar
• Harsha P, Subramanian S (2016) Hierarchical demand modeling in the presence of partially or completely unobserved lost sales. INFORMS Revenue Management Pricing Conf. (INFORMS, Catonsville, MD).Google Scholar
• Hawkins JT (2003) A Langrangian decomposition approach to weakly coupled dynamic optimization problems and its applications. PhD thesis, Massachusetts Institute of Technology, Cambridge.Google Scholar
• Jaillet P, Lu X (2012) Near-optimal online algorithms for dynamic resource allocation problems. Working paper, Massachusetts Institute of Technology, Cambridge.Google Scholar
• Kesselheim T, Tönnis A, Radke K, Vöcking B (2014) Primal beats dual on online packing LPS in the random-order model. Proc. 46th Annual ACM Sympos. Theory Comput. (ACM, New York), 303–312.Crossref, Google Scholar
• Kök AG, Fisher ML, Vaidyanathan R (2009) Assortment planning: Review of literature and industry practice. Agrawal N, Smith SA, eds. Retail Supply Chain Management (Springer, New York), 99–153.Google Scholar
• 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
• Mahajan S, van Ryzin G (1999) On the relationship between inventory costs and variety benefits in retail assortments. Management Sci. 45(11):1496–1509.Link, Google Scholar
• Mahajan S, van Ryzin G (2001) Stocking retail assortments under dynamic consumer substitution. Oper. Res. 49(3):334–351.Link, Google Scholar
• Netessine S, Savin S, Xiao W (2006) Revenue management through dynamic cross selling in e-commerce retailing. Oper. Res. 54(5):893–913.Link, Google Scholar
• Rapti E, Karageorgos A, Ntalos G (2014) Adaptive constraint and rule-based product bundling in enterprise networks. Proc. 2014 IEEE 23rd Internat. WETICE Conf. (IEEE, Washington, DC), 15–20.Crossref, Google Scholar
• Rusmevichientong P, Topaloglu H (2012) Robust assortment optimization in revenue management under the multinomial logit choice model. Oper. Res. 60(4):865–882.Link, Google Scholar
• Rusmevichientong P, Shmoys D, Tong C, Topaloglu H (2014) Assortment optimization under the multinomial logit model with random choice parameters. Production Oper. Management 23(11):2023–2039.Crossref, Google Scholar
• Shamsi D, Holtan M, Luenberger R, Ye Y (2014) Online allocation rules in display advertising. Working paper, Stanford University, Palo Alto, CA.Google Scholar
• Talluri KT, van Ryzin GJ (2006) The Theory and Practice of Revenue Management, vol. 68 (Springer Science & Business Media, New York).Google Scholar
• Topaloglu H (2009) Using Lagrangian relaxation to compute capacity-dependent bid prices in network revenue management. Oper. Res. 57(3):637–649.Link, Google Scholar
• Verhein F (2008) Frequent Pattern Growth (FP-Growth) Algorithm (University of Sydney, Sydney, NSW, Australia), 1–10.Google Scholar
• Xue Z, Wang Z, Ettl M (2015) Pricing personalized bundles: A new approach and an empirical study. Manufacturing Service Oper. Management 18(1):51–68.Link, Google Scholar