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. 2205.12427
  4. Cited By
Non-stationary Bandits with Knapsacks

Non-stationary Bandits with Knapsacks

25 May 2022
Shang Liu
Jiashuo Jiang
Xiaocheng Li
ArXivPDFHTML

Papers citing "Non-stationary Bandits with Knapsacks"

6 / 6 papers shown
Title
Adaptive Bidding Policies for First-Price Auctions with Budget Constraints under Non-stationarity
Adaptive Bidding Policies for First-Price Auctions with Budget Constraints under Non-stationarity
Yige Wang
Jiashuo Jiang
32
0
0
05 May 2025
A New Benchmark for Online Learning with Budget-Balancing Constraints
A New Benchmark for Online Learning with Budget-Balancing Constraints
M. Braverman
Jingyi Liu
Jieming Mao
Jon Schneider
Eric Xue
60
0
0
19 Mar 2025
Bandits with Anytime Knapsacks
Bandits with Anytime Knapsacks
Eray Can Elumar
Cem Tekin
Osman Yagan
110
0
0
30 Jan 2025
Learning to Price with Resource Constraints: From Full Information to Machine-Learned Prices
Learning to Price with Resource Constraints: From Full Information to Machine-Learned Prices
Ruicheng Ao
Jiashuo Jiang
D. Simchi-Levi
60
1
0
24 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
31
2
0
25 May 2024
Rectified Pessimistic-Optimistic Learning for Stochastic Continuum-armed
  Bandit with Constraints
Rectified Pessimistic-Optimistic Learning for Stochastic Continuum-armed Bandit with Constraints
Heng Guo
Qi Zhu
Xin Liu
29
11
0
27 Nov 2022
1