Max-min fair allocation for resources with hybrid divisibilities

作者：

Highlights：

• An approaximation algorithm for the case with bounded number of divisible resources.

• A 6+210+ε-approximation algorithm for the case where uij ∈ {0, uj}.

• A polynomial-time approximation algorithm for the general case.

摘要

•An approaximation algorithm for the case with bounded number of divisible resources.•A 6+210+ε-approximation algorithm for the case where uij ∈ {0, uj}.•A polynomial-time approximation algorithm for the general case.

论文关键词：Max-min fair allocation,Indivisible resources,Divisible resources,Multi-agent systems

论文评审过程：Received 10 August 2018, Revised 28 January 2019, Accepted 28 January 2019, Available online 29 January 2019, Version of Record 13 February 2019.

论文官网地址：https://doi.org/10.1016/j.eswa.2019.01.071