Y. Abbasi-Yadkori, D. Pál, and C. Szepesvári. Improved algorithms for linear stochastic bandits. In Advances in Neural Information Processing Systems (NeurIPS'11), volume 24, 2011.
S. Agrawal and N. Devanur. Linear contextual bandits with knapsacks. In Advances in Neural Information Processing Systems (NeurIPS'16), volume 29, 2016.
S. Agrawal, N.R. Devanur, and L. Li. An efficient algorithm for contextual bandits with knapsacks, and an extension to concave objectives. In Proceedings of the 29th Annual Conference on Learning Theory (COLT'16), volume PMLR:49, pages 4-18, 2016.
R. Ai, Z. Chen, X. Deng, Y. Pan, C. Wang, and M. Yang. On the resolving heuristic for (binary) contextual bandits with knapsacks, November 2022. Preprint, arXiv:2211.13952.
A. Badanidiyuru, R. Kleinberg, and A. Slivkins. Bandits with knapsacks. In IEEE 54th Annual Symposium on Foundations of Computer Science (FOCS'13), pages 207-216, 2013. Latest extended version available at arXiv:1305.2545, dated September 2017.
A. Badanidiyuru, J. Langford, and A. Slivkins. Resourceful contextual bandits. In Proceedings of the 27th Conference on Learning Theory (COLT'14), volume PMLR:35, pages 1109-1134, 2014.
A. Badanidiyuru, R. Kleinberg, and A. Slivkins. Bandits with global convex constraints and objective. Journal of the ACM, 65(3):1-55, 2018.
N. Cesa-Bianchi, G. Lugosi, and G. Stoltz. Minimizing regret with label-efficient prediction. IEEE Transactions on Information Theory, 51:2152-2162, 2005.
A. Chohlas-Wood, M. Coots, H. Zhu, E. Brunskill, and S. Goel. Learning to be fair: A consequentialist approach to equitable decision-making, 2021. Preprint, arXiv:2109.08792.
E. Chzhen, C. Giraud, and G. Stoltz. A unified approach to fair online learning via Blackwell approachability. In Advances in Neural Information Processing Systems (NeurIPS'21), volume 34, 2021.
L. Devroye and L. Györfi. Nonparametric Density Estimation: The  $\mathbb{L}_1$  View. John Wiley & Sons, 1985.
L. Faury, M. Abeille, C. Calauzenes, and O. Fercoq. Improved optimistic algorithms for logistic bandits. In Proceedings of the 37th International Conference on Machine Learning (ICML'20), volume PMLR:119, pages 3052-3060, 2020.
S. Filippi, O. Cappe, A. Garivier, and C. Szepesváři. Parametric bandits: The generalized linear case. In Advances in Neural Information Processing Systems (NeurIPS'10), volume 23, 2010.
David A Freedman. On tail probabilities for martingales. The Annals of Probability, pages 100-118, 1975.
Y. Han, J. Zeng, Y. Wangy, Y. Xiang, and J. Zhang. Optimal contextual bandits with knapsacks under realizability via regression oracles, October 2022. Preprint, arXiv:2210.11834.
N. Immorlica, K.A. Sankararaman, R. Schapire, and A. Slivkins. Adversarial bandits with knapsacks. In 2019 IEEE 60th Annual Symposium on Foundations of Computer Science (FOCS'19), pages 202-219, 2019.
T. Lattimore and C. Szepesvári. Bandit Algorithms. Cambridge University Press, 2020.
Z. Li and G. Stoltz. Contextual bandits with knapsacks for a conversion model. In Advances in Neural Information Processing Systems (NeurIPS'22), volume 35, 2022.
D. Luenberger. Optimization by Vector Space Methods. Series in Decision and Control. John Wiley & Sons, 1969.
A. Slivkins, K.A. Sankararaman, and D.J. Foster. Contextual bandits with packing and covering constraints: A modular Lagrangian approach via regression, November 2022. Preprint, arXiv:2211.07484.