Vishakha Patil, Ganesh Ghalme, Vineet Nair, and Y. Narahari. Achieving fairness in the stochastic multi-armed bandit problem. J. Mach. Learn. Res., 22(1), jan 2021. ISSN 1532-4435.
Matthew Joseph, Michael Kearns, Jamie H Morgenstern, and Aaron Roth. Fairness in learning: Classic and contextual bandits. Advances in Neural Information Processing Systems 29 (NIPS), 29, 2016.
Fengjiao Li, Jia Liu, and Bo Ji. Combinatorial sleeping bandits with fairness constraints. IEEE Transactions on Network Science and Engineering, 7(3):1799-1813, 2019.
Yifang Chen, Alex Cuellar, Haipeng Luo, Jignesh Modi, Heramb Nemlekar, and Stefanos Nikolaidis. Fair contextual multi-armed bandits: theory and experiments. In Conference on Uncertainty in Artificial Intelligence, pages 181–190. PMLR, 2020.
Daniel Freund, Thodoris Lykouris, Elisabeth Paulson, Bradley Sturt, and Wentao Weng. Group fairness in dynamic refugee assignment. arXiv preprint arXiv:2301.10642v1, 2023.
Jackie Baek and Vivek Farias. Fair exploration via axiomatic bargaining. Advances in Neural Information Processing Systems 34 (NIPS), 34:22034-22045, 2021.
Avrim Blum and Carl Burch. On-line learning and the metrical task system problem. In Proceedings of the 10th Annual Conference on Computational Learning Theory (COLT), pages 45-53, 1997.
Avrim Blum, Carl Burch, and Adam Kalai. Finely-competitive paging. In Proceedings of the 40th Annual IEEE Symposium on Foundations of Computer Science (FOCS), pages 450-457, 1999. doi: 10.1109/SFFCS.1999.814617.
Zhiyuan Wang, Jiancheng Ye, Dong Lin, and John C. S. Lui. Achieving efficiency via fairness in online resource allocation. In Proceedings of the 23rd International Symposium on Theory, Algorithmic Foundations, and Protocol Design for Mobile Networks and Mobile Computing, MobiHoc '22, page 101-110, New York, NY, USA, 2022. Association for Computing Machinery. ISBN 9781450391658. doi: 10.1145/3492866.3549724.
Alexander L Stolyar. On the asymptotic optimality of the gradient scheduling algorithm for multiuser throughput allocation. Operations research, 53(1):12-25, 2005a.
Harold J Kushner and Philip A Whiting. Asymptotic properties of proportional-fair sharing algorithms. Technical report, Brown Univ Providence RI Div of Applied Mathematics, 2002.
Frank P Kelly, Aman K Maulloo, and David Kim Hong Tan. Rate control for communication networks: shadow prices, proportional fairness and stability. Journal of the Operational Research Society, 49(3):237-252, 1998.
Dimitri Bertsekas and Robert G. Gallager. Data Networks. Englewood Cliffs, NJ: Prentice Hall, 1991.
Jeffrey Jaffe. Bottleneck flow control. IEEE Transactions on Communications, 29(7):954-962, 1981. doi: 10.1109/TCOM.1981.1095081.
MohammadHossein Bateni, Yiwei Chen, Dragos Florin Ciocan, and Vahab S. Mirrokni. Fair resource allocation in a volatile marketplace. Operations Research, 70(1):288-308, 2021.
Santiago Balseiro, Haihao Lu, and Vahab Mirrokni. Regularized online allocation problems: Fairness and beyond. In Marina Meila and Tong Zhang, editors, Proceedings of the 38th International Conference on Machine Learning (ICML), volume 139, pages 630-639. PMLR, 18-24 Jul 2021.
Yuan Deng, Negin Golrezaei, Patrick Jaillet, Jason Cheuk Nam Liang, and Vahab Mirrokni. Fairness in the autobidding world with machine-learned advice. arXiv preprint arXiv:2209.04748v3, 2023. doi: https://doi.org/10.48550/arXiv.2209.04748.
Will Ma, Pan Xu, and Yifan Xu. Fairness maximization among offline agents in online-matching markets. ACM Trans. Econ. Comput., 10(4), apr 2023. ISSN 2167-8375. doi: 10.1145/3569705.
Dimitris Bertsimas, Vivek F. Farias, and Nikolaos Trichakis. Flexibility in organ allocation for kidney transplantation. Operations Research, 61(1), 2013. ISSN 73-87.