Bandits with concave rewards and convex knapsacks

24 February 2014

Papers citing "Bandits with concave rewards and convex knapsacks"

50 / 50 papers shown

Title
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 Eray Can Elumar Cem Tekin Osman Yagan 110 0 0 30 Jan 2025
Dataset Representativeness and Downstream Task Fairness Victor A. Borza Andrew Estornell Chien-Ju Ho Bradley Malin Yevgeniy Vorobeychik 35 0 0 28 Jun 2024
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
No-Regret Algorithms in non-Truthful Auctions with Budget and ROI Constraints Gagan Aggarwal Giannis Fikioris Mingfei Zhao 40 5 0 15 Apr 2024
Fair Resource Allocation in Virtualized O-RAN Platforms Fatih Aslan Georgios Iosifidis J. Ayala-Romero A. Garcia-Saavedra Xavier Costa Pérez 35 9 0 17 Feb 2024
$α$ -Fair Contextual Bandits Siddhant Chaudhary Abhishek Sinha FaML 42 0 0 22 Oct 2023
Allocating Divisible Resources on Arms with Unknown and Random Rewards Ningyuan Chen Wenhao Li 24 0 0 28 Jun 2023
Online Learning under Adversarial Nonlinear Constraints Pavel Kolev Georg Martius Michael Muehlebach 34 7 0 06 Jun 2023
Optimal Contextual Bandits with Knapsacks under Realizability via Regression Oracles Yuxuan Han Jialin Zeng Yang Wang Yangzhen Xiang Jiheng Zhang 59 9 0 21 Oct 2022
Safe Linear Bandits over Unknown Polytopes Aditya Gangrade Tianrui Chen Venkatesh Saligrama 40 6 0 27 Sep 2022
Non-monotonic Resource Utilization in the Bandits with Knapsacks Problem Raunak Kumar Robert D. Kleinberg 23 13 0 24 Sep 2022
A Unifying Framework for Online Optimization with Long-Term Constraints Matteo Castiglioni A. Celli A. Marchesi Giulia Romano N. Gatti 25 34 0 15 Sep 2022
Enabling Long-term Fairness in Dynamic Resource Allocation T. Si Salem Georgios Iosifidis Giovanni Neglia 27 18 0 11 Aug 2022
Online Contextual Decision-Making with a Smart Predict-then-Optimize Method Heyuan Liu Paul Grigas 27 8 0 15 Jun 2022
Stochastic Conservative Contextual Linear Bandits Jiabin Lin Xian Yeow Lee Talukder Jubery Shana Moothedath Soumik Sarkar Baskar Ganapathysubramanian 16 7 0 29 Mar 2022
Bilateral Trade: A Regret Minimization Perspective Nicolò Cesa-Bianchi Tommaso Cesari Roberto Colomboni Federico Fusco S. Leonardi 43 21 0 08 Sep 2021
Bandit Algorithms for Precision Medicine Yangyi Lu Ziping Xu Ambuj Tewari 66 11 0 10 Aug 2021
A Lyapunov-Based Methodology for Constrained Optimization with Bandit Feedback Semih Cayci Yilin Zheng A. Eryilmaz 26 10 0 09 Jun 2021
Bandit based centralized matching in two-sided markets for peer to peer lending Soumajyoti Sarkar 15 0 0 06 May 2021
Joint Online Learning and Decision-making via Dual Mirror Descent Alfonso Lobos Paul Grigas Zheng Wen 21 11 0 20 Apr 2021
A Regret Analysis of Bilateral Trade Nicolò Cesa-Bianchi Tommaso Cesari Roberto Colomboni Federico Fusco S. Leonardi 42 20 0 16 Feb 2021
The Symmetry between Arms and Knapsacks: A Primal-Dual Approach for Bandits with Knapsacks Xiaocheng Li Chunlin Sun Yinyu Ye 16 21 0 12 Feb 2021
Provably Efficient Algorithms for Multi-Objective Competitive RL Tiancheng Yu Yi Tian J.N. Zhang S. Sra 32 20 0 05 Feb 2021
Online Learning with Vector Costs and Bandits with Knapsacks Thomas Kesselheim Sahil Singla 17 32 0 14 Oct 2020
Fast Learning for Renewal Optimization in Online Task Scheduling M. Neely 10 13 0 18 Jul 2020
Group-Fair Online Allocation in Continuous Time Semih Cayci Swati Gupta A. Eryilmaz FaML 32 19 0 11 Jun 2020
Contextual Blocking Bandits Soumya Basu Orestis Papadigenopoulos Constantine Caramanis Sanjay Shakkottai 35 20 0 06 Mar 2020
Exploration-Exploitation in Constrained MDPs Yonathan Efroni Shie Mannor Matteo Pirotta 33 171 0 04 Mar 2020
Budget-Constrained Bandits over General Cost and Reward Distributions Semih Cayci A. Eryilmaz R. Srikant 6 31 0 29 Feb 2020
Online Linear Programming: Dual Convergence, New Algorithms, and Regret Bounds Xiaocheng Li Yinyu Ye 31 66 0 12 Sep 2019
Constrained Thompson Sampling for Wireless Link Optimization Vidit Saxena Joseph E. Gonzalez Ion Stoica H. Tullberg Joakim Jaldén 11 7 0 28 Feb 2019
Meta Dynamic Pricing: Transfer Learning Across Experiments Hamsa Bastani D. Simchi-Levi Ruihao Zhu 37 88 0 28 Feb 2019
Optimal Data Driven Resource Allocation under Multi-Armed Bandit Observations A. Burnetas Odysseas Kanavetas M. Katehakis 25 1 0 30 Nov 2018
Unifying the stochastic and the adversarial Bandits with Knapsack A. Rangi M. Franceschetti Long Tran-Thanh 18 26 0 23 Oct 2018
Inventory Balancing with Online Learning Wang Chi Cheung Will Ma D. Simchi-Levi Xinshang Wang 21 16 0 11 Oct 2018
The Online Saddle Point Problem and Online Convex Optimization with Knapsacks Adrian Rivera Cardoso He Wang Huan Xu 40 11 0 21 Jun 2018
Multi-scale Online Learning and its Applications to Online Auctions Sébastien Bubeck Nikhil R. Devanur Zhiyi Huang Rad Niazadeh 15 39 0 26 May 2017
Combinatorial Semi-Bandits with Knapsacks Karthik Abinav Sankararaman Aleksandrs Slivkins 33 48 0 23 May 2017
Assortment Optimization under Unknown MultiNomial Logit Choice Models Wang Chi Cheung D. Simchi-Levi 28 15 0 01 Apr 2017
Fast Rates for Bandit Optimization with Upper-Confidence Frank-Wolfe Quentin Berthet Vianney Perchet 36 31 0 22 Feb 2017
Dynamic Pricing in High-dimensions Adel Javanmard Hamid Nazerzadeh 76 138 0 24 Sep 2016
Asymptotically Optimal Algorithms for Budgeted Multiple Play Bandits Alexander Luedtke E. Kaufmann Antoine Chambaz 21 7 0 30 Jun 2016
Linear Contextual Bandits with Knapsacks Shipra Agrawal Nikhil R. Devanur 43 142 0 24 Jul 2015
An efficient algorithm for contextual bandits with knapsacks, and an extension to concave objectives Shipra Agrawal Nikhil R. Devanur Lihong Li 30 90 0 10 Jun 2015
An Incentive Compatible Multi-Armed-Bandit Crowdsourcing Mechanism with Quality Assurance Shweta Jain Sujit Gujar Satyanath Bhat O. Zoeter Y. Narahari 39 6 0 27 Jun 2014
Adaptive Contract Design for Crowdsourcing Markets: Bandit Algorithms for Repeated Principal-Agent Problems Chien-Ju Ho Aleksandrs Slivkins Jennifer Wortman Vaughan 49 143 0 12 May 2014
Resourceful Contextual Bandits Ashwinkumar Badanidiyuru John Langford Aleksandrs Slivkins 45 117 0 27 Feb 2014
Bandits and Experts in Metric Spaces Robert D. Kleinberg Aleksandrs Slivkins E. Upfal 49 120 0 04 Dec 2013
Blackwell Approachability and Low-Regret Learning are Equivalent Jacob D. Abernethy Peter L. Bartlett Elad Hazan 86 117 0 08 Nov 2010