Combinatorial Algorithm for Restricted Max-Min Fair Allocation
DOI10.1137/1.9781611973730.90zbMATH Open1375.91108OpenAlexW2950417810MaRDI QIDQ5363005FDOQ5363005
Chidambaram Annamalai, Ola Svensson, Christos Kalaitzis
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
Recommendations
- Combinatorial algorithm for restricted max-min fair allocation
- Restricted Max-Min Fair Allocation
- On \((1, \epsilon )\)-restricted max-min fair allocation problem
- Restricted max-min fair allocations with inclusion-free intervals
- An approximation algorithm for max-min fair allocation of indivisible goods
- On \((1,\varepsilon)\)-restricted max-min fair allocation problem
- General max-min fair allocation
- An algorithm for the fair resource allocation problem with a submodular constraint
- An algorithm for identifying fair and optimal allocations
- Fair allocation algorithms for indivisible items under structured conflict constraints
Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Resource and cost allocation (including fair division, apportionment, etc.) (91B32) Approximation algorithms (68W25)
Cited In (9)
- Approximating the Nash Social Welfare with Indivisible Items
- A Further Analysis of the Dynamic Dominant Resource Fairness Mechanism
- On \((1, \epsilon )\)-restricted max-min fair allocation problem
- Approximating Nash Social Welfare under Submodular Valuations through (Un)Matchings
- Lazy Local Search Meets Machine Scheduling
- A combinatorial algorithm to establish a fair border
- Restricted Max-Min Fair Allocation
- An efficient primal-dual algorithm for fair combinatorial optimization problems
- Compact LP Relaxations for Allocation Problems
This page was built for publication: Combinatorial Algorithm for Restricted Max-Min Fair Allocation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5363005)