1. Improved algorithms for linear stochastic bandits;Y Abbasi-Yadkori;Advances in neural information processing systems,2011
2. Online vertex-weighted bipartite matching and single-bid budgeted allocations;G Aggarwal;Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms,2011
3. Bandits with concave rewards and convex knapsacks;S Agrawal;Proceedings of the fifteenth ACM conference on Economics and computation,2014
4. An efficient algorithm for contextual bandits with knapsacks, and an extension to concave objectives;S Agrawal;Conference on Learning Theory,2016
5. Bandits with knapsacks;A Badanidiyuru;Journal of the ACM (JACM),2018