Abstract
The fair resource allocation problem is to allocate a given amount of discrete resources to a given set of activities in the fairest manner. This problem has recently been generalized to one with submodular constraints, which includes as special cases many important constraints encountered in practice, such as nested, tree and network types. In this paper, we propose a new algorithm that first solves its continuous version and then modifies the continuous solution into an integer optimal solution. It is shown that the time complexity of the new method is less than that of the previously known algorithms if the continous version can be solved efficiently. Some examples are also discussed.
Published Version
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call