Bandits with Knapsacks

DOI10.1145/3164539zbMath1425.68340arXiv1305.2545OpenAlexW2790607499MaRDI QIDQ4561500

Ashwinkumar Badanidiyuru, Aleksandrs Slivkins, Robert D. Kleinberg

Publication date: 6 December 2018

Published in: Journal of the ACM (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1305.2545

zbMATH Keywords

dynamic pricingknapsack constraintsmulti-armed bandits

Mathematics Subject Classification ID

Related Items (17)

Online Assortment and Market Segmentation under Bertrand Competition with Set-Dependent Revenues ⋮ Contextual Search via Intrinsic Volumes ⋮ Online Resource Allocation with Personalized Learning ⋮ Unnamed Item ⋮ ASYMPTOTICALLY OPTIMAL MULTI-ARMED BANDIT POLICIES UNDER A COST CONSTRAINT ⋮ Constrained regret minimization for multi-criterion multi-armed bandits ⋮ Per-Round Knapsack-Constrained Linear Submodular Bandits ⋮ Dynamic pricing with finite price sets: a non-parametric approach ⋮ Unnamed Item ⋮ Nonparametric Self-Adjusting Control for Joint Learning and Optimization of Multiproduct Pricing with Finite Resource Capacity ⋮ Bayesian Incentive-Compatible Bandit Exploration ⋮ Unnamed Item ⋮ Technical Note—Joint Learning and Optimization of Multi-Product Pricing with Finite Resource Capacity and Unknown Demand Parameters ⋮ Asymptotically optimal algorithms for budgeted multiple play bandits ⋮ Online Allocation and Pricing: Constant Regret via Bellman Inequalities ⋮ Unnamed Item ⋮ Unnamed Item

This page was built for publication: Bandits with Knapsacks