Optimizing Advertising Efficacy: Implementing Cost-Effective Multi-Armed Bandit Algorithms
DOI:
https://doi.org/10.54097/tey73e61Keywords:
Online Advertising; Multi-armed Bandit; Cost-Efficiency; No-Budget Advertising.Abstract
This paper proposes a novel approach of multi-armed bandit (MAB) algorithms for online advertising across multiple platforms with no budget limitation. The study adapts the application of two algorithms, Cost-Subsidized Upper Confidence Bound Bandit (CS-UCB) and Cost-aware Cascading Upper Confidence Bound Bandit (CC-UCB), with the objective to maximize the click-through rate (CTR) while considering cost efficiency. Departing from traditional budget-constrained models such as Bandits with Knapsacks (BwK), this study assumes a competitive advertising environment where market share and ad exposure are prioritized over strict budget adherence and cost control. It provides advertisers flexibility in cost control, maximizing CTR within the bounds of acceptable cost concessions, balancing the dual objectives of minimize quality regret and cost regret. The introduction of this novel appraoch extends the application of Multi-Armed Bandit (MAB) algorithms to advertising strategies in highly competitive markets without budget constraints. This study analysises the performance of both CC-UCB and CS-UCB algorithms with empricial research by using real-world data, showing online advertisements bidding strategies from multiple ad platforms in real-time bidding (RTB) system.
Downloads
References
Statista. (2022). Online advertising revenue in the United States from 2000 to 2022. Retrieved from https://www.statista.com/statistics/183816/us-online-advertising-revenue-since-2000/.
Choi, H., Mela, C. F., Balseiro, S. R., et al. (2020). Online display advertising markets: A literature review and future directions. Information Systems Research, 31(2), 556-575.
Conitzer, V., Kroer, C., Sodomka, E., et al. (2022). Multiplicative pacing equilibria in auction markets. Operations Research, 70(2), 963-989.
Waisman, C., Nair, H. S., Carrion, C. (2019). Online causal inference for advertising in real-time bidding auctions. arXiv preprint arXiv:1908.08600.
Haoyu, Z., Wei, C. (2020). Online second price auction with semi-bandit feedback under the non-stationary setting. Proceedings of the AAAI Conference on Artificial Intelligence, 34(04), 6893-6900.
Chen, Z., Wang, C., Wang, Q., et al. (2022). Dynamic budget throttling in repeated second-price auctions. arXiv preprint arXiv:2207.04690.
Badanidiyuru, A., Langford, J., Slivkins, A. (2014). Resourceful contextual bandits. Conference on Learning Theory. PMLR, 1109-1134.
Badanidiyuru, A., Kleinberg, R., Slivkins, A. (2018). Bandits with knapsacks. Journal of the ACM (JACM), 65(3), 1-55.
Sankararaman, K. A., Slivkins, A. (2021). Bandits with knapsacks beyond the worst case. Advances in Neural Information Processing Systems, 34, 23191-23204.
Avadhanula, V., Colini Baldeschi, R., Leonardi, S., et al. (2021). Stochastic bandits for multi-platform budget optimization in online advertising. Proceedings of the Web Conference 2021, 2805-2817.
Susan, F., Golrezaei, N., Schrijvers, O. (2023). Multi-Platform Budget Management in Ad Markets with Non-IC Auctions. arXiv preprint arXiv:2306.07352.
Celli, A., Colini-Baldeschi, R., Kroer, C., et al. (2022). The parity ray regularizer for pacing in auction markets. Proceedings of the ACM Web Conference 2022, 162-172.
Gaitonde, J., Li, Y., Light, B., et al. (2022). Budget pacing in repeated auctions: Regret and efficiency without convergence. arXiv preprint arXiv:2205.08674.
Robbins, H. (1952). Some aspects of the sequential design of experiments.
Zhu, X., Zhao, Z., Wei, X., & others. (2021). Action recognition method based on wavelet transform and neural network in wireless network. In 2021 5th International Conference on Digital Signal Processing (pp. 60-65).
Kveton, B., Szepesvari, C., Wen, Z., et al. (2015). Cascading bandits: Learning to rank in the cascade model. International conference on machine learning. PMLR, 767-776.
Gan, C., Zhou, R., Yang, J., et al. (2020). Cost-aware cascading bandits. IEEE Transactions on Signal Processing, 68, 3692-3706.
Liao, H., Peng, L., Liu, Z., et al. (2014). iPinYou global rtb bidding algorithm competition dataset. Proceedings of the Eighth International Workshop on Data Mining for Online Advertising, 1-6.
Downloads
Published
Issue
Section
License
Copyright (c) 2024 Highlights in Science, Engineering and Technology
This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.
