IDEAS home Printed from https://ideas.repec.org/a/inm/ormnsc/v69y2023i7p3838-3860.html
   My bibliography  Save this article

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

Author

Listed:
  • Zikun Ye

    (Department of Industrial and Enterprise Systems Engineering, University of Illinois at Urbana-Champaign, Urbana, Illinois 61801)

  • Dennis J. Zhang

    (Olin Business School, Washington University in St. Louis, St. Louis, Missouri 63130)

  • Heng Zhang

    (W. P. Carey School of Business, Arizona State University, Tempe, Arizona 85287)

  • Renyu Zhang

    (Department of Decision Sciences and Managerial Economics, CUHK Business School, The Chinese University of Hong Kong, Hong Kong, China)

  • Xin Chen

    (H. Milton Stewart School of Industrial and Systems Engineering, Georgia Institute of Technology, Atlanta, Georgia 30313)

  • Zhiwei Xu

    (Independent Contributor, Beijing, 100000, China)

Abstract

Cold start describes a commonly recognized challenge for online advertising platforms: with limited data, the machine learning system cannot accurately estimate the click-through rates (CTR) of new ads and, in turn, cannot efficiently price these new ads or match them with platform users. Traditional cold start algorithms often focus on improving the learning rates of CTR for new ads to improve short-term revenue, but unsuccessful cold start can prompt advertisers to leave the platform, decreasing the thickness of the ad marketplace. To address these issues, we build a data-driven optimization model that captures the essential trade-off between short-term revenue and long-term market thickness on the platform. Based on duality theory and bandit algorithms, we develop the shadow bidding with learning (SBL) algorithms with a provable regret upper bound of O ( T 2 / 3 K 1 / 3 ( log T ) 1 / 3 d 1 / 2 ) , where K is the number of ads and d captures the error magnitude of the underlying machine learning oracle for predicting CTR. Our proposed algorithms can be implemented in a real online advertising system with minimal adjustments. To demonstrate this practicality, we have collaborated with a large-scale video-sharing platform, conducting a novel, two-sided randomized field experiment to examine the effectiveness of our SBL algorithm. Our results show that the algorithm increased the cold start success rate by 61.62% while compromising short-term revenue by only 0.717%. Our algorithm has also boosted the platform’s overall market thickness by 3.13% and its long-term advertising revenue by (at least) 5.35%. Our study bridges the gap between the theory of bandit algorithms and the practice of cold start in online advertising, highlighting the value of well-designed cold start algorithms for online advertising platforms.

