Research Article
Open access
Published on 8 November 2024
Download pdf
Fu,L. (2024). Exploring the efficacy of Multi-Armed Bandit Algorithms in dynamic decision-making. Applied and Computational Engineering,93,141-148.
Export citation

Exploring the efficacy of Multi-Armed Bandit Algorithms in dynamic decision-making

Lai Fu *,1,
  • 1 Department of Computer Science, Hangzhou Dianzi University, Hangzhou, China

* Author to whom correspondence should be addressed.

https://doi.org/10.54254/2755-2721/93/20240942

Abstract

Originating from the scenario of gambling machines in casinos, the Multi-Armed Bandit problem aims to optimize decision-making processes under limited resources to achieve maximum returns. This article delves into the principles, classifications, and practical applications of this problem. Researchers have proposed various algorithms to address this issue, including ε-greedy, Upper Confidence Bound, and Thompson Sampling, which have demonstrated good performance across different scenarios. The article further elaborates on the fundamental principles of Multi-Armed Bandit algorithms, encompassing the trade-off between exploration and exploitation, and provides a detailed classification of algorithms based on probability (e.g., ε-greedy) and value (e.g., UCB). These algorithms not only provide a framework for addressing real-world problems such as advertisement placement and resource allocation, but also possess significant theoretical value in the fields of machine learning and reinforcement learning. By balancing exploration and exploitation, Multi-Armed Bandit algorithms offer effective tools for making optimal decisions in uncertain environments, thus driving the development of related fields.

Keywords

Multi-Armed Bandit, ε-greedy Strategy, reinforcement learning, machine learning.

[1]. Kumar A B ,Hrishikesh D ,Subir B .2023.Federated Multi-Armed Bandit Learning for Caching in UAV-aided Content Dissemination[J].Ad Hoc Networks,151

[2]. Hiba D ,Raphaël F ,Nadège V , et al.2023.Massive multi-player multi-armed bandits for IoT networks: An application on LoRa networks[J].Ad Hoc Networks, 151

[3]. Jian D ,Xuan L ,Shuang Q , et al.2023.Spectrum Allocation and User Scheduling Based on Combinatorial Multi-Armed Bandit for 5G Massive MIMO.[J].Sensors (Basel, Switzerland), 23(17)

[4]. Runqi W ,Linlin Y ,Hanlin C , et al. 2023.Anti-Bandit for Neural Architecture Search[J].International Journal of Computer Vision, 131(10):2682-2698

[5]. Linxiong H ,Bin S ,Shizheng L , et al. 2023.Portfolio allocation strategy for active learning Kriging-based structural reliability analysis[J].Computer Methods in Applied Mechanics and Engineering, 412

[6]. Nicolas C ,Guillaume B ,Serge H , et al. 2020.Entangled N-photon states for fair and optimal social decision making[J].Scientific Reports, 10(1):20420-20420.

[7]. Roberto G C . 2021.A multi-armed bandit algorithm speeds up the evolution of cooperation[J].Ecological Modelling, 439109348-.

[8]. Carrascosa M ,Bellalta B . 2019.Decentralized AP selection using Multi-Armed Bandits: Opportunistic ε-Greedy with Stickiness.[J].CoRR, abs/1903.00281

[9]. Kojima F ,Usami T ,Duong T N . 2007.Identification of Stress Corrosion Cracking Profiles Using ε-Greedy Search Inverse Analysis in Eddy Current Testing[J].Proceedings of the ISCIE International Symposium on Stochastic Systems Theory and its Applications, 2007(0):118-123.

[10]. Wijith M ,Sven S ,Anthony T , et al. 2016.Effect of veliparib (ABT-888) on cardiac repolarization in patients with advanced solid tumors: a randomized, placebo-controlled crossover study.[J].Cancer chemotherapy and pharmacology, 78(5):1003-1011.

[11]. Liu Y ,Tsuruoka Y . 2016.Modification of improved upper confidence bounds for regulating exploration in Monte-Carlo tree search[J].Theoretical Computer Science, 64492-105.

[12]. Honghan Y ,Xiaochen X ,C. R J C , et al. 2023.Online nonparametric monitoring of heterogeneous data streams with partial observations based on Thompson sampling[J].IISE Transactions, 55(4):392-404.

[13]. Darak J S ,Zhang H ,Palicot J , et al. 2017.Decision making policy for RF energy harvesting enabled cognitive radios in decentralized wireless networks[J].Digital Signal Processing, 6033-45.

[14]. Sengupta S . 2015.Comparisons of sampling strategies for estimating finite population proportions in direct and randomized response surveys under a super population model[J].Model Assisted Statistics and Applications, 10(4):385-390.

[15]. Ortega A P ,Braun A D . 2014.Generalized Thompson sampling for sequential decision-making and causal inference[J].Complex Adaptive Systems Modeling, 2(1):1-23.

[16]. Alagumani S ,Natarajan M U . 2024.Q-learning and fuzzy logic multi-tier multi-access edge clustering for 5g v2x communication.[J].Network (Bristol, England), 21-24.

[17]. Zhang L ,Wu J ,Liu C , et al. 2024.A novel control strategy of automatic parallel parking system based on Q-learning[J].Proceedings of the Institution of Mechanical Engineers, Part D: Journal of Automobile Engineering, 238(4):661-673.

[18]. Hu Y ,Li W ,Luo Q . 2024.Real-Time Adjustment Method for Metro Systems with Train Delays Based on Improved Q-Learning[J].Applied Sciences, 14(4):

[19]. Ma H ,Zhang H ,Tian D , et al. 2024.Optimal demand response based dynamic pricing strategy via Multi-Agent Federated Twin Delayed Deep Deterministic policy gradient algorithm[J].Engineering Applications of Artificial Intelligence, 133(PA):108012-.

[20]. Lyu B ,Yang Y ,Cao Y , et al. 2024.Efficient multi-objective neural architecture search framework via policy gradient algorithm[J].Information Sciences, 661120186-.

[21]. Multi-Objective Optimization of Vehicle-Following Control for Connected Electric Vehicles Based on Deep Deterministic Policy Gradient[J].SAE International Journal of Electrified Vehicles,2023,13(1):

[22]. David D ,Javier G ,Á. M S . 2023.Twin-delayed deep deterministic policy gradient algorithm for the energy management of microgrids[J].Engineering Applications of Artificial Intelligence, 125

[23]. Xiaohui H ,Xiong Z ,Jiahao L , et al. 2023.Effective credit assignment deep policy gradient multi-agent reinforcement learning for vehicle dispatch[J].Applied Intelligence, 53(20):23457-23469.

Cite this article

Fu,L. (2024). Exploring the efficacy of Multi-Armed Bandit Algorithms in dynamic decision-making. Applied and Computational Engineering,93,141-148.

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 the 2nd International Conference on Machine Learning and Automation

Conference website: https://2024.confmla.org/
ISBN:978-1-83558-627-3(Print) / 978-1-83558-628-0(Online)
Conference date: 21 November 2024
Editor:Mustafa ISTANBULLU, Xinqing Xiao
Series: Applied and Computational Engineering
Volume number: Vol.93
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).