Fair Allocation of Multiple Resources Using a Non-monetary Allocation Mechanism
The fair allocation of scarce resources is relevant to a wide field of applications. For example, cloud resources, such as CPU, RAM, disk space, and bandwidth, have to be shared. This paper presents a mechanism to find fair allocations of multiple divisible resources, which, contrary to other mechanisms, is applicable to but not limited to the example above. Wide applicability of the mechanism is achieved by designing it (1) to scale with the number of consumers and resources, (2) to allow for arbitrary preference functions of consumers, and (3) to not rely on monetary compensation. The mechanism uses a mathematical definition of greediness to balance resources consumers receive and thereby to compute a fair allocation.
KeywordsResource Allocation Fairness Multiple Resources
- 1.Brams, S.: Mathematics and Democracy. Princeton University Press (2008)Google Scholar
- 2.Moulin, H.: Fair Division and Collective Welfare. The MIT Press (2004)Google Scholar
- 5.Brams, S., Kilgour, M., Klamler, C.: The Undercut Procedure: An Algorithm for the Envy-free Division of Indivisible Items. MPRA Paper 12774 (2009), http://ideas.repec.org/p/pra/mprapa/12774.html
- 6.Schulman, L., Vazirani, V.: Allocation of Divisible Goods Under Lexicographic Preferences. Computer Research Repository (2012), http://arxiv.org/abs/1206.4366
- 8.Chorppath, A., Bhashyam, S., Sundaresan, R.: Almost Budget-balanced Mechanisms for Allocation of Divisible Resources. In: 47th Annual Allerton Conference on Communication, Control, and Computing, pp. 1120–1125 (2009)Google Scholar