Adversarial Bandits with Knapsacks

28 November 2018

Nicole Immorlica

Karthik Abinav Sankararaman

Robert Schapire

Aleksandrs Slivkins

ArXiv PDF HTML

Papers citing "Adversarial Bandits with Knapsacks"

44 / 44 papers shown

Title
Online Bidding Algorithms with Strict Return on Spend (ROS) Constraint Rahul Vaze Abhishek Sinha 63 0 0 08 Feb 2025
Bandits with Anytime Knapsacks Eray Can Elumar Cem Tekin Osman Yagan 121 0 0 30 Jan 2025
Online Learning with Vector Costs and Bandits with Knapsacks Thomas Kesselheim Sahil Singla 34 32 0 14 Oct 2020
Introduction to Online Convex Optimization Elad Hazan OffRL 90 1,922 0 07 Sep 2019
Introduction to Multi-Armed Bandits Aleksandrs Slivkins 258 999 0 15 Apr 2019
Unifying the stochastic and the adversarial Bandits with Knapsack A. Rangi M. Franceschetti Long Tran-Thanh 75 27 0 23 Oct 2018
Acceleration through Optimistic No-Regret Dynamics Jun-Kun Wang Jacob D. Abernethy 61 44 0 27 Jul 2018
Stochastic bandits robust to adversarial corruptions Thodoris Lykouris Vahab Mirrokni R. Leme AAML 73 203 0 25 Mar 2018
A Reductions Approach to Fair Classification Alekh Agarwal A. Beygelzimer Miroslav Dudík John Langford Hanna M. Wallach FaML 133 1,094 0 06 Mar 2018
More Adaptive Algorithms for Adversarial Bandits Chen-Yu Wei Haipeng Luo 79 181 0 10 Jan 2018
Preventing Fairness Gerrymandering: Auditing and Learning for Subgroup Fairness Michael Kearns Seth Neel Aaron Roth Zhiwei Steven Wu FaML 109 775 0 14 Nov 2017
Bandit Convex Optimization for Scalable and Dynamic IoT Management Tianyi Chen G. Giannakis 64 130 0 27 Jul 2017
Combinatorial Semi-Bandits with Knapsacks Karthik Abinav Sankararaman Aleksandrs Slivkins 63 48 0 23 May 2017
An Improved Parametrization and Analysis of the EXP3++ Algorithm for Stochastic and Adversarial Bandits Yevgeny Seldin Gábor Lugosi 33 92 0 20 Feb 2017
An Online Convex Optimization Approach to Dynamic Network Resource Allocation Tianyi Chen Qing Ling G. Giannakis 213 216 0 14 Jan 2017
Multidimensional Dynamic Pricing for Welfare Maximization Aaron Roth Aleksandrs Slivkins Jonathan R. Ullman Zhiwei Steven Wu 32 21 0 19 Jul 2016
Kernel-based methods for bandit convex optimization Sébastien Bubeck Ronen Eldan Y. Lee 261 165 0 11 Jul 2016
Improved Regret Bounds for Oracle-Based Adversarial Contextual Bandits Vasilis Syrgkanis Haipeng Luo A. Krishnamurthy Robert Schapire 71 42 0 01 Jun 2016
An algorithm with nearly optimal pseudo-regret for both stochastic and adversarial bandits P. Auer Chao-Kai Chiang 22 110 0 27 May 2016
Efficient Algorithms for Adversarial Contextual Learning Vasilis Syrgkanis A. Krishnamurthy Robert Schapire 75 79 0 08 Feb 2016
BISTRO: An Efficient Relaxation-Based Method for Contextual Bandits Alexander Rakhlin Karthik Sridharan OffRL 164 72 0 06 Feb 2016
Linear Contextual Bandits with Knapsacks Shipra Agrawal Nikhil R. Devanur 110 142 0 24 Jul 2015
Fast Convergence of Regularized Learning in Games Vasilis Syrgkanis Alekh Agarwal Haipeng Luo Robert Schapire 42 253 0 02 Jul 2015
An efficient algorithm for contextual bandits with knapsacks, and an extension to concave objectives Shipra Agrawal Nikhil R. Devanur Lihong Li 61 90 0 10 Jun 2015
Watch and Learn: Optimizing from Revealed Preferences Feedback Aaron Roth Jonathan R. Ullman Zhiwei Steven Wu 48 70 0 04 Apr 2015
Importance weighting without importance weights: An efficient algorithm for combinatorial semi-bandits Gergely Neu Gábor Bartók 40 36 0 17 Mar 2015
Bandit Convex Optimization: sqrt{T} Regret in One Dimension Sébastien Bubeck O. Dekel Tomer Koren Yuval Peres 67 36 0 23 Feb 2015
Resourceful Contextual Bandits Ashwinkumar Badanidiyuru John Langford Aleksandrs Slivkins 63 118 0 27 Feb 2014
Bandits with concave rewards and convex knapsacks Shipra Agrawal Nikhil R. Devanur 93 197 0 24 Feb 2014
Taming the Monster: A Fast and Simple Algorithm for Contextual Bandits Alekh Agarwal Daniel J. Hsu Satyen Kale John Langford Lihong Li Robert Schapire OffRL 192 504 0 04 Feb 2014
Optimization, Learning, and Games with Predictable Sequences Alexander Rakhlin Karthik Sridharan 57 377 0 08 Nov 2013
Dynamic Ad Allocation: Bandits with Budgets Aleksandrs Slivkins 44 26 0 01 Jun 2013
Bandits with Knapsacks Ashwinkumar Badanidiyuru Robert D. Kleinberg Aleksandrs Slivkins 66 429 0 11 May 2013
Online Learning with Predictable Sequences Alexander Rakhlin Karthik Sridharan 112 355 0 18 Aug 2012
Geometry of Online Packing Linear Programs Marco Molinaro Carnegie Mellon R. Ravi 49 75 0 26 Apr 2012
Knapsack based Optimal Policies for Budget-Limited Multi-Armed Bandits Long Tran-Thanh Archie C. Chapman A. Rogers N. Jennings 70 193 0 09 Apr 2012
Contextual Bandit Learning with Predictable Rewards Alekh Agarwal Miroslav Dudík Satyen Kale John Langford Robert Schapire OffRL 195 86 0 07 Feb 2012
Trading Regret for Efficiency: Online Convex Optimization with Long Term Constraints M. Mahdavi Rong Jin Tianbao Yang 121 261 0 25 Nov 2011
Dynamic Pricing with Limited Supply Moshe Babaioff S. Dughmi Robert D. Kleinberg Aleksandrs Slivkins 101 163 0 20 Aug 2011
Efficient Optimal Learning for Contextual Bandits Miroslav Dudík Daniel J. Hsu Satyen Kale Nikos Karampatziakis John Langford L. Reyzin Tong Zhang 115 300 0 13 Jun 2011
Minimax Policies for Combinatorial Prediction Games Jean-Yves Audibert Sébastien Bubeck Gabor Lugosi OffRL 111 81 0 24 May 2011
Contextual Bandit Algorithms with Supervised Learning Guarantees A. Beygelzimer John Langford Lihong Li L. Reyzin Robert Schapire OffRL 131 324 0 22 Feb 2010
A Dynamic Near-Optimal Algorithm for Online Linear Programming Shipra Agrawal Zizhuo Wang Yinyu Ye 85 307 0 16 Nov 2009
The on-line shortest path problem under partial monitoring Pál Benkö T. Várady L. Andor Ralph Robert Martin 325 354 0 08 Apr 2007