{"paper":{"title":"A Fast Distributed Stateless Algorithm for $\\alpha$-Fair Packing Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.DC","authors_text":"Cliff Stein, Gil Zussman, Jelena Marasevic","submitted_at":"2015-02-11T16:58:16Z","abstract_excerpt":"Over the past two decades, fair resource allocation problems have received considerable attention in a variety of application areas. However, little progress has been made in the design of distributed algorithms with convergence guarantees for general and commonly used $\\alpha$-fair allocations. In this paper, we study weighted $\\alpha$-fair packing problems, that is, the problems of maximizing the objective functions (i) $\\sum_j w_j x_j^{1-\\alpha}/(1-\\alpha)$ when $\\alpha > 0$, $\\alpha \\neq 1$ and (ii) $\\sum_j w_j \\ln x_j$ when $\\alpha = 1$, over linear constraints $Ax \\leq b$, $x\\geq 0$, whe"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1502.03372","kind":"arxiv","version":3},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"}