Debjit Paria and Abhishek Sinha. Leadcache: Regret-optimal caching in networks. Advances in Neural Information Processing Systems 34 (NIPS), 34:4435-4447, 2021.
Rajarshi Bhattacharjee, Subhankar Banerjee, and Abhishek Sinha. Fundamental limits on the regret of online network-caching. Proceedings of the ACM on Measurement and Analysis of Computing Systems, 4(2), June 2020. doi: 10.1145/3392143.
Samrat Mukhopadhyay, Sourav Sahoo, and Abhishek Sinha. k-experts-online policies and fundamental limits. In International Conference on Artificial Intelligence and Statistics, pages 342-365. PMLR, 2022.
Dimitris Bertsimas, Vivek F Farias, and Nikolaos Trichakis. On the efficiency-fairness trade-off. Management Science, 58(12):2234-2250, 2012.
Naram Mhaisen, Abhishek Sinha, Georgios Paschos, and George Iosifidis. Optimistic no-regret algorithms for discrete caching. Proceedings of the ACM on Measurement and Analysis of Computing Systems, 6(3), dec 2022. doi: 10.1145/3570608.
Ativ Joshi and Abhishek Sinha. Universal caching. In 2022 IEEE Information Theory Workshop (ITW), pages 684-689, 2022. doi: 10.1109/ITW54588.2022.9965906.
Francesco Orabona. A modern introduction to online learning, 2020. URL https://open.bu.edu/handle/2144/40900.
Daniel S Berger. CDN Traces. https://github.com/dasebe/optimalwebcaching, 2018.
Aditya Bhaskara, Ashok Cutkosky, Ravi Kumar, and Manish Purohit. Online learning with imperfect hints. In Proceedings of the 37th International Conference on Machine Learning (ICML), pages 822-831. PMLR, 2020.
Moritz Hardt, Eric Price, and Nati Srebro. Equality of opportunity in supervised learning. Advances in Neural Information Processing Systems 29 (NIPS), 29, 2016.
Jon Kleinberg, Sendhil Mullainathan, and Manish Raghavan. Inherent trade-offs in the fair determination of risk scores. In Christos H. Papadimitriou, editor, Proceedings of the 8th Conference on Innovations in Theoretical Computer Science (ITCS), volume 67 of Leibniz International Proceedings in Informatics (LIPics), pages 43:1-43:23, Dagstuhl, Germany, 2017. Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik. ISBN 978-3-95977-029-3. doi: 10.4230/LIPics.ITCS.2017.43.
Dimitris Bertsimas, Vivek F. Farias, and Nikolaos Trichakis. The price of fairness. Operations Research, 59(1):17-31, 2011.
Sam Corbett-Davies and Sharad Goel. The measure and mismeasure of fairness: A critical review of fair machine learning. arXiv preprint arXiv:1808.00023, 2016.
Alexandra Chouldechova. Fair prediction with disparate impact: A study of bias in recidivism prediction instruments. *Big Data.*, 5(2):153-163, 2017.
Sean R. Sinclair, Siddhartha Banerjee, and Christina Lee Yu. Sequential fair allocation: Achieving the optimal envy-efficiency tradeoff curve. SIGMETRICS Perform. Eval. Rev., 50(1):95-96, jul 2022. ISSN 0163-5999. doi: 10.1145/3547353.3526951.
Siddhartha Banerjee, Vasilis Gkatzelis, Artur Gorokh, and Billy Jin. Online nash social welfare maximization with predictions. In Proceedings of the 33rd Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 1-19, 2022. doi: 10.1137/1.9781611977073.1.
Makis Arsenis and Robert Kleinberg. Individual fairness in prophet inequalities. In Proceedings of the 23rd ACM Conference on Economics and Computation, EC '22, page 245, New York, NY, USA, 2022. Association for Computing Machinery. ISBN 9781450391504.
Mohammad Sadegh Talebi and Alexandre Proutiere. Learning proportionally fair allocations with low regret. Proceedings of the ACM on Measurement and Analysis of Computing Systems, 2(2): 1-31, 2018.