A New Optimization Layer for Real-Time Bidding Advertising Campaigns

While it is relatively easy to start an online advertising campaign, obtaining a high Key Performance Indicator (KPI) can be challenging. A large body of work on this subject has already been performed and platforms known as DSPs are available on the market that deal with such an optimization. From the advertiser's point of view, each DSP is a different black box, with its pros and cons, that needs to be configured. In order to take advantage of the pros of every DSP, advertisers are well-advised to use a combination of them when setting up their campaigns. In this paper, we propose an algorithm for advertisers to add an optimization layer on top of DSPs. The algorithm we introduce, called SKOTT, maximizes the chosen KPI by optimally configuring the DSPs and putting them in competition with each other. SKOTT is a highly specialized iterative algorithm loosely based on gradient descent that is made up of three independent sub-routines, each dealing with a different problem: partitioning the budget, setting the desired average bid, and preventing under-delivery. In particular, one of the novelties of our approach lies in our taking the perspective of the advertisers rather than the DSPs. Synthetic market data is used to evaluate the efficiency of SKOTT against other state-of-the-art approaches adapted from similar problems. The results illustrate the benefits of our proposals, which greatly outperforms the other methods.

[1]  Jun Wang,et al.  Real-Time Bidding by Reinforcement Learning in Display Advertising , 2017, WSDM.

[2]  Peter Auer,et al.  UCB revisited: Improved regret bounds for the stochastic multi-armed bandit problem , 2010, Period. Math. Hung..

[3]  Marcin Andrychowicz,et al.  Parameter Space Noise for Exploration , 2017, ICLR.

[4]  Zheng Wen,et al.  Profit Maximization for Online Advertising Demand-Side Platforms , 2017, ADKDD@KDD.

[5]  Hao Wang,et al.  Dual Based DSP Bidding Strategy and its Application , 2017, ArXiv.

[6]  Roger B. Myerson,et al.  Optimal Auction Design , 1981, Math. Oper. Res..

[7]  Y. Freund,et al.  The non-stochastic multi-armed bandit problem , 2001 .

[8]  黄令 A quantum model for the stock market , 2010 .

[9]  D. Wittink,et al.  Building Models for Marketing Decisions , 2000 .

[10]  Aranyak Mehta,et al.  Optimizing budget constrained spend in search advertising , 2013, WSDM '13.

[11]  Peter Auer,et al.  The Nonstochastic Multiarmed Bandit Problem , 2002, SIAM J. Comput..

[12]  Chao Zhang,et al.  A quantum model for the stock market , 2010, 1009.4843.

[13]  Timothy Dozat,et al.  Incorporating Nesterov Momentum into Adam , 2016 .

[14]  G. Zinkhan,et al.  Market valuation models of the effect of advertising and promotional spending: A review and meta-analysis , 2005 .

[15]  Manfred K. Warmuth,et al.  Exponentiated Gradient Versus Gradient Descent for Linear Predictors , 1997, Inf. Comput..

[16]  Omar Besbes,et al.  Stochastic Multi-Armed-Bandit Problem with Non-stationary Rewards , 2014, NIPS.

[17]  Weinan Zhang,et al.  Optimal real-time bidding for display advertising , 2014, KDD.

[18]  R. A. Leibler,et al.  On Information and Sufficiency , 1951 .

[19]  Tie-Yan Liu,et al.  Sequential Click Prediction for Sponsored Search with Recurrent Neural Networks , 2014, AAAI.

[20]  Weinan Zhang,et al.  Bidding Machine: Learning to Bid for Directly Optimizing Profits in Display Advertising , 2018, IEEE Transactions on Knowledge and Data Engineering.

[21]  Jun Wang,et al.  Real-time bidding for online advertising: measurement and analysis , 2013, ADKDD '13.

[22]  Omar Besbes,et al.  Optimal Exploration-Exploitation in a Multi-Armed-Bandit Problem with Non-Stationary Rewards , 2014, Stochastic Systems.

[23]  Matthew Richardson,et al.  Predicting clicks: estimating the click-through rate for new ads , 2007, WWW '07.

[24]  Jimmy Ba,et al.  Adam: A Method for Stochastic Optimization , 2014, ICLR.

[25]  Dimitri Kroujiline,et al.  Sell the news? A news-driven model of the stock market , 2014 .

[26]  Brian Donnellan New Horizons in Design Science: Broadening the Research Agenda : 10th International Conference, DESRIST 2015, Dublin, Ireland, May 20-22, 2015, Proceedings , 2015 .

[27]  Nikhil R. Devanur,et al.  Real-time bidding algorithms for performance-based display ad allocation , 2011, KDD.

[28]  William Vickrey,et al.  Counterspeculation, Auctions, And Competitive Sealed Tenders , 1961 .

[29]  Dick R. Wittink,et al.  Building models for marketing decisions: past, present and future , 2000 .

[30]  Feiyue Wang,et al.  A survey on real time bidding advertising , 2014, Proceedings of 2014 IEEE International Conference on Service Operations and Logistics, and Informatics.

[31]  Jon Feldman,et al.  Budget optimization in search-based advertising auctions , 2006, EC '07.

[32]  Raoul Pietersz,et al.  A comparison of single factor Markov-functional and multi factor market models , 2005 .