Cold Start to Improve Market Thickness on Online Advertising Platforms: Data-Driven Algorithms and Field Experiments

References

• Agrawal S, Devanur NR (2014) Bandits with concave rewards and convex knapsacks. Proc. 15th ACM Conf. Econom. Comput. (Association for Computing Machinery), 989–1006.Google Scholar
• Agrawal S, Devanur NR, Li L (2016) An efficient algorithm for contextual bandits with knapsacks, and an extension to concave objectives. 29th Annual Conf. Learn. Theory, vol. 49 (PMLR), 4–18.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
• Agarwal A, Dudík M, Kale S, Langford J, Schapire R (2012) Contextual bandit learning with predictable rewards. Proc. 15th Internat. Conf. Artificial Intelligence Statist., vol. 22 (PMLR), 19–26.Google Scholar
• Agarwal A, Hsu D, Kale S, Langford J, Li L, Schapire R (2014) Taming the monster: A fast and simple algorithm for contextual bandits. Proc. 31st Internat. Conf. Machine Learn 32(2):1638–1646.Google Scholar
• Badanidiyuru A, Kleinberg R, Slivkins A (2018) Bandits with knapsacks. J. ACM 65(3):1–55.Google Scholar
• Balseiro SR, Gur Y (2019) Learning in repeated auctions with budgets: Regret minimization and equilibrium. Management Sci. 65(9):3952–3968.Link, Google Scholar
• Balseiro SR, Besbes O, Weintraub GY (2015) Repeated auctions with budgets in ad exchanges: Approximations and design. Management Sci. 61(4):864–884.Link, Google Scholar
• Balseiro S, Lu H, Mirrokni V (2022) The best of many worlds: Dual mirror descent for online allocation problems. Oper. Res., ePub ahead of print May 23, https://doi.org/10.1287/opre.2021.2242.Link, Google Scholar
• Balseiro SR, Feldman J, Mirrokni V, Muthukrishnan S (2014) Yield optimization of display advertising with ad exchange. Management Sci. 60(12):2886–2907.Link, Google Scholar
• Bastani H, Simchi-Levi D, Zhu R (2022) Meta dynamic pricing: Transfer learning across experiments. Management Sci. 68(3):1865–1881.Google Scholar
• Bietti A, Agarwal A, Langford J (2021) A contextual bandit bake-off. J. Machine Learn. Res. 22(133):1–49.Google Scholar
• Bimpikis K, Elmaghraby WJ, Moon K, Zhang W (2020) Managing market thickness in online business-to-business markets. Management Sci. 66(12):5783–5822.Link, Google Scholar
• Blake T, Coey D (2014) Why marketplace experimentation is harder than it seems: The role of test-control interference. Proc. 15th ACM Conf. Econom. Comput. (Association for Computing Machinery), 567–582.Google Scholar
• Caldentey R, Vulcano G (2007) Online auction and list price revenue management. Management Sci. 53(5):795–813.Link, Google Scholar
• Chen N, Gallego G (2022) A primal-dual learning algorithm for personalized dynamic pricing with an inventory constraint. Math. Oper. Res. ePub ahead of print February 10, https://doi.org/10.1287/moor.2021.1220.Link, Google Scholar
• Chen B, Chao X, Ahn HS (2019) Coordinating pricing and inventory replenishment with nonparametric demand learning. Oper. Res. 67(4):1035–1052.Abstract, Google Scholar
• Chen W, Shi C, Duenyas I (2020) Optimal learning algorithms for stochastic inventory systems with random capacities. Production Oper. Management 29(7):1624–1649.Crossref, Google Scholar
• Choi H, Mela CF, Balseiro SR, Leary A (2020) Online display advertising markets: A literature review and future directions. Inform. Systems Res. 31(2):556–575.Link, Google Scholar
• Chu W, Li L, Reyzin L, Schapire R (2011) Contextual bandits with linear payoff functions. Proc. 14th Internat. Conf. Artificial Intelligence Statist. (PMLR), 208–214.Google Scholar
• Cui R, Li J, Zhang DJ (2020) Reducing discrimination with reviews in the sharing economy: Evidence from field experiments on Airbnb. Management Sci. 66(3):1071–1094.Link, Google Scholar
• Cui R, Zhang DJ, Bassamboo A (2019) Learning from inventory availability information: Evidence from field experiments on Amazon. Management Sci. 65(3):1216–1235.Link, Google Scholar
• Dave K, Varma V (2014) Computational advertising: Techniques for targeting relevant ads. Foundations Trends Inform. Retrieval 8(4–5):263–418.Crossref, Google Scholar
• Devanur NR, Hayes TP (2009) The adwords problem: Online keyword matching with budgeted bidders under random permutations. Proc. 10th ACM Conf. Electronic Commerce (Association for Computing Machinery, New York), 71–78.Google Scholar
• Dudik M, Hsu D, Kale S, Karampatziakis N, Langford J, Reyzin L, Zhang T (2011) Efficient optimal learning for contextual bandits. Proc. 27th Conf. Uncertainty Artificial Intelligence, 169–178.Google Scholar
• Feldman J, Zhang DJ, Liu X, Zhang N (2021) Customer choice models vs. machine learning: Finding optimal product displays on Alibaba. Oper. Res. 70(1):309–328.Link, Google Scholar
• Ferreira KJ, Simchi-Levi D, Wang H (2018) Online network revenue management using Thompson sampling. Oper. Res. 66(6):1586–1602.Link, Google Scholar
• Fisher M, Gallino S, Li J (2018) Competition-based dynamic pricing in online retailing: A methodology validated with field experiments. Management Sci. 64(6):2496–2514.Link, Google Scholar
• Foster D, Agarwal A, Dudík M, Luo H, Schapire R (2018) Practical contextual bandits with regression oracles. Dy J, Krause A, eds. Proc. 35th Internat. Conf. Machine Learn., vol. 80 (PMLR), 1539–1548.Google Scholar
• 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
• Golrezaei N, Javanmard A, Mirrokni V (2019) Dynamic incentive-aware learning: Robust pricing in contextual auctions. Adv. Neural Inform. Processing Systems 32:9759–9769.Google Scholar
• Golrezaei N, Nazerzadeh H, Rusmevichientong P (2014) Real-time optimization of personalized assortments. Management Sci. 60(6):1532–1551.Link, Google Scholar
• Ha-Thuc V, Dutta A, Mao R, Wood M, Liu Y (2020) A counterfactual framework for seller-side a/b testing on marketplaces. Proc. 43rd Internat. ACM SIGIR Conf. Res. Development Inform. Retrieval (Association for Computing Machinery), 2288–2296.Google Scholar
• Hojjat A, Turner J, Cetintas S, Yang J (2017) A unified framework for the scheduling of guaranteed targeted display advertising under reach and frequency requirements. Oper. Res. 65(2):289–313.Link, Google Scholar
• Hsu D, Kakade SM, Zhang T (2014) Random design analysis of ridge regression. Foundations Comput. Math. 14(3):569–600.Crossref, Google Scholar
• Imbens GW, Rubin DB (2015) Causal Inference in Statistics, Social, and Biomedical Sciences (Cambridge University Press, Cambridge, UK).Crossref, Google Scholar
• Johari R, Li H, Weintraub G (2022) Experimental design in two-sided platforms: An analysis of bias. Management Sci. ePub ahead of print January 25, https://doi.org/10.1287/mnsc.2021.4247.Link, Google Scholar
• Li X, Sun C, Ye Y (2020) Simple and fast algorithm for binary integer and online linear programming. Adv. Neural Inform. Processing Systems 33:9412–9421.Google Scholar
• Liu M, Mao J, Kang K (2021) Trustworthy online marketplace experimentation with budget-split design. Proc. 27th ACM SIGKDD Conf. Knowledge Discovery Data Mining (Association for Computing Machinery), 3319–3329.Google Scholar
• Nambiar M, Simchi-Levi D, Wang H (2019) Dynamic learning and pricing with model misspecification. Management Sci. 65(11):4980–5000.Link, Google Scholar
• Nesterov Y (2014) Introductory Lectures on Convex Optimization: A Basic Course, vol. 87 (Springer Science & Business Media, New York).Google Scholar
• Pouget-Abadie J, Aydin K, Schudy W, Brodersen K, Mirrokni V (2019) Variance reduction in bipartite experiments through correlation clustering. Adv. Neural Inform. Processing Systems 32:13309–13319.Google Scholar
• Rolnick D, Aydin K, Pouget-Abadie J, Kamali S, Mirrokni V, Najmi A (2019) Randomized experimental design via geographic clustering. Proc. 25th ACM SIGKDD Internat. Conf. Knowledge Discovery Data Mining (Association for Computing Machinery), 2745–2753.Google Scholar
• Schwartz EM, Bradlow ET, Fader PS (2017) Customer acquisition via display advertising using multi-armed bandit experiments. Marketing Sci. 36(4):500–522.Link, Google Scholar
• Simchi-Levi D, Xu Y (2021) Bypassing the monster: A faster and simpler optimal algorithm for contextual bandits under realizability. Math. Oper. Res. 47(3):1904–1931.Google Scholar
• Terwiesch C, Olivares M, Staats BR, Gaur V (2020) OM Forum—A review of empirical operations management over the last two decades. Manufacturing Service Oper. Management 22(4):656–668.Link, Google Scholar
• Vartak M, Thiagarajan A, Miranda C, Bratman J, Larochelle H (2017) A meta-learning perspective on cold-start recommendations for items. Adv. Neural Inform. Processing Systems 30:6907–6917.Google Scholar
• Wager S, Walther G (2015) Adaptive concentration of regression trees, with application to random forests. Preprint, submitted March 22, https://doi.org/10.48550/arXiv.1503.06388.Google Scholar
• Yang L, Wang M (2020) Reinforcement learning in feature space: Matrix bandit, kernels, and regret bound. Proc. 37th Internat. Conf. Machine Learn., vol. 119 (PMLR), 10746–10756.Google Scholar
• Zeng Z, Dai H, Zhang D, Zhang H, Zhang R, Xu Z, Shen ZJM (2021) The impact of social nudges on user-generated content for social network platforms. Management Sci. Forthcoming.Google Scholar
• Zhang H, Rusmevichientong P, Topaloglu H (2018) Multiproduct pricing under the generalized extreme value models with homogeneous price sensitivity parameters. Oper. Res. 66(6):1559–1570.Link, Google Scholar
• Zhang DJ, Dai H, Dong L, Qi F, Zhang N, Liu X, Liu Z, Yang J (2020) The long-term and spillover effects of price promotions on retailing platforms: Evidence from a large randomized experiment on Alibaba. Management Sci. 66(6):2589–2609.Link, Google Scholar
• Zhou D, Li L, Gu Q (2020) Neural contextual bandits with UCB-based exploration. Proc. 37th Internat. Conf. Machine Learn., vol. 119 (PMLR), 11492–11502.Google Scholar
• Zhou G, Zhu X, Song C, Fan Y, Zhu H, Ma X, Yan Y, Jin J, Li H, Gai K (2018) Deep interest network for click-through rate prediction. Proc. 24th ACM SIGKDD Internat. Conf. Knowledge Discovery Data Mining (Association for Computing Machinery), 1059–1068.Google Scholar