Bandits with knapsacks

DOI10.1109/FOCS.2013.30MaRDI QIDQ6981755zbMATH OpenFDO

Authors Aleksandrs Slivkins, Robert D. Kleinberg, Ashwinkumar Badanidiyuru

Publication date 20 May 2025

Full work available at URL https://doi.org/10.1109/FOCS.2013.30

Mathematics Subject Classification ID

Combinatorics (05-XX) Computer science (68-XX) Information and communication theory, circuits (94-XX)

Cited in

(6)

• Near-linear MIR algorithms for stochastically-ordered priors
• Contextual bandits with stage-wise constraints
• Nonparametric multi-product dynamic pricing with demand learning via simultaneous price perturbation
• Combinatorial multi-armed bandits with fairness constraints: an online convex optimization perspective
• Efficient algorithms for stochastic repeated second-price auctions
• Dynamic pricing with finitely many unknown valuations

This page was built for publication: Bandits with knapsacks

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