Real time bid optimization with smooth budget delivery in online advertising

ABSTRACT

Today, billions of display ad impressions are purchased on a daily basis through a public auction hosted by real time bidding (RTB) exchanges. A decision has to be made for advertisers to submit a bid for each selected RTB ad request in milliseconds. Restricted by the budget, the goal is to buy a set of ad impressions to reach as many targeted users as possible. A desired action (conversion), advertiser specific, includes purchasing a product, filling out a form, signing up for emails, etc. In addition, advertisers typically prefer to spend their budget smoothly over the time in order to reach a wider range of audience accessible throughout a day and have a sustainable impact. However, since the conversions occur rarely and the occurrence feedback is normally delayed, it is very challenging to achieve both budget and performance goals at the same time. In this paper, we present an online approach to the smooth budget delivery while optimizing for the conversion performance. Our algorithm tries to select high quality impressions and adjust the bid price based on the prior performance distribution in an adaptive manner by distributing the budget optimally across time. Our experimental results from real advertising campaigns demonstrate the effectiveness of our proposed approach.

References

1. D. Agarwal, R. Agrawal, and R. Khanna. Estimating rates of rare events with multiple hierarchies through scalable log-linear models. ACM SIGKDD Conf. on Knowledge Discovery and Data Mining, 2010.
2. D. Agarwal, A. Broder, D. Chakrabarti, D. Diklic, V. Josifovski, and M. Sayyadian. Estimating rates of rare events at multiple resolutions. ACM SIGKDD Conf. on Knowledge Discovery and Data Mining, 2007.
3. S. Agrawal, Z. Wang, and Y. Ye. A dynamic near-optimal algorithm for online linear programming. arXiv preprint arXiv:0911.2974, 2009.
4. A. Ahmed, Y. Low, M. Aly, V. Josifovski, and A. J. Smola. Scalable distributed inference of dynamic user interests for behavioral targeting. ACM SIGKDD Conf. on Knowledge Discovery and Data Mining, 2011.
5. M. Babaioff, S. Dughmi, R. Kleinberg, and A. Slivkins. Dynamic pricing with limited supply. The 13th ACM Conference on Electronic Commerce, 2012.
6. M. Babaioff, N. Immorlica, D. Kempe, and R. Kleinberg. Online auctions and generalized secretary problems. ACM SIGecom Exchanges, 7(2):7, 2008.
7. A. Bhalgat, J. Feldman, and V. Mirrokni. Online allocation of display ads with smooth delivery. ACM SIGKDD Conf. on Knowledge Discovery and Data Mining, 2012.
8. C. Borgs, J. Chayes, O. Etesami, N. Immorlica, K. Jain, and M. Mahdian. Dynamics of bid optimization in online advertisement aucions. Proceeding of the 16th international conference on World Wide Web, 2007.
9. D. Cerrato, R. Jones, and A. Gupta. Classification of proxy labeled examples for marketing segment generation. ACM SIGKDD Conf. on Knowledge Discovery and Data Mining, 2011.
10. H. Cheng, R. Zwol, J. Azimi, E. Manavoglu, R. Zhang, Y. Zhou, and V. Navalpakkam. Multimedia features for click prediction of new ads in display advertising. ACM SIGKDD Conf. on Knowledge Discovery and Data Mining, 2012.
11. J. Feldman, M. Hezinger, N. Korula, and V. S. Mirrokni. Online stochastic packing applied to display ad allocation. ESA'10 Proceedings of the 18th annual European conference on Algorithms: Part I, 2010.
12. B. Kanagal, A. Ahmed, S. Pandey, V. Josifovski, L. Garcia-Pueyo, and J. Yuan. Focused matrix factorization for audience selection in display advertising. 29th IEEE International Conference on Data Engineering, 2013.
13. K.-C. Lee, B. Orten, A. Dasdan, and W. Li. Estimating conversion rate in display advertising from past performance data. ACM SIGKDD Conf. on Knowledge Discovery and Data Mining, 2012.
14. B. M. Marlin and R. S. Zemel. Collaborative prediction and ranking with non-random missing data. pages 5--12, 2009.
15. A. Menon, K. Chitrapura, S. Garg, D. Agarwal, and N. Kota. Response prediction using collaborative filtering with hierarchies and side-information. ACM SIGKDD Conf. on Knowledge Discovery and Data Mining, 2011.
16. C. Perlich and B. Dalessandro. Bid optimizing and inventory scoring in targeted online advertising. ACM SIGKDD Conf. on Knowledge Discovery and Data Mining, 2012.
17. M. Richardson, E. Dominowska, and R. Ragno. Predicting clicks: estimating the click-through rate for new ads. pages 521--530, 2007.
18. A. I. Schein, A. Popescul, L. H. Ungar, and D. Pennock. Methods and metrics for cold-start recommendations. ACM SIGIR Conf. on Information Retrieval, 2002.
19. W. Zhanbg, Y. Zhang, B. Gao, Y. Yu, X. Yuan, and T.-Y. Liu. Joint optimization of bid and budget allocation in sponsored search. ACM SIGKDD Conf. on Knowledge Discovery and Data Mining, 2012.
20. L. Zhang and D. Agarwal. Fast computation of posterior mode in multi-level hierarchical models. Neural Information Processing Systems Foundation, 2008.
21. Y. Zhou, D. Chakrabarty, and R. Lukose. Budget constrained bidding in keyword auctions and online knapsack problems. Proceeding of the 17th international conference on World Wide Web, 2008.