Fair Probabilistic Multi-Armed Bandit With Applications to Network Optimization
Online learning, particularly Multi-Armed Bandit (MAB) algorithms, has been extensively adopted in various real-world networking applications. In certain applications, such as fair heterogeneous networks coexistence, multiple links (individual arms) are selected in each round, and the throughputs (r...
Saved in:
| Main Authors: | Zhiwu Guo, Chicheng Zhang, Ming Li, Marwan Krunz |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
IEEE
2024-01-01
|
| Series: | IEEE Transactions on Machine Learning in Communications and Networking |
| Subjects: | |
| Online Access: | https://ieeexplore.ieee.org/document/10579843/ |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
Adaptive Noise Exploration for Neural Contextual Multi-Armed Bandits
by: Chi Wang, et al.
Published: (2025-01-01) -
Causal contextual bandits with one-shot data integration
by: Chandrasekar Subramanian, et al.
Published: (2024-12-01) -
Multi-Dimensional Arms for Combinatorial Multi-Armed Bandit
by: Qi Li, et al.
Published: (2025-01-01) -
Research on the generalized utility max-min fair algorithm based on piecewise linear function
by: XU Tong, et al.
Published: (2006-01-01) -
Max–Min Share-Based Mechanism for Multi-Resource Fair Allocation with Bounded Number of Tasks in Cloud Computing System
by: Jie Li, et al.
Published: (2025-07-01)