Combinatorial Algorithm for Restricted Max-Min Fair Allocation
From MaRDI portal
Publication:5363005
DOI10.1137/1.9781611973730.90zbMath1375.91108OpenAlexW2950417810MaRDI QIDQ5363005
Ola Svensson, Christos Kalaitzis, Chidambaram Annamalai
Publication date: 5 October 2017
Published in: Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/1.9781611973730.90
Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Approximation algorithms (68W25) Resource and cost allocation (including fair division, apportionment, etc.) (91B32)
Related Items (6)
Approximating the Nash Social Welfare with Indivisible Items ⋮ Compact LP Relaxations for Allocation Problems ⋮ A Further Analysis of the Dynamic Dominant Resource Fairness Mechanism ⋮ On \((1, \epsilon )\)-restricted max-min fair allocation problem ⋮ Lazy Local Search Meets Machine Scheduling ⋮ Approximating Nash Social Welfare under Submodular Valuations through (Un)Matchings
This page was built for publication: Combinatorial Algorithm for Restricted Max-Min Fair Allocation
