Abstract
Online advertising is a major source of income for many online companies. One common approach is to sell online advertisements via waterfall auctions, through which a publisher makes sequential price offers to ad networks. The publisher controls the order and prices of the waterfall in an attempt to maximize his revenue. In this work, we propose a methodology to learn a waterfall strategy from historical data by wisely searching in the space of possible waterfalls and selecting the one leading to the highest revenues. The contribution of this work is twofold; First, we propose a novel method to estimate the valuation distribution of each user, with respect to each ad network. Second, we utilize the valuation matrix to score our candidate waterfalls as part of a procedure that iteratively searches in local neighborhoods. Our framework guarantees that the waterfall revenue improves between iterations ultimately converging into a local optimum. Real-world demonstrations are provided to show that the proposed method improves the total revenue of real-world waterfalls, as compared to manual expert optimization. Finally, the code and the data are available here.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Similar content being viewed by others
References
Afshar, R.R., Rhuggenaath, J., Zhang, Y., Kaymak, U.: A reward shaping approach for reserve price optimization using deep reinforcement learning. In: Proceedings of the 9th International Joint Conference on Neural Networks (2021)
Afshar, R.R., Zhang, Y., Firat, M., Kaymak, U.: A decision support method to increase the revenue of ad publishers in waterfall strategy. In: IEEE Conference on Computational Intelligence for Financial Engineering and Economics, pp. 1–8. IEEE (2019)
Afshar, R.R., Zhang, Y., Firat, M., Kaymak, U.: A reinforcement learning method to select ad networks in waterfall strategy. In: Proceedings of the 11th International Conference on Agents and Artificial Intelligence (2019)
Battiti, R., Brunato, M., Mascia, F.: Reactive search and intelligent optimization, vol. 45. Springer Science & Business Media (2008)
Dimitri, P.: Bertsekas and Athena Scientific. Convex optimization algorithms, Athena Scientific Belmont (2015)
Busch, O.: The programmatic advertising principle. In: Busch, O. (ed.) Programmatic Advertising. MP, pp. 3–15. Springer, Cham (2016). https://doi.org/10.1007/978-3-319-25023-6_1
Chakraborty, T., Even-Dar, E., Guha, S., Mansour, Y., Muthukrishnan, S.: Approximation schemes for sequential posted pricing in multi-unit auctions. In: Saberi, A. (ed.) WINE 2010. LNCS, vol. 6484, pp. 158–169. Springer, Heidelberg (2010). https://doi.org/10.1007/978-3-642-17572-5_13
Chou, P.-W., Maturana, D., Scherer, S.: Improving stochastic policy gradients in continuous control with deep reinforcement learning using the beta distribution. In: Proceedings of the 34th International Conference on Machine Learning, pp. 834–843. PMLR (2017)
Cooper, G., Herskovits, E.: A bayesian method for the induction of probabilistic networks from data. Mach. Learn. 9(4), 309–347 (1992)
Coulom, R.: Efficient selectivity and backup operators in Monte-Carlo tree search. In: van den Herik, H.J., Ciancarini, P., Donkers, H.H.L.M.J. (eds.) CG 2006. LNCS, vol. 4630, pp. 72–83. Springer, Heidelberg (2007). https://doi.org/10.1007/978-3-540-75538-8_7
Despotakis, S., Ravi, R., Sayedi, A.: First-price auctions in online display advertising. J. Marketing Res. 58(5), 888–907 (2021)
Hoos, H., Stützle, T.: Stochastic local search: Foundations and applications. Elsevier (2004)
Johnson, N., Kotz, S., Balakrishnan, N.: Continuous univariate distributions, vol. 289. John Wiley and sons (1995)
Kveton, B., Mahdian, S., Muthukrishnan, S., Wen, Z., Xian, Y.: Waterfall bandits: Learning to sell ads online. arXiv preprint:1904.09404 (2019)
Muthukrishnan, S.: Ad exchanges: research issues. In: Leonardi, S. (ed.) WINE 2009. LNCS, vol. 5929, pp. 1–12. Springer, Heidelberg (2009). https://doi.org/10.1007/978-3-642-10841-9_1
Russell, S., Norvig, P.: Artificial intelligence: A modern approach. Prentice Hall (2002)
Ting, M., Grislain, N.: Maximizing net income of the auction waterfall with an abort decision tree. arXiv preprint arXiv:1809.01245 (2018)
Wang, J., Zhang, W., Yuan, S.: Display advertising with real-time bidding (RTB) and behavioural targeting. arXiv preprint arXiv:1610.03013, 2016
Zhang, W., Yuan, S., Wang, J.: Optimal real-time bidding for display advertising. In: Proceedings of the 20th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 1077–1086 (2014)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
6 Appendix
6 Appendix
Appendix A - The Pseudo-code for the Monte Carlo Tree Search Algorithm

In this Appendix, we present the pseudo-code for the MCTS proposed algorithm. As opposed to the S &S-based algorithm, here, the algorithm will adopt the neighbor waterfall with the greatest revenue potential at every iteration; not necessarily the one with the current highest revenue. From an algorithm perspective, the difference is that there are two for loops in lines 18 and 20.
Appendix B - An Example for the Data Processing Flow
Table 4 describes the data processing from raw-data (Table 4a) into a valuation matrix (Table 4c), using Algorithm 1. Table 4b is the output of row 5 in Algorithm 1. For example, rows 1 and 4 that are marked in red-bold in Table 4a are the raw data of user ‘4421AB3’ and ‘G’ with a single impression each. These two rows are converted to a vector with (at least) the two entries ‘[0.02,0.19]’ that are marked with a red-bold box in Table 4b, before the beta distribution parameters, \(Beta(\alpha =0.93,\beta =10.99)\), are estimated as marked in red-bold in Table 4c.
Rights and permissions
Copyright information
© 2022 Springer Nature Switzerland AG
About this paper
Cite this paper
Halbersberg, D., Halevi, M., Salhov, M. (2022). Search and Score-Based Waterfall Auction Optimization. In: Simos, D.E., Rasskazova, V.A., Archetti, F., Kotsireas, I.S., Pardalos, P.M. (eds) Learning and Intelligent Optimization. LION 2022. Lecture Notes in Computer Science, vol 13621. Springer, Cham. https://doi.org/10.1007/978-3-031-24866-5_27
Download citation
DOI: https://doi.org/10.1007/978-3-031-24866-5_27
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-031-24865-8
Online ISBN: 978-3-031-24866-5
eBook Packages: Computer ScienceComputer Science (R0)