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.08470
  4. Cited By
Bandits with Replenishable Knapsacks: the Best of both Worlds

Bandits with Replenishable Knapsacks: the Best of both Worlds

14 June 2023
Martino Bernasconi
Matteo Castiglioni
A. Celli
Federico Fusco
ArXivPDFHTML

Papers citing "Bandits with Replenishable Knapsacks: the Best of both Worlds"

4 / 4 papers shown
Title
Bandits with Anytime Knapsacks
Bandits with Anytime Knapsacks
Eray Can Elumar
Cem Tekin
Osman Yagan
98
0
0
30 Jan 2025
Beyond Primal-Dual Methods in Bandits with Stochastic and Adversarial
  Constraints
Beyond Primal-Dual Methods in Bandits with Stochastic and Adversarial Constraints
Martino Bernasconi
Matteo Castiglioni
A. Celli
Federico Fusco
21
2
0
25 May 2024
No-Regret Algorithms in non-Truthful Auctions with Budget and ROI
  Constraints
No-Regret Algorithms in non-Truthful Auctions with Budget and ROI Constraints
Gagan Aggarwal
Giannis Fikioris
Mingfei Zhao
24
5
0
15 Apr 2024
Resourceful Contextual Bandits
Resourceful Contextual Bandits
Ashwinkumar Badanidiyuru
John Langford
Aleksandrs Slivkins
38
117
0
27 Feb 2014
1