Adversarial bandits with knapsacks

DOI10.1145/3557045MaRDI QIDQ6551256FDOQ6551256

Authors: Nicole Immorlica, Karthik Abinav Sankararaman, Robert E. Schapire, Aleksandrs Slivkins 

Publication date: 6 June 2024

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

zbMATH Keywords

competitive ratioregretmulti-armed banditsprimal-dual algorithmsadversarial banditsbandits with knapsacks

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Online algorithms; streaming algorithms (68W27) Applications of mathematical programming (90C90) Applications of game theory (91A80)

Cites Work

• A decision-theoretic generalization of on-line learning and an application to boosting
• Title not available (Why is that?)
• Prediction, Learning, and Games
• Lectures on modern convex optimization. Analysis, algorithms, and engineering applications
• The design of approximation algorithms
• Approximation algorithms for combinatorial problems
• Multi-armed bandit allocation indices. With a foreword by Peter Whittle.
• The Nonstochastic Multiarmed Bandit Problem
• On the ratio of optimal integral and fractional covers
• The weighted majority algorithm
• Online convex optimization in the bandit setting: gradient descent without a gradient
• Online primal-dual algorithms for covering and packing
• AdWords and generalized online matching
• The Design of Competitive Online Algorithms via a Primal—Dual Approach
• Expander flows, geometric embeddings and graph partitioning
• Adaptive game playing using multiplicative weights
• Boosting. Foundations and algorithms.
• The multiplicative weights update method: a meta-algorithm and applications
• Electrical flows, laplacian systems, and faster approximation of maximum flow in undirected graphs
• Competitive paging algorithms
• A Dynamic Near-Optimal Algorithm for Online Linear Programming
• Online stochastic packing applied to display ad allocation
• Multi-armed Bandits with Metric Switching Costs
• Regret Analysis of Stochastic and Nonstochastic Multi-armed Bandit Problems
• Approximation Algorithms for Correlated Knapsacks and Non-martingale Bandits
• Geometry of Online Packing Linear Programs
• Online matching and ad allocation
• Dynamic pricing without knowing the demand function: risk bounds and near-optimal algorithms
• Stochastic bandits robust to adversarial corruptions
• The on-line shortest path problem under partial monitoring
• The online set cover problem
• Online Network Design Algorithms via Hierarchical Decompositions
• Introduction to Multi-Armed Bandits
• Near Optimal Online Algorithms and Fast Approximation Algorithms for Resource Allocation Problems
• Close the gaps: a learning-while-doing algorithm for single-product revenue management problems
• A Polylogarithmic-Competitive Algorithm for the k-Server Problem
• Kernel-based methods for bandit convex optimization
• Title not available (Why is that?)
• A Simple Parallel Algorithm with an $O(1/t)$ Convergence Rate for General Convex Programs
• An Online Convex Optimization Approach to Proactive Network Resource Allocation
• Blind network revenue management
• Watch and learn: optimizing from revealed preferences feedback
• Bandits with Knapsacks
• Regret in Online Combinatorial Optimization
• Near-optimal no-regret algorithms for zero-sum games
• Jointly Private Convex Programming
• Importance weighting without importance weights: an efficient algorithm for combinatorial semi-bandits
• Bandits with Global Convex Constraints and Objective

Cited In (1)

• An \(\alpha \)-regret analysis of adversarial bilateral trade

This page was built for publication: Adversarial bandits with knapsacks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6551256)