Document Open Access Logo

Restricted Max-Min Fair Allocation

Authors Siu-Wing Cheng , Yuchen Mao

PDF

File

Thumbnail PDF
PDF
LIPIcs.ICALP.2018.37.pdf
  • Filesize: 486 kB
  • 13 pages

Document Identifiers

Related Versions

Subject Classification

ACM Subject Classification
  • Theory of computation → Scheduling algorithms
Keywords
  • Fair allocation
  • approximation
  • local search

Metrics

  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    0
    PDF Downloads
    0
    Metadata Views

Abstract

The restricted max-min fair allocation problem seeks an allocation of resources to players that maximizes the minimum total value obtained by any player. It is NP-hard to approximate the problem to a ratio less than 2. Comparing the current best algorithm for estimating the optimal value with the current best for constructing an allocation, there is quite a gap between the ratios that can be achieved in polynomial time: 4+delta for estimation and 6 + 2 sqrt{10} + delta ~~ 12.325 + delta for construction, where delta is an arbitrarily small constant greater than 0. We propose an algorithm that constructs an allocation with value within a factor 6 + delta from the optimum for any constant delta > 0. The running time is polynomial in the input size for any constant delta chosen.

Cite As Get BibTex

Siu-Wing Cheng and Yuchen Mao. Restricted Max-Min Fair Allocation. In 45th International Colloquium on Automata, Languages, and Programming (ICALP 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 107, pp. 37:1-37:13, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018) https://doi.org/10.4230/LIPIcs.ICALP.2018.37

Author Details

Siu-Wing Cheng
  • Department of Computer Science and Engineering, HKUST, Hong Kong
Yuchen Mao
  • Department of Computer Science and Engineering, HKUST, Hong Kong

Funding

Supported by the Research Grants Council, Hong Kong, China (project no. 16201116).

References

  1. Chidambaram Annamalai, Christos Kalaitzis, and Ola Svensson. Combinatorial algorithm for restricted max-min fair allocation. ACM Trans. Algorithms, 13(3):37:1-37:28, 2017. Google Scholar
  2. Arash Asadpour, Uriel Feige, and Amin Saberi. Santa claus meets hypergraph matchings. ACM Trans. Algorithms, 8(3):24:1-24:9, 2012. Google Scholar
  3. Arash Asadpour and Amin Saberi. An approximation algorithm for max-min fair allocation of indivisible goods. In Proc. 39th ACM Symposium on Theory of Computing, pages 114-121, 2007. Google Scholar
  4. Nikhil Bansal and Maxim Sviridenko. The santa claus problem. In Proc. 38th ACM Symposium on Theory of Computing, pages 31-40, 2006. Google Scholar
  5. Ivona Bezáková and Varsha Dani. Allocating indivisible goods. SIGecom Exchanges, 5(3):11-18, 2005. Google Scholar
  6. Deeparnab Chakrabarty, Julia Chuzhoy, and Sanjeev Khanna. On allocating goods to maximize fairness. In Proc. 50th IEEE Symposium on Foundations of Computer Science, pages 107-116, 2009. Google Scholar
  7. T.-H. Hubert Chan, Zhihao Gavin Tang, and Xiaowei Wu. On (1, epsilon)-restricted max-min fair allocation problem. In Proc. 27th International Symposium on Algorithms and Computation, volume 64, pages 23:1-23:13, 2016. Google Scholar
  8. Uriel Feige. On allocations that maximize fairness. In Proc. 19th ACM-SIAM Symposium on Discrete Algorithms, pages 287-293, 2008. Google Scholar
  9. Daniel Golovin. Max-min fair allocation of indivisible good. Technical report, Carnegie Mellon University, 2005. Google Scholar
  10. Bernhard Haeupler, Barna Saha, and Aravind Srinivasan. New constructive aspects of the lovász local lemma. Journal of the ACM, 58(6):28:1-28:28, 2011. Google Scholar
  11. László Lovász and Michael D. Plummer. Matching Theory. American mathematical society, 2009. Google Scholar
  12. Barna Saha and Aravind Srinivasan. A new approximation technique for resource-allocation problems. In Proc. 1st Symposium on Innovations in Computer Science, pages 342-357, 2010. Google Scholar
Questions / Remarks / Feedback
X

Feedback for Dagstuhl Publishing


Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail
© 2023-2025 Schloss Dagstuhl – LZI GmbH About DROPS Imprint Privacy Contact