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. 2002.00253
  4. Cited By
Bandits with Knapsacks beyond the Worst-Case

Bandits with Knapsacks beyond the Worst-Case

1 February 2020
Karthik Abinav Sankararaman
Aleksandrs Slivkins
ArXivPDFHTML

Papers citing "Bandits with Knapsacks beyond the Worst-Case"

16 / 16 papers shown
Title
The Symmetry between Arms and Knapsacks: A Primal-Dual Approach for
  Bandits with Knapsacks
The Symmetry between Arms and Knapsacks: A Primal-Dual Approach for Bandits with Knapsacks
Xiaocheng Li
Chunlin Sun
Yinyu Ye
48
22
0
12 Feb 2021
Online Allocation and Pricing: Constant Regret via Bellman Inequalities
Online Allocation and Pricing: Constant Regret via Bellman Inequalities
Alberto Vera
Siddhartha Banerjee
I. Gurvich
OffRL
41
50
0
14 Jun 2019
Adversarial Bandits with Knapsacks
Adversarial Bandits with Knapsacks
Nicole Immorlica
Karthik Abinav Sankararaman
Robert Schapire
Aleksandrs Slivkins
144
114
0
28 Nov 2018
Unifying the stochastic and the adversarial Bandits with Knapsack
Unifying the stochastic and the adversarial Bandits with Knapsack
A. Rangi
M. Franceschetti
Long Tran-Thanh
132
28
0
23 Oct 2018
MNL-Bandit: A Dynamic Learning Approach to Assortment Selection
MNL-Bandit: A Dynamic Learning Approach to Assortment Selection
Shipra Agrawal
Vashist Avadhanula
Vineet Goyal
A. Zeevi
131
158
0
13 Jun 2017
Combinatorial Semi-Bandits with Knapsacks
Combinatorial Semi-Bandits with Knapsacks
Karthik Abinav Sankararaman
Aleksandrs Slivkins
65
49
0
23 May 2017
Efficient Learning in Large-Scale Combinatorial Semi-Bandits
Efficient Learning in Large-Scale Combinatorial Semi-Bandits
Zheng Wen
Branislav Kveton
Azin Ashkan
OffRL
165
96
0
28 Jun 2014
Matroid Bandits: Fast Combinatorial Optimization with Learning
Matroid Bandits: Fast Combinatorial Optimization with Learning
Branislav Kveton
Zheng Wen
Azin Ashkan
Hoda Eydgahi
Brian Eriksson
74
119
0
20 Mar 2014
Resourceful Contextual Bandits
Resourceful Contextual Bandits
Ashwinkumar Badanidiyuru
John Langford
Aleksandrs Slivkins
77
119
0
27 Feb 2014
Bandits with concave rewards and convex knapsacks
Bandits with concave rewards and convex knapsacks
Shipra Agrawal
Nikhil R. Devanur
122
199
0
24 Feb 2014
Bandits and Experts in Metric Spaces
Bandits and Experts in Metric Spaces
Robert D. Kleinberg
Aleksandrs Slivkins
E. Upfal
158
124
0
04 Dec 2013
Bandits with Knapsacks
Bandits with Knapsacks
Ashwinkumar Badanidiyuru
Robert D. Kleinberg
Aleksandrs Slivkins
88
430
0
11 May 2013
Knapsack based Optimal Policies for Budget-Limited Multi-Armed Bandits
Knapsack based Optimal Policies for Budget-Limited Multi-Armed Bandits
Long Tran-Thanh
Archie C. Chapman
A. Rogers
N. Jennings
100
193
0
09 Apr 2012
Dynamic Pricing with Limited Supply
Dynamic Pricing with Limited Supply
Moshe Babaioff
S. Dughmi
Robert D. Kleinberg
Aleksandrs Slivkins
114
163
0
20 Aug 2011
A Finite-Time Analysis of Multi-armed Bandits Problems with
  Kullback-Leibler Divergences
A Finite-Time Analysis of Multi-armed Bandits Problems with Kullback-Leibler Divergences
Odalric-Ambrym Maillard
Rémi Munos
Gilles Stoltz
90
146
0
29 May 2011
The KL-UCB Algorithm for Bounded Stochastic Bandits and Beyond
The KL-UCB Algorithm for Bounded Stochastic Bandits and Beyond
Aurélien Garivier
Olivier Cappé
166
612
0
12 Feb 2011
1