Bandits with concave rewards and convex knapsacks
Authors:
Open Access
- 1 June 2014
- conference paper
- Published by Association for Computing Machinery (ACM)
- p. 989-1006
Abstract
No abstract availableKeywords
All Related Versions
This publication has 20 references indexed in Scilit:
- Bandits with concave rewards and convex knapsacks2014
- Regret Analysis of Stochastic and Nonstochastic Multi-armed Bandit ProblemsFoundations and Trends in Machine Learning, 2012
- Online Learning and Online Convex OptimizationFoundations and Trends in Machine Learning, 2012
- Dynamic Pricing Without Knowing the Demand Function: Risk Bounds and Near-Optimal AlgorithmsOperations Research, 2009
- Multi-armed bandits in metric spaces2008
- Approximation algorithms for budgeted learning problems2007
- Smooth minimization of non-smooth functionsMathematical Programming, 2004
- A desicion-theoretic generalization of on-line learning and an application to boosting1995
- An algorithm for quadratic programmingNaval Research Logistics Quarterly, 1956
- An analog of the minimax theorem for vector payoffsPacific Journal of Mathematics, 1956