{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,15]],"date-time":"2026-06-15T16:10:28Z","timestamp":1781539828184,"version":"3.54.5"},"reference-count":80,"publisher":"Association for Computing Machinery (ACM)","issue":"3","license":[{"start":{"date-parts":[[2022,12,1]],"date-time":"2022-12-01T00:00:00Z","timestamp":1669852800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100000780","name":"European Commission","doi-asserted-by":"publisher","award":["101017109"],"award-info":[{"award-number":["101017109"]}],"id":[{"id":"10.13039\/501100000780","id-type":"DOI","asserted-by":"publisher"}]},{"name":"French Government","award":["?Plan de Relance? and ?Programme d?investissements d?avenir?."],"award-info":[{"award-number":["?Plan de Relance? and ?Programme d?investissements d?avenir?."]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["Proc. ACM Meas. Anal. Comput. Syst."],"published-print":{"date-parts":[[2022,12]]},"abstract":"<jats:p>We study the fairness of dynamic resource allocation problem under the \u03b1-fairness criterion. We recognize two different fairness objectives that naturally arise in this problem: the well-understood slot-fairness objective that aims to ensure fairness at every timeslot, and the less explored horizon-fairness objective that aims to ensure fairness across utilities accumulated over a time horizon. We argue that horizon-fairness comes at a lower price in terms of social welfare. We study horizon-fairness with the regret as a performance metric and show that vanishing regret cannot be achieved in presence of an unrestricted adversary. We propose restrictions on the adversary's capabilities corresponding to realistic scenarios and an online policy that indeed guarantees vanishing regret under these restrictions. We demonstrate the applicability of the proposed fairness framework to a representative resource management problem considering a virtualized caching system where different caches cooperate to serve content requests.<\/jats:p>","DOI":"10.1145\/3570606","type":"journal-article","created":{"date-parts":[[2022,12,8]],"date-time":"2022-12-08T20:20:10Z","timestamp":1670530810000},"page":"1-36","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":16,"title":["Enabling Long-term Fairness in Dynamic Resource Allocation"],"prefix":"10.1145","volume":"6","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-2158-0126","authenticated-orcid":false,"given":"Tareq","family":"Si Salem","sequence":"first","affiliation":[{"name":"Inria, Sophia Antipolis, France"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1001-2323","authenticated-orcid":false,"given":"Georgios","family":"Iosifidis","sequence":"additional","affiliation":[{"name":"TU Delft, Delft, Netherlands"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8779-0620","authenticated-orcid":false,"given":"Giovanni","family":"Neglia","sequence":"additional","affiliation":[{"name":"Inria, Sophia Antipolis, France"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2022,12,8]]},"reference":[{"key":"e_1_2_1_1_1","volume-title":"Proceedings of the Fifteenth ACM Conference on Economics and Computation","author":"Agrawal Shipra","unstructured":"Shipra Agrawal and Nikhil R. Devanur . 2014. Bandits with Concave Rewards and Convex Knapsacks . In Proceedings of the Fifteenth ACM Conference on Economics and Computation ( Palo Alto, California, USA) (EC '14). Association for Computing Machinery, New York, NY, USA, 989--1006. Shipra Agrawal and Nikhil R. Devanur. 2014. Bandits with Concave Rewards and Convex Knapsacks. In Proceedings of the Fifteenth ACM Conference on Economics and Computation (Palo Alto, California, USA) (EC '14). Association for Computing Machinery, New York, NY, USA, 989--1006."},{"key":"e_1_2_1_2_1","volume-title":"NSDI'17: Proceedings of the 14th USENIX Conference on Networked Systems Design and Implementation. USENIX Association, USA, 469--482","author":"Alipourfard Omid","year":"2017","unstructured":"Omid Alipourfard , Hongqiang Harry Liu , Jianshu Chen , Shivaram Venkataraman , Minlan Yu , and Ming Zhang . 2017 . Cherrypick: adaptively unearthing the best cloud configurations for big data analytics . In NSDI'17: Proceedings of the 14th USENIX Conference on Networked Systems Design and Implementation. USENIX Association, USA, 469--482 . Omid Alipourfard, Hongqiang Harry Liu, Jianshu Chen, Shivaram Venkataraman, Minlan Yu, and Ming Zhang. 2017. Cherrypick: adaptively unearthing the best cloud configurations for big data analytics. In NSDI'17: Proceedings of the 14th USENIX Conference on Networked Systems Design and Implementation. USENIX Association, USA, 469--482."},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1109\/CDC.2008.4738709"},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.comcom.2012.01.013"},{"key":"e_1_2_1_5_1","volume-title":"Lazy Lagrangians with Predictions for Online Learning. arXiv preprint arXiv:2201.02890","author":"Anderson Daron","year":"2022","unstructured":"Daron Anderson , George Iosifidis , and Douglas J Leith . 2022. Lazy Lagrangians with Predictions for Online Learning. arXiv preprint arXiv:2201.02890 ( 2022 ). Daron Anderson, George Iosifidis, and Douglas J Leith. 2022. Lazy Lagrangians with Predictions for Online Learning. arXiv preprint arXiv:2201.02890 (2022)."},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0531(70)90039-6"},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1006\/jcss.2001.1795"},{"key":"e_1_2_1_8_1","first-page":"22034","article-title":"Fair exploration via axiomatic bargaining","volume":"34","author":"Baek Jackie","year":"2021","unstructured":"Jackie Baek and Vivek Farias . 2021 . Fair exploration via axiomatic bargaining . Advances in Neural Information Processing Systems 34 (2021), 22034 -- 22045 . Jackie Baek and Vivek Farias. 2021. Fair exploration via axiomatic bargaining. Advances in Neural Information Processing Systems 34 (2021), 22034--22045.","journal-title":"Advances in Neural Information Processing Systems"},{"key":"e_1_2_1_9_1","volume-title":"The best of many worlds: Dual mirror descent for online allocation problems. Operations Research","author":"Balseiro Santiago R","year":"2022","unstructured":"Santiago R Balseiro , Haihao Lu , and Vahab Mirrokni . 2022. The best of many worlds: Dual mirror descent for online allocation problems. Operations Research ( 2022 ). Santiago R Balseiro, Haihao Lu, and Vahab Mirrokni. 2022. The best of many worlds: Dual mirror descent for online allocation problems. Operations Research (2022)."},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611977073.1"},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1287\/opre.2020.2049"},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/3219166.3219179"},{"key":"e_1_2_1_13_1","volume-title":"The Price of Fairness. Operations Research 59, 1","author":"Bertsimas Dimitris","year":"2011","unstructured":"Dimitris Bertsimas , Vivek F Farias , and Nikolaos Trichakis . 2011. The Price of Fairness. Operations Research 59, 1 ( 2011 ). Dimitris Bertsimas, Vivek F Farias, and Nikolaos Trichakis. 2011. The Price of Fairness. Operations Research 59, 1 (2011)."},{"key":"e_1_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1287\/mnsc.1120.1549"},{"key":"e_1_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.2140\/pjm.1956.6.1"},{"key":"e_1_2_1_16_1","doi-asserted-by":"crossref","unstructured":"B. Blaszczyszyn and A. Giovanidis. 2015. Optimal Geographic Caching In Cellular Networks. In ICC. 3358--3363.  B. Blaszczyszyn and A. Giovanidis. 2015. Optimal Geographic Caching In Cellular Networks. In ICC. 3358--3363.","DOI":"10.1109\/ICC.2015.7248843"},{"key":"e_1_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2011.2132470"},{"key":"e_1_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2021.3105880"},{"key":"e_1_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2012.2233213"},{"key":"e_1_2_1_20_1","first-page":"13750","article-title":"Group-Fair Online Allocation in Continuous Time","volume":"33","author":"Cayci Semih","year":"2020","unstructured":"Semih Cayci , Swati Gupta , and Atilla Eryilmaz . 2020 . Group-Fair Online Allocation in Continuous Time . Advances in Neural Information Processing Systems 33 (2020), 13750 -- 13761 . Semih Cayci, Swati Gupta, and Atilla Eryilmaz. 2020. Group-Fair Online Allocation in Continuous Time. Advances in Neural Information Processing Systems 33 (2020), 13750--13761.","journal-title":"Advances in Neural Information Processing Systems"},{"key":"e_1_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/633025.633043"},{"key":"e_1_2_1_22_1","first-page":"1","article-title":"CVXPY: A Python-Embedded Modeling Language for Convex Optimization","volume":"17","author":"Diamond Steven","year":"2016","unstructured":"Steven Diamond and Stephen Boyd . 2016 . CVXPY: A Python-Embedded Modeling Language for Convex Optimization . Journal of Machine Learning Research 17 , 1 (jan 2016), 2909--2913. Steven Diamond and Stephen Boyd. 2016. CVXPY: A Python-Embedded Modeling Language for Convex Optimization. Journal of Machine Learning Research 17, 1 (jan 2016), 2909--2913.","journal-title":"Journal of Machine Learning Research"},{"key":"e_1_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1137\/110836043"},{"key":"e_1_2_1_24_1","unstructured":"Francis Ysidro Edgeworth etal 1881. Mathematical Psychics. History of Economic Thought Books (1881).  Francis Ysidro Edgeworth et al. 1881. Mathematical Psychics. History of Economic Thought Books (1881)."},{"key":"e_1_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1214\/aoms\/1177706369"},{"key":"e_1_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/2810156.2810168"},{"key":"e_1_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/2764468.2764536"},{"key":"e_1_2_1_28_1","volume-title":"Online Learning with Global Cost Functions. In 22nd Annual Conference on Learning Theory, COLT.","author":"Even-Dar Eyal","year":"2009","unstructured":"Eyal Even-Dar , Robert Kleinberg , Shie Mannor , and Yishay Mansour . 2009 . Online Learning with Global Cost Functions. In 22nd Annual Conference on Learning Theory, COLT. Eyal Even-Dar, Robert Kleinberg, Shie Mannor, and Yishay Mansour. 2009. Online Learning with Global Cost Functions. In 22nd Annual Conference on Learning Theory, COLT."},{"key":"e_1_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1057\/palgrave.jors.2600523"},{"key":"e_1_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1109\/MCOM.2016.7537172"},{"key":"e_1_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/2745844.2745860"},{"key":"e_1_2_1_32_1","first-page":"1","article-title":"Individual Fairness in Hindsight","volume":"22","author":"Gupta Swati","year":"2021","unstructured":"Swati Gupta and Vijay Kamble . 2021 . Individual Fairness in Hindsight . J. Mach. Learn. Res. 22 , 144 (2021), 1 -- 35 . Swati Gupta and Vijay Kamble. 2021. Individual Fairness in Hindsight. J. Mach. Learn. Res. 22, 144 (2021), 1--35.","journal-title":"J. Mach. Learn. Res."},{"key":"e_1_2_1_33_1","volume-title":"A generalized Nash solution for two-person bargaining games with incomplete information. Management science 18, 5-part-2","author":"Harsanyi John C","year":"1972","unstructured":"John C Harsanyi and Reinhard Selten . 1972. A generalized Nash solution for two-person bargaining games with incomplete information. Management science 18, 5-part-2 ( 1972 ), 80--106. John C Harsanyi and Reinhard Selten. 1972. A generalized Nash solution for two-person bargaining games with incomplete information. Management science 18, 5-part-2 (1972), 80--106."},{"key":"e_1_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1561\/9781680831719"},{"key":"e_1_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1145\/2896377.2901467"},{"key":"e_1_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2016.2638939"},{"key":"e_1_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2014.2328098"},{"key":"e_1_2_1_38_1","volume-title":"Online Learning in Fisher Markets with Unknown Agent Preferences. arXiv preprint arXiv:2205.00825","author":"Jalota Devansh","year":"2022","unstructured":"Devansh Jalota and Yinyu Ye. 2022. Online Learning in Fisher Markets with Unknown Agent Preferences. arXiv preprint arXiv:2205.00825 ( 2022 ). Devansh Jalota and Yinyu Ye. 2022. Online Learning in Fisher Markets with Unknown Agent Preferences. arXiv preprint arXiv:2205.00825 (2022)."},{"key":"e_1_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1145\/2492101.1555377"},{"key":"e_1_2_1_40_1","doi-asserted-by":"crossref","unstructured":"Jose A. Ayala-Romero Andres Garcia-Saavedra Xavier Costa-P\u00e9rez George Iosifidis. 2021. EdgeBOL: Automating Energy-savings for Mobile Edge AI. In ACM CoNEXT. 397--410.  Jose A. Ayala-Romero Andres Garcia-Saavedra Xavier Costa-P\u00e9rez George Iosifidis. 2021. EdgeBOL: Automating Energy-savings for Mobile Edge AI. In ACM CoNEXT. 397--410.","DOI":"10.1145\/3485983.3494849"},{"key":"e_1_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.2307\/1914280"},{"key":"e_1_2_1_42_1","volume-title":"Online Max-min Fair Allocation. arXiv preprint arXiv:2111.07235","author":"Kawase Yasushi","year":"2021","unstructured":"Yasushi Kawase and Hanna Sumita . 2021. Online Max-min Fair Allocation. arXiv preprint arXiv:2111.07235 ( 2021 ). Yasushi Kawase and Hanna Sumita. 2021. Online Max-min Fair Allocation. arXiv preprint arXiv:2111.07235 (2021)."},{"key":"e_1_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.1145\/3281010"},{"key":"e_1_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM.2016.7524380"},{"key":"e_1_2_1_45_1","doi-asserted-by":"publisher","DOI":"10.1145\/3491047"},{"key":"e_1_2_1_46_1","volume-title":"Nonstationary Dual Averaging and Online Fair Allocation. ArXiv e-prints (Feb","author":"Liao Luofeng","year":"2022","unstructured":"Luofeng Liao , Yuan Gao , and Christian Kroer . 2022. Nonstationary Dual Averaging and Online Fair Allocation. ArXiv e-prints (Feb . 2022 ). Luofeng Liao, Yuan Gao, and Christian Kroer. 2022. Nonstationary Dual Averaging and Online Fair Allocation. ArXiv e-prints (Feb. 2022)."},{"key":"e_1_2_1_47_1","volume-title":"Edge Assisted Real-time Object Detection for Mobile Augmented Reality. In MobiCom '19: The 25th Annual International Conference on Mobile Computing and Networking. Association for Computing Machinery","author":"Liu Luyang","year":"2019","unstructured":"Luyang Liu , Hongyu Li , and Marco Gruteser . 2019 . Edge Assisted Real-time Object Detection for Mobile Augmented Reality. In MobiCom '19: The 25th Annual International Conference on Mobile Computing and Networking. Association for Computing Machinery , New York, NY, USA, 1--16. Luyang Liu, Hongyu Li, and Marco Gruteser. 2019. Edge Assisted Real-time Object Detection for Mobile Augmented Reality. In MobiCom '19: The 25th Annual International Conference on Mobile Computing and Networking. Association for Computing Machinery, New York, NY, USA, 1--16."},{"key":"e_1_2_1_48_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.peva.2020.102138"},{"key":"e_1_2_1_49_1","volume-title":"Fairness over time in dynamic resource allocation with an application in Healthcare. arXiv preprint arXiv:2101.03716","author":"Lodi Andrea","year":"2021","unstructured":"Andrea Lodi , Philippe Olivier , Gilles Pesant , and Sriram Sankaranarayanan . 2021. Fairness over time in dynamic resource allocation with an application in Healthcare. arXiv preprint arXiv:2101.03716 ( 2021 ). Andrea Lodi, Philippe Olivier, Gilles Pesant, and Sriram Sankaranarayanan. 2021. Fairness over time in dynamic resource allocation with an application in Healthcare. arXiv preprint arXiv:2101.03716 (2021)."},{"key":"e_1_2_1_50_1","article-title":"Online Learning with Sample Path Constraints","volume":"10","author":"Mannor Shie","year":"2009","unstructured":"Shie Mannor , John N Tsitsiklis , and Jia Yuan Yu . 2009 . Online Learning with Sample Path Constraints . Journal of Machine Learning Research 10 , 3 (2009). Shie Mannor, John N Tsitsiklis, and Jia Yuan Yu. 2009. Online Learning with Sample Path Constraints. Journal of Machine Learning Research 10, 3 (2009).","journal-title":"Journal of Machine Learning Research"},{"key":"e_1_2_1_51_1","doi-asserted-by":"publisher","DOI":"10.5555\/3122009.3176834"},{"key":"e_1_2_1_52_1","volume-title":"Online Caching with no Regret: Optimistic Learning via Recommendations. arXiv preprint arXiv:2204.09345","author":"Mhaisen Naram","year":"2022","unstructured":"Naram Mhaisen , George Iosifidis , and Douglas Leith . 2022. Online Caching with no Regret: Optimistic Learning via Recommendations. arXiv preprint arXiv:2204.09345 ( 2022 ). Naram Mhaisen, George Iosifidis, and Douglas Leith. 2022. Online Caching with no Regret: Optimistic Learning via Recommendations. arXiv preprint arXiv:2204.09345 (2022)."},{"key":"e_1_2_1_53_1","doi-asserted-by":"publisher","DOI":"10.1109\/90.879343"},{"key":"e_1_2_1_54_1","doi-asserted-by":"publisher","DOI":"10.1109\/SURV.2008.080403"},{"key":"e_1_2_1_55_1","doi-asserted-by":"publisher","DOI":"10.2307\/1907266"},{"key":"e_1_2_1_56_1","first-page":"4435","article-title":"LeadCache: Regret-Optimal Caching in Networks","volume":"34","author":"Paria Debjit","year":"2021","unstructured":"Debjit Paria and Abhishek Sinha . 2021 . LeadCache: Regret-Optimal Caching in Networks . Advances in Neural Information Processing Systems 34 (2021), 4435 -- 4447 . Debjit Paria and Abhishek Sinha. 2021. LeadCache: Regret-Optimal Caching in Networks. Advances in Neural Information Processing Systems 34 (2021), 4435--4447.","journal-title":"Advances in Neural Information Processing Systems"},{"key":"e_1_2_1_57_1","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM.2019.8737446"},{"key":"e_1_2_1_58_1","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2007.896231"},{"key":"e_1_2_1_59_1","volume-title":"Conference on Learning Theory. PMLR, 993--1019","author":"Rakhlin Alexander","year":"2013","unstructured":"Alexander Rakhlin and Karthik Sridharan . 2013 . Online learning with predictable sequences . In Conference on Learning Theory. PMLR, 993--1019 . Alexander Rakhlin and Karthik Sridharan. 2013. Online learning with predictable sequences. In Conference on Learning Theory. PMLR, 993--1019."},{"key":"e_1_2_1_60_1","volume-title":"Proceedings of the 24th Annual Conference on Learning Theory (Proceedings of Machine Learning Research","volume":"594","author":"Rakhlin Alexander","year":"2011","unstructured":"Alexander Rakhlin , Karthik Sridharan , and Ambuj Tewari . 2011 . Online Learning: Beyond Regret . In Proceedings of the 24th Annual Conference on Learning Theory (Proceedings of Machine Learning Research , Vol. 19), Sham M. Kakade and Ulrike von Luxburg (Eds.). PMLR, Budapest, Hungary, 559-- 594 . Alexander Rakhlin, Karthik Sridharan, and Ambuj Tewari. 2011. Online Learning: Beyond Regret. In Proceedings of the 24th Annual Conference on Learning Theory (Proceedings of Machine Learning Research, Vol. 19), Sham M. Kakade and Ulrike von Luxburg (Eds.). PMLR, Budapest, Hungary, 559--594."},{"key":"e_1_2_1_61_1","first-page":"1","article-title":"L. Georgiadis, M. J. Neely, and L","volume":"1","author":"Allocation Resource","year":"2006","unstructured":"Resource Allocation and Cross Layer Control in Wireless Networks . 2006 . L. Georgiadis, M. J. Neely, and L . Tassiulas. Found. Trends Netw. 1 , 1 (2006), 1 -- 143 . Resource Allocation and Cross Layer Control in Wireless Networks. 2006. L. Georgiadis, M. J. Neely, and L. Tassiulas. Found. Trends Netw. 1, 1 (2006), 1--143.","journal-title":"Tassiulas. Found. Trends Netw."},{"key":"e_1_2_1_62_1","volume-title":"The Online Saddle Point Problem and Online Convex Optimization with Knapsacks. preprint arXiv:1806.08301","author":"Rivera Adrian","year":"2018","unstructured":"Adrian Rivera , He Wang , and Huan Xu. 2018. The Online Saddle Point Problem and Online Convex Optimization with Knapsacks. preprint arXiv:1806.08301 ( 2018 ). Adrian Rivera, He Wang, and Huan Xu. 2018. The Online Saddle Point Problem and Online Convex Optimization with Knapsacks. preprint arXiv:1806.08301 (2018)."},{"key":"e_1_2_1_63_1","first-page":"2","article-title":"Online Learning and Online Convex Optimization","volume":"4","author":"Shalev-Shwartz Shai","year":"2012","unstructured":"Shai Shalev-Shwartz . 2012 . Online Learning and Online Convex Optimization . Foundations and Trends in Machine Learning 4 , 2 (Feb. 2012), 107--194. Shai Shalev-Shwartz. 2012. Online Learning and Online Convex Optimization. Foundations and Trends in Machine Learning 4, 2 (Feb. 2012), 107--194.","journal-title":"Foundations and Trends in Machine Learning"},{"key":"e_1_2_1_64_1","unstructured":"Shai Shalev-Shwartz and Yoram Singer. 2007. Online Learning: Theory Algorithms and Applications. Ph.D. Dissertation. Hebrew University.  Shai Shalev-Shwartz and Yoram Singer. 2007. Online Learning: Theory Algorithms and Applications. Ph.D. Dissertation. Hebrew University."},{"key":"e_1_2_1_65_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2013.2281606"},{"key":"e_1_2_1_66_1","volume-title":"A\u00c7AI: Ascent Similarity Caching with Approximate Indexes. In 2021 33rd International Teletraffic Congress (ITC-33)","author":"Salem Tareq Si","year":"2021","unstructured":"Tareq Si Salem , Giovanni Neglia , and Damiano Carra . 2021 . A\u00c7AI: Ascent Similarity Caching with Approximate Indexes. In 2021 33rd International Teletraffic Congress (ITC-33) . IEEE, 1--9. Tareq Si Salem, Giovanni Neglia, and Damiano Carra. 2021. A\u00c7AI: Ascent Similarity Caching with Approximate Indexes. In 2021 33rd International Teletraffic Congress (ITC-33). IEEE, 1--9."},{"key":"e_1_2_1_67_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICC42927.2021.9500487"},{"key":"e_1_2_1_68_1","volume-title":"No-Regret Caching via Online Mirror Descent. preprint arXiv:2101.12588","author":"Salem Tareq Si","year":"2021","unstructured":"Tareq Si Salem , Giovanni Neglia , and Stratis Ioannidis . 2021. No-Regret Caching via Online Mirror Descent. preprint arXiv:2101.12588 ( 2021 ). arXiv:2101.12588 [cs.LG] Tareq Si Salem, Giovanni Neglia, and Stratis Ioannidis. 2021. No-Regret Caching via Online Mirror Descent. preprint arXiv:2101.12588 (2021). arXiv:2101.12588 [cs.LG]"},{"key":"e_1_2_1_69_1","doi-asserted-by":"publisher","DOI":"10.1145\/3547353.3526951"},{"key":"e_1_2_1_70_1","volume-title":"Sequential fair allocation of limited resources under stochastic demands. arXiv preprint arXiv:2011.14382","author":"Sinclair Sean R","year":"2020","unstructured":"Sean R Sinclair , Gauri Jain , Siddhartha Banerjee , and Christina Lee Yu. 2020. Sequential fair allocation of limited resources under stochastic demands. arXiv preprint arXiv:2011.14382 ( 2020 ). Sean R Sinclair, Gauri Jain, Siddhartha Banerjee, and Christina Lee Yu. 2020. Sequential fair allocation of limited resources under stochastic demands. arXiv preprint arXiv:2011.14382 (2020)."},{"key":"e_1_2_1_71_1","doi-asserted-by":"crossref","unstructured":"T. Bonald and J. W. Roberts. 2015. Multi-Resource Fairness: Objectives Algorithms and Performance. In ACM Sigmetrics.  T. Bonald and J. W. Roberts. 2015. Multi-Resource Fairness: Objectives Algorithms and Performance. In ACM Sigmetrics.","DOI":"10.1145\/2745844.2745869"},{"key":"e_1_2_1_72_1","first-page":"1","article-title":"Learning Proportionally Fair Allocations with Low Regret","volume":"46","author":"Talebi Mohammad Sadegh","year":"2018","unstructured":"Mohammad Sadegh Talebi and Alexandre Proutiere . 2018 . Learning Proportionally Fair Allocations with Low Regret . SIGMETRICS Performance Evaluation Review 46 , 1 (jun 2018), 50--52. Mohammad Sadegh Talebi and Alexandre Proutiere. 2018. Learning Proportionally Fair Allocations with Low Regret. SIGMETRICS Performance Evaluation Review 46, 1 (jun 2018), 50--52.","journal-title":"SIGMETRICS Performance Evaluation Review"},{"key":"e_1_2_1_73_1","doi-asserted-by":"publisher","DOI":"10.1145\/2541468.2541470"},{"key":"e_1_2_1_74_1","doi-asserted-by":"crossref","unstructured":"W. Wang B. Li and B. Liang. 2014. Dominant Resource Fairness in Cloud Computing Systems with Heterogeneous Servers. In IEEE INFOCOM.  W. Wang B. Li and B. Liang. 2014. Dominant Resource Fairness in Cloud Computing Systems with Heterogeneous Servers. In IEEE INFOCOM.","DOI":"10.1109\/INFOCOM.2014.6847983"},{"key":"e_1_2_1_75_1","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2017.2707131"},{"key":"e_1_2_1_76_1","volume-title":"Projection onto the Capped Simplex. preprint arXiv:1503.01002","author":"Wang Weiran","year":"2015","unstructured":"Weiran Wang and Canyi Lu. 2015. Projection onto the Capped Simplex. preprint arXiv:1503.01002 ( 2015 ). Weiran Wang and Canyi Lu. 2015. Projection onto the Capped Simplex. preprint arXiv:1503.01002 (2015)."},{"key":"e_1_2_1_77_1","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2006.879351"},{"key":"e_1_2_1_78_1","doi-asserted-by":"publisher","DOI":"10.1145\/3391403.3399467"},{"key":"e_1_2_1_79_1","doi-asserted-by":"publisher","DOI":"10.1109\/COMST.2018.2816042"},{"key":"e_1_2_1_80_1","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v33i01.3301459"}],"container-title":["Proceedings of the ACM on Measurement and Analysis of Computing Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3570606","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3570606","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T16:46:17Z","timestamp":1750178777000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3570606"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,12]]},"references-count":80,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2022,12]]}},"alternative-id":["10.1145\/3570606"],"URL":"https:\/\/doi.org\/10.1145\/3570606","relation":{},"ISSN":["2476-1249"],"issn-type":[{"value":"2476-1249","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,12]]},"assertion":[{"value":"2022-12-08","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}