ResearchTrend.AI
  • Papers
  • Communities
  • Events
  • Blog
  • Pricing
Papers
Communities
Social Events
Terms and Conditions
Pricing
Parameter LabParameter LabTwitterGitHubLinkedInBlueskyYoutube

© 2025 ResearchTrend.AI, All rights reserved.

  1. Home
  2. Papers
  3. 2209.11817
  4. Cited By
An Efficient Algorithm for Fair Multi-Agent Multi-Armed Bandit with Low
  Regret

An Efficient Algorithm for Fair Multi-Agent Multi-Armed Bandit with Low Regret

23 September 2022
Matthew D. Jones
Huy Le Nguyen
Thy Nguyen
    FaML
ArXivPDFHTML

Papers citing "An Efficient Algorithm for Fair Multi-Agent Multi-Armed Bandit with Low Regret"

4 / 4 papers shown
Title
Bandit Max-Min Fair Allocation
Bandit Max-Min Fair Allocation
Tsubasa Harada
Shinji Ito
Hanna Sumita
56
0
0
08 May 2025
Multi-agent Multi-armed Bandits with Minimum Reward Guarantee Fairness
Multi-agent Multi-armed Bandits with Minimum Reward Guarantee Fairness
Piyushi Manupriya
Himanshu
S. Jagarlapudi
Ganesh Ghalme
FaML
59
0
0
24 Feb 2025
Fairness Aware Reinforcement Learning via Proximal Policy Optimization
Fairness Aware Reinforcement Learning via Proximal Policy Optimization
Gabriele La Malfa
Jie M. Zhang
Michael Luck
Elizabeth Black
73
0
0
06 Feb 2025
Kernel-based methods for bandit convex optimization
Kernel-based methods for bandit convex optimization
Sébastien Bubeck
Ronen Eldan
Y. Lee
86
164
0
11 Jul 2016
1