ResearchTrend.AI
  • Communities
  • Connect sessions
  • AI calendar
  • Organizations
  • Join Slack
  • Contact Sales
Papers
Communities
Social Events
Terms and Conditions
Pricing
Contact Sales
Parameter LabParameter LabTwitterGitHubLinkedInBlueskyYoutube

© 2026 ResearchTrend.AI, All rights reserved.

  1. Home
  2. Papers
  3. 2012.13380
  4. Cited By
A Regret bound for Non-stationary Multi-Armed Bandits with Fairness
  Constraints

A Regret bound for Non-stationary Multi-Armed Bandits with Fairness Constraints

24 December 2020
Ranga Shaarad Ayyagari
Ambedkar Dukkipati
    FaML
ArXiv (abs)PDFHTML

Papers citing "A Regret bound for Non-stationary Multi-Armed Bandits with Fairness Constraints"

1 / 1 papers shown
Fairness and Privacy Guarantees in Federated Contextual Bandits
Fairness and Privacy Guarantees in Federated Contextual BanditsAdaptive Agents and Multi-Agent Systems (AAMAS), 2024
Sambhav Solanki
Shweta Jain
Sujit Gujar
FedML
243
2
0
05 Feb 2024
1
Page 1 of 1