상세 보기
Multi-Agent Reinforcement Learning for a Multichannel Uplink Random Access: Congestion Game Perspective
- Zhao, Yu;
- Lee, Joohyun;
- Seo, Jun-Bae
Citations
WEB OF SCIENCE
0Citations
SCOPUS
3초록
In this paper, we propose a time-slotted multichannel uplink random access (RA) game model where players do not cooperate. We first analyze its sum throughput from the congestion game (CG) perspective and obtain the pure strategy Nash equilibria (PNEs) that fully utilize each slot. Then, we propose an Upper Confidence Bound (UCB)-based multi-agent reinforcement learning (MARL) algorithm to realize the PNEs, where UCB is one of the multi-armed bandit algorithms that work by assigning a confidence level for each action. Finally, via simulation, we show that our proposed algorithm can obtain near-optimal average sum throughput in the long run. © 2023 IEEE.
키워드
congestion game; Multi-armed bandit; nash equilibrium; random access; reinforcement learning
- 제목
- Multi-Agent Reinforcement Learning for a Multichannel Uplink Random Access: Congestion Game Perspective
- 저자
- Zhao, Yu; Lee, Joohyun; Seo, Jun-Bae
- 발행일
- 2023-11
- 유형
- Conference paper
- 저널명
- Proceedings of 2023 12th International Conference on Awareness Science and Technology, iCAST 2023
- 페이지
- 156 ~ 160