Research Article
Open access
Published on 27 September 2024
Download pdf
Jiang,C. (2024). Optimizing online advertising with muti-armed bandit algorithms. Applied and Computational Engineering,83,52-61.
Export citation

Optimizing online advertising with muti-armed bandit algorithms

Chenyan Jiang *,1,
  • 1 Hefei University of Technology, Hefei, Anhui, 230002, China

* Author to whom correspondence should be addressed.

https://doi.org/10.54254/2755-2721/83/2024GLG0063

Abstract

The rapid digitalization of the global economy has significantly transformed the landscape of advertising, necessitating more sophisticated and adaptive strategies to reach and engage with consumers effectively. This paper explores the application of multi-armed bandit (MAB) algorithms as a powerful tool for optimizing online advertising processes. We examine how MAB algorithms can enhance various stages of the advertising cycle, from audience segmentation and creative development to bidding strategies and real-time optimization. Through an analysis of existing literature and practical applications, we demonstrate the potential of MAB algorithms to balance the trade-offs between exploration and exploitation, enabling advertisers to maximize click-through rates, conversion rates, and return on investment. Furthermore, we address specific challenges such as the cold-start problem and the optimization of search advertising, proposing innovative solutions that leverage the adaptive capabilities of MAB algorithms. Our findings suggest that integrating MAB algorithms into online advertising strategies can significantly improve targeting accuracy, user engagement, and overall advertising performance. We conclude by discussing the implications of these findings and suggesting directions for future research to further enhance the application of MAB algorithms in the evolving digital advertising landscape.

Keywords

Online advertising, multi-armed bandit algorithms, reinforcement learning, optimization

[1]. Kraus S,Jones P,Kailer N,Weinmann A,Chaparro-Banegas N and Roig-Tierno N 2021 Digital transformation:an overview of the current state of the art of research. Sage Open 11(3):21582440211047576

[2]. Zhang S 2024 Utilizing reinforcement learning bandit algorithms in advertising optimization. Highlights in Science, Engineering and Technology. 94:pp 195-200.

[3]. Baardman L,Fata E,Pani A and Perakis G 2019 Learning optimal online advertising portfolios with periodic budgets. Available at SSRN 3346642.

[4]. Qiu R,Ji W 2021 An embedded bandit algorithm based on agent evolution for cold-start problem. Int J Crowd Sci. 5(3):228–38.

[5]. Xu M,Qin T and Liu TY 2013 Estimation bias in multi-armed bandit algorithms for search advertising. Adv Neural Inf Process Syst. 26.

[6]. Gutowski N, Amghar T, Camp O and Chhel F 2021 Gorthaur-exp3: bandit-based selection from a portfolio of recommendation algorithms balancing the accuracy-diversity dilemma. Inf Sci. 546:378–96.

[7]. Bonalumi M 2022 An online learning algorithm for real-time bidding.

[8]. Liu B 2023 Based on intelligent advertising recommendation and abnormal advertising monitoring system in the field of machine learning. Int J Comput Sci Inf Technol. 1(1):17–23.

[9]. Schwartz EM,Bradlow ET and Fader PS 2017 Customer acquisition via display advertising using multi-armed bandit experiments. Mark Sci.36(4):500–22.

[10]. Yang H and Lu Q 2016 Dynamic contextual multi-arm bandits in display advertisement. In: 2016 IEEE 16th International Conference on Data Mining (ICDM). p. 1305–10.

[11]. Nuara A 2020 Machine learning algorithms for the optimization of internet advertising campaigns.

[12]. Mussi M 2023 Online learning methods for pricing and advertising.

Cite this article

Jiang,C. (2024). Optimizing online advertising with muti-armed bandit algorithms. Applied and Computational Engineering,83,52-61.

Data availability

The datasets used and/or analyzed during the current study will be available from the authors upon reasonable request.

Disclaimer/Publisher's Note

The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of EWA Publishing and/or the editor(s). EWA Publishing and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content.

About volume

Volume title: Proceedings of CONF-MLA 2024 Workshop: Semantic Communication Based Complexity Scalable Image Transmission System for Resource Constrained Devices

Conference website: https://2024.confmla.org/
ISBN:978-1-83558-567-2(Print) / 978-1-83558-568-9(Online)
Conference date: 21 November 2024
Editor:Mustafa ISTANBULLU, Anil Fernando
Series: Applied and Computational Engineering
Volume number: Vol.83
ISSN:2755-2721(Print) / 2755-273X(Online)

© 2024 by the author(s). Licensee EWA Publishing, Oxford, UK. This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution (CC BY) license. Authors who publish this series agree to the following terms:
1. Authors retain copyright and grant the series right of first publication with the work simultaneously licensed under a Creative Commons Attribution License that allows others to share the work with an acknowledgment of the work's authorship and initial publication in this series.
2. Authors are able to enter into separate, additional contractual arrangements for the non-exclusive distribution of the series's published version of the work (e.g., post it to an institutional repository or publish it in a book), with an acknowledgment of its initial publication in this series.
3. Authors are permitted and encouraged to post their work online (e.g., in institutional repositories or on their website) prior to and during the submission process, as it can lead to productive exchanges, as well as earlier and greater citation of published work (See Open access policy for details).