License
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.ICALP.2018.37
URN: urn:nbn:de:0030-drops-90418
URL: http://drops.dagstuhl.de/opus/volltexte/2018/9041/
Go to the corresponding LIPIcs Volume Portal


Cheng, Siu-Wing ; Mao, Yuchen

Restricted Max-Min Fair Allocation

pdf-format:
LIPIcs-ICALP-2018-37.pdf (0.5 MB)


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.

BibTeX - Entry

@InProceedings{cheng_et_al:LIPIcs:2018:9041,
  author =	{Siu-Wing Cheng and Yuchen Mao},
  title =	{{Restricted Max-Min Fair Allocation}},
  booktitle =	{45th International Colloquium on Automata, Languages, and  Programming (ICALP 2018)},
  pages =	{37:1--37:13},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-076-7},
  ISSN =	{1868-8969},
  year =	{2018},
  volume =	{107},
  editor =	{Ioannis Chatzigiannakis and Christos Kaklamanis and D{\'a}niel Marx and Donald Sannella},
  publisher =	{Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{http://drops.dagstuhl.de/opus/volltexte/2018/9041},
  URN =		{urn:nbn:de:0030-drops-90418},
  doi =		{10.4230/LIPIcs.ICALP.2018.37},
  annote =	{Keywords: Fair allocation, approximation, local search}
}

Keywords: Fair allocation, approximation, local search
Seminar: 45th International Colloquium on Automata, Languages, and Programming (ICALP 2018)
Issue Date: 2018
Date of publication: 29.06.2018


DROPS-Home | Imprint | Privacy Published by LZI