{"about":{"site":"https://codewithpapers.app","non_affiliation":"Code with Papers and Syntology are not affiliated with, endorsed by, or sponsored by Papers with Code, Meta, or the pwc-archive mirror.","licence":"CC BY-SA 4.0","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","attribution":"https://codewithpapers.app/attribution","modified":"archive material modified by Syntology; see the attribution page"},"url":"/paper/enabling-long-term-fairness-in-dynamic","title":"Enabling Long-term Fairness in Dynamic Resource Allocation","arxiv_id":"2208.05898","date":"2022-08-11","proceeding":null,"authors":["T. Si-Salem","G. Iosifidis","G. Neglia"],"abstract":"We study the fairness of dynamic resource allocation problem under the $\\alpha$-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.","url_abs":"https://arxiv.org/abs/2208.05898v2","url_pdf":"https://arxiv.org/pdf/2208.05898v2.pdf","source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","row_kind":"links_only","authors_date_abstract":"arXiv metadata, CC0 1.0 (https://info.arxiv.org/help/license), from the Kaggle arXiv metadata snapshot of 2026-09-12"},"code_links":[{"paper_slug":"enabling-long-term-fairness-in-dynamic","repo_url":"https://github.com/tareq-si-salem/Online-Multi-Agent-Cache-Networks","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":1,"framework":"none","reach":null}],"tasks":[],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"atlas_url":"https://app.syntology.ai/?focus=2208.05898","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2208.05898"}},"developers":"https://syntology.ai/developers","read_at":"2026-09-24T18:15:14+00:00","read_at_is":"when the build read Syntology's graph, not when any sample ran","claim":"Per-sample execution status on synthesized fixtures; not a correctness claim about the paper. Samples come from repositories linked to the paper, official or community; repo_kind says which.","repos":[{"provenance":"external:paperswithcode_snapshot_2025-07-28","url":"https://github.com/tareq-si-salem/Online-Multi-Agent-Cache-Networks","reach":null}],"summary":{"ran_honours":2},"by_repo_kind":{"official":{"samples":2,"ran":2,"repositories":1}},"repo_kind_vocabulary":{"official":"The archive marks this repository official for the paper","named_in_paper":"The archive records that the paper mentions this repository; it is not marked official","listed":"In the archive's code links for this paper, not marked official and not recorded as mentioned in the paper","found_in_text":"Syntology found this repository in the paper's own text; whether it is the authors' implementation is not asserted","community":"Not in the archive's code links for this paper; a community repository Syntology harvested"},"n_pointer_only_for_licence":2,"samples":[{"code_sha256_prefix":"3b0bcfb0ed38d582","entry":"to_vec","repo":"tareq-si-salem/Online-Multi-Agent-Cache-Networks","repo_kind":"official","path":"tracegenerator.py","file_url":"https://github.com/tareq-si-salem/Online-Multi-Agent-Cache-Networks/blob/HEAD/tracegenerator.py","link_basis":"first_harvest_node","language":"python","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"mcp_get_code":{"code_sha256":"3b0bcfb0ed38d582"}},{"code_sha256_prefix":"3d07073ecf4fdd68","entry":"zipf_distribution","repo":"tareq-si-salem/Online-Multi-Agent-Cache-Networks","repo_kind":"official","path":"tracegenerator.py","file_url":"https://github.com/tareq-si-salem/Online-Multi-Agent-Cache-Networks/blob/HEAD/tracegenerator.py","link_basis":"first_harvest_node","language":"python","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"mcp_get_code":{"code_sha256":"3d07073ecf4fdd68"}}]},"arxiv_metadata":null,"syntology_extracted_results":null}