Suggested Citation

  • Zikun Ye & Dennis J. Zhang & Heng Zhang & Renyu Zhang & Xin Chen & Zhiwei Xu, 2023. "Cold Start to Improve Market Thickness on Online Advertising Platforms: Data-Driven Algorithms and Field Experiments," Management Science, INFORMS, vol. 69(7), pages 3838-3860, July.
  • Handle: RePEc:inm:ormnsc:v:69:y:2023:i:7:p:3838-3860
    DOI: 10.1287/mnsc.2022.4550
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/mnsc.2022.4550
    Download Restriction: no

    File URL: https://libkey.io/10.1287/mnsc.2022.4550?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    References listed on IDEAS

    as
    1. Eric M. Schwartz & Eric T. Bradlow & Peter S. Fader, 2017. "Customer Acquisition via Display Advertising Using Multi-Armed Bandit Experiments," Marketing Science, INFORMS, vol. 36(4), pages 500-522, July.
    2. Guillermo Gallego & Garrett van Ryzin, 1994. "Optimal Dynamic Pricing of Inventories with Stochastic Demand over Finite Horizons," Management Science, INFORMS, vol. 40(8), pages 999-1020, August.
    3. Santiago R. Balseiro & Omar Besbes & Gabriel Y. Weintraub, 2015. "Repeated Auctions with Budgets in Ad Exchanges: Approximations and Design," Management Science, INFORMS, vol. 61(4), pages 864-884, April.
    4. Marshall Fisher & Santiago Gallino & Jun Li, 2018. "Competition-Based Dynamic Pricing in Online Retailing: A Methodology Validated with Field Experiments," Management Science, INFORMS, vol. 64(6), pages 2496-2514, June.
    5. Santiago R. Balseiro & Yonatan Gur, 2019. "Learning in Repeated Auctions with Budgets: Regret Minimization and Equilibrium," Management Science, INFORMS, vol. 65(9), pages 3952-3968, September.
    6. Boxiao Chen & Xiuli Chao & Hyun-Soo Ahn, 2019. "Coordinating Pricing and Inventory Replenishment with Nonparametric Demand Learning," Operations Research, INFORMS, vol. 67(4), pages 1035-1052, July.
    7. Kostas Bimpikis & Wedad J. Elmaghraby & Ken Moon & Wenchang Zhang, 2020. "Managing Market Thickness in Online Business-to-Business Markets," Management Science, INFORMS, vol. 66(12), pages 5783-5822, December.
    8. Santiago R. Balseiro & Jon Feldman & Vahab Mirrokni & S. Muthukrishnan, 2014. "Yield Optimization of Display Advertising with Ad Exchange," Management Science, INFORMS, vol. 60(12), pages 2886-2907, December.
    9. Negin Golrezaei & Hamid Nazerzadeh & Paat Rusmevichientong, 2014. "Real-Time Optimization of Personalized Assortments," Management Science, INFORMS, vol. 60(6), pages 1532-1551, June.
    10. Christian Terwiesch & Marcelo Olivares & Bradley R. Staats & Vishal Gaur, 2020. "OM Forum—A Review of Empirical Operations Management over the Last Two Decades," Manufacturing & Service Operations Management, INFORMS, vol. 22(4), pages 656-668, July.
    11. Ruomeng Cui & Jun Li & Dennis J. Zhang, 2020. "Reducing Discrimination with Reviews in the Sharing Economy: Evidence from Field Experiments on Airbnb," Management Science, INFORMS, vol. 66(3), pages 1071-1094, March.
    12. Mila Nambiar & David Simchi-Levi & He Wang, 2019. "Dynamic Learning and Pricing with Model Misspecification," Management Science, INFORMS, vol. 65(11), pages 4980-5000, November.
    13. René Caldentey & Gustavo Vulcano, 2007. "Online Auction and List Price Revenue Management," Management Science, INFORMS, vol. 53(5), pages 795-813, May.
    14. Ali Hojjat & John Turner & Suleyman Cetintas & Jian Yang, 2017. "A Unified Framework for the Scheduling of Guaranteed Targeted Display Advertising Under Reach and Frequency Requirements," Operations Research, INFORMS, vol. 65(2), pages 289-313, April.
    15. Hana Choi & Carl F. Mela & Santiago R. Balseiro & Adam Leary, 2020. "Online Display Advertising Markets: A Literature Review and Future Directions," Information Systems Research, INFORMS, vol. 31(2), pages 556-575, June.
    16. Dennis J. Zhang & Hengchen Dai & Lingxiu Dong & Fangfang Qi & Nannan Zhang & Xiaofei Liu & Zhongyi Liu & Jiang Yang, 2020. "The Long-term and Spillover Effects of Price Promotions on Retailing Platforms: Evidence from a Large Randomized Experiment on Alibaba," Management Science, INFORMS, vol. 66(6), pages 2589-2609, June.
    17. Weidong Chen & Cong Shi & Izak Duenyas, 2020. "Optimal Learning Algorithms for Stochastic Inventory Systems with Random Capacities," Production and Operations Management, Production and Operations Management Society, vol. 29(7), pages 1624-1649, July.
    18. Shipra Agrawal & Zizhuo Wang & Yinyu Ye, 2014. "A Dynamic Near-Optimal Algorithm for Online Linear Programming," Operations Research, INFORMS, vol. 62(4), pages 876-890, August.
    19. Imbens,Guido W. & Rubin,Donald B., 2015. "Causal Inference for Statistics, Social, and Biomedical Sciences," Cambridge Books, Cambridge University Press, number 9780521885881, September.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Jinglong Zhao, 2024. "Experimental Design For Causal Inference Through An Optimization Lens," Papers 2408.09607, arXiv.org, revised Aug 2024.
    2. Niu, Baozhuang & Liu, Jiayun & Zhang, Jianhua & Chen, Kanglin, 2024. "Promised-delivery-time-driven reselling facing global platform's private label competition: Game analysis and data validation," Omega, Elsevier, vol. 123(C).
    3. Ruohan Zhan & Shichao Han & Yuchen Hu & Zhenling Jiang, 2024. "Estimating Treatment Effects under Recommender Interference: A Structured Neural Networks Approach," Papers 2406.14380, arXiv.org, revised Jul 2024.
    4. Haihao Lu & Luyang Zhang, 2024. "The Power of Linear Programming in Sponsored Listings Ranking: Evidence from Field Experiments," Papers 2403.14862, arXiv.org.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Hana Choi & Carl F. Mela & Santiago R. Balseiro & Adam Leary, 2020. "Online Display Advertising Markets: A Literature Review and Future Directions," Information Systems Research, INFORMS, vol. 31(2), pages 556-575, June.
    2. Ilan Lobel, 2021. "Revenue Management and the Rise of the Algorithmic Economy," Management Science, INFORMS, vol. 67(9), pages 5389-5398, September.
    3. Qi Feng & J. George Shanthikumar, 2022. "Developing operations management data analytics," Production and Operations Management, Production and Operations Management Society, vol. 31(12), pages 4544-4557, December.
    4. Ming Hu, 2021. "From the Classics to New Tunes: A Neoclassical View on Sharing Economy and Innovative Marketplaces," Production and Operations Management, Production and Operations Management Society, vol. 30(6), pages 1668-1685, June.
    5. Sameer Mehta & Milind Dawande & Ganesh Janakiraman & Vijay Mookerjee, 2020. "Sustaining a Good Impression: Mechanisms for Selling Partitioned Impressions at Ad Exchanges," Information Systems Research, INFORMS, vol. 31(1), pages 126-147, March.
    6. Mengzhou Zhuang & Eric (Er) Fang & Jongkuk Lee & Xiaoling Li, 2021. "The Effects of Price Rank on Clicks and Conversions in Product List Advertising on Online Retail Platforms," Information Systems Research, INFORMS, vol. 32(4), pages 1412-1430, December.
    7. Miguel A. Lejeune & John Turner, 2019. "Planning Online Advertising Using Gini Indices," Operations Research, INFORMS, vol. 67(5), pages 1222-1245, September.
    8. Santiago Balseiro & Anthony Kim & Mohammad Mahdian & Vahab Mirrokni, 2021. "Budget-Management Strategies in Repeated Auctions," Operations Research, INFORMS, vol. 69(3), pages 859-876, May.
    9. Leila Hosseini & Shaojie Tang & Vijay Mookerjee, 2024. "When Is More Merrier? A Cloud-Based Architecture to Procure Impressions from Multiple Ad Exchanges," Information Systems Research, INFORMS, vol. 35(1), pages 294-317, March.
    10. Abhijeet Ghoshal & Radha Mookerjee & Zhen Sun, 2023. "Serving two masters? Optimizing mobile ad contracts with heterogeneous advertisers," Production and Operations Management, Production and Operations Management Society, vol. 32(2), pages 618-636, February.
    11. Raghav Singal & Omar Besbes & Antoine Desir & Vineet Goyal & Garud Iyengar, 2022. "Shapley Meets Uniform: An Axiomatic Framework for Attribution in Online Advertising," Management Science, INFORMS, vol. 68(10), pages 7457-7479, October.
    12. Luofeng Liao & Christian Kroer, 2024. "Statistical Inference and A/B Testing in Fisher Markets and Paced Auctions," Papers 2406.15522, arXiv.org, revised Aug 2024.
    13. Luofeng Liao & Christian Kroer, 2023. "Statistical Inference and A/B Testing for First-Price Pacing Equilibria," Papers 2301.02276, arXiv.org, revised Jun 2023.
    14. Zhaohua Chen & Chang Wang & Qian Wang & Yuqi Pan & Zhuming Shi & Zheng Cai & Yukun Ren & Zhihua Zhu & Xiaotie Deng, 2022. "Dynamic Budget Throttling in Repeated Second-Price Auctions," Papers 2207.04690, arXiv.org, revised Dec 2023.
    15. Prakash, David & Spann, Martin, 2022. "Dynamic pricing and reference price effects," Journal of Business Research, Elsevier, vol. 152(C), pages 300-314.
    16. Veronica Marotta & Yue Wu & Kaifu Zhang & Alessandro Acquisti, 2022. "The Welfare Impact of Targeted Advertising Technologies," Information Systems Research, INFORMS, vol. 33(1), pages 131-151, March.
    17. Thomas W. Frick & Rodrigo Belo & Rahul Telang, 2023. "Incentive Misalignments in Programmatic Advertising: Evidence from a Randomized Field Experiment," Management Science, INFORMS, vol. 69(3), pages 1665-1686, March.
    18. Huaxiao Shen & Yanzhi Li & Jingjing Guan & Geoffrey K.F. Tso, 2021. "A Planning Approach to Revenue Management for Non‐Guaranteed Targeted Display Advertising," Production and Operations Management, Production and Operations Management Society, vol. 30(6), pages 1583-1602, June.
    19. Jason Rhuggenaath & Alp Akcay & Yingqian Zhang & Uzay Kaymak, 2022. "Setting Reserve Prices in Second-Price Auctions with Unobserved Bids," INFORMS Journal on Computing, INFORMS, vol. 34(6), pages 2950-2967, November.
    20. Athanassios N. Avramidis & Arnoud V. Boer, 2021. "Dynamic pricing with finite price sets: a non-parametric approach," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 94(1), pages 1-34, August.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:inm:ormnsc:v:69:y:2023:i:7:p:3838-3860. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.html .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.