Abbasi-yadkori, Y., Pál, D., and Szepesvári, C. Improved algorithms for linear stochastic bandits. In Advances in Neural Information Processing Systems, 2011.
Agrawal, S. and Devanur, N. Linear contextual bandits with knapsacks. In Advances in Neural Information Processing Systems, 2016.
Agrawal, S. and Devanur, N. R. Fast algorithms for online stochastic convex programming. In Proceedings of the 2015 Annual ACM-SIAM Symposium on Discrete Algorithms, 2015.
Ahani, N., Gölz, P., Procaccia, A. D., Teytelboym, A., and Trapp, A. C. Dynamic placement in refugee resettlement. Proceedings of the 22nd ACM Conference on Economics and Computation, 2021.
Ali, M., Sapiezynski, P., Bogen, M., Korolova, A., Mislove, A., and Rieke, A. Discrimination through Optimization: How Facebook's Ad Delivery can Lead to Biased Outcomes. In Proceedings of the ACM Conference on Computer Supported Cooperative Work, 2019.
Badanidiyuru, A., Kleinberg, R., and Slivkins, A. Bandits with knapsacks. J. ACM, 2018.
Balseiro, S., Lu, H., and Mirrokni, V. Dual mirror descent for online allocation problems. In Proceedings of the 37th International Conference on Machine Learning, 2020.
Balseiro, S., Lu, H., and Mirrokni, V. Regularized online allocation problems: Fairness and beyond. In Proceedings of the 38th International Conference on Machine Learning, 2021.
Balseiro, S. R., Besbes, O., and Weintraub, G. Y. Repeated auctions with budgets in ad exchanges: Approximations and design. *Columbia Business School Research Paper Series*, 2014.
Barocas, S., Hardt, M., and Narayanan, A. *Fairness and Machine Learning*. fairmlbook.org, 2019. URL http://www.fairmlbook.org.
Buolamwini, J. and Gebru, T. Gender shades: Intersectional accuracy disparities in commercial gender classification. In Proceedings of the 1st Conference on Fairness, Accountability and Transparency, 2018.
Burke, R. Multisided fairness for recommendation. In In Proceedings of the Workshop on Fairness, Accountability and Trans-parency in Machine Learning, 2017. Available as arXiv:1707.00093.
Castiglioni, M., Celli, A., and Kroer, C. Online learning with knapsacks: the best of both worlds. In Proceedings of the 39th International Conference on Machine Learning, 2022a.
Castiglioni, M., Celli, A., Marchesi, A., Romano, G., and Gatti, N. A unifying framework for online optimization with long-term constraints, 2022b. Available as Arxiv:2209.07454.
Celis, L. E., Huang, L., Keswani, V., and Vishnoi, N. K. Fair classification with noisy protected attributes: A framework with provable guarantees. In Proceedings of the 38th International Conference on Machine Learning, 2021.
Celli, A., Colini-Baldeschi, R., Kroer, C., and Sodomka, E. The parity ray regularizer for pacing in auction markets. In Proceedings of the ACM Web Conference, 2022.
Cesari, T. and Colomboni, R. A nearest neighbor characterization of lebesgue points in metric measure spaces. Mathematical Statistics and Learning, 3, 2020.
Chang, H. and Shokri, R. On the privacy risks of algorithmic fairness. In IEEE European Symposium on Security and Privacy, 2021.
Chen, Y. and Zheng, S. Prior-free data acquisition for accurate statistical estimation. In Proceedings of the ACM Conference on Economics and Computation, 2019.
Chen, Y., Immorlica, N., Lucier, B., Syrgkanis, V., and Ziani, J. Optimal data acquisition for statistical estimation. In Proceedings of the 2018 ACM Conference on Economics and Computation, 2018.