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. 2304.05219
  4. Cited By
BanditQ: Fair Bandits with Guaranteed Rewards

BanditQ: Fair Bandits with Guaranteed Rewards

11 April 2023
Abhishek Sinha
    FaML
ArXivPDFHTML

Papers citing "BanditQ: Fair Bandits with Guaranteed Rewards"

5 / 5 papers shown
Title
Fair Algorithms for Multi-Agent Multi-Armed Bandits
Fair Algorithms for Multi-Agent Multi-Armed Bandits
Safwan Hossain
Evi Micha
Nisarg Shah
FaML
32
48
0
13 Jul 2020
Stochastic One-Sided Full-Information Bandit
Stochastic One-Sided Full-Information Bandit
Haoyu Zhao
Wei Chen
34
8
0
20 Jun 2019
Combinatorial Sleeping Bandits with Fairness Constraints
Combinatorial Sleeping Bandits with Fairness Constraints
Fengjiao Li
Jia-Wei Liu
Bo Ji
47
161
0
15 Jan 2019
Online Convex Optimization with Stochastic Constraints
Online Convex Optimization with Stochastic Constraints
Hao Yu
M. Neely
Xiaohan Wei
63
223
0
12 Aug 2017
Bandits with Knapsacks
Bandits with Knapsacks
Ashwinkumar Badanidiyuru
Robert D. Kleinberg
Aleksandrs Slivkins
85
430
0
11 May 2013
1