An algorithm for the fair resource allocation problem with a submodular constraint
- 43 Downloads
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.
Key wordsalgorithm continuous optimal solution resource allocation problem submodular constraint
- M.L. Balinski and H.P. Young, Fair Representation — Meeting the Ideal of One Man, One Vote. Yale Univ. Press, New Haven, 1982.Google Scholar
- N. Katoh, Studies on combinatorial optimization algorithms. Ph. D. Thesis, Department of Applied Mathematics and Physics, Kyoto Univ., 1980.Google Scholar
- L. Lovász, Submodular functions and convexity. Mathematical Programming: The State of the Art (eds. A. Bachem, M. Grötschel, and B. Korte), Springer-Verlag, New York, 1983.Google Scholar
- K. Namikawa, N. Katoh and T. Ibaraki, An algorithm for the fair resource allocation problem based on the continuous optimal solution (in Japanese). Proceedings of the Fall Conference of Operations Research Society of Japan, 1988, 28–29.Google Scholar