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. 2306.12774
  4. Cited By
Pure Exploration in Bandits with Linear Constraints

Pure Exploration in Bandits with Linear Constraints

22 June 2023
Emil Carlsson
Debabrota Basu
Fredrik D. Johansson
Devdatt Dubhashi
ArXivPDFHTML

Papers citing "Pure Exploration in Bandits with Linear Constraints"

4 / 4 papers shown
Title
Improved Regret Bounds for Online Fair Division with Bandit Learning
Improved Regret Bounds for Online Fair Division with Bandit Learning
Benjamin G. Schiffer
Shirley Zhang
41
0
0
13 Jan 2025
Honor Among Bandits: No-Regret Learning for Online Fair Division
Honor Among Bandits: No-Regret Learning for Online Fair Division
Ariel D. Procaccia
Benjamin Schiffer
Shirley Zhang
FaML
29
2
0
01 Jul 2024
Safe Linear Bandits over Unknown Polytopes
Safe Linear Bandits over Unknown Polytopes
Aditya Gangrade
Tianrui Chen
Venkatesh Saligrama
38
6
0
27 Sep 2022
Safe Exploration in Markov Decision Processes
Safe Exploration in Markov Decision Processes
T. Moldovan
Pieter Abbeel
78
308
0
22 May 2012
1