Affiliation:
1. Harvard University
2. Carnegie Mellon University
Abstract
We study the problem of allocating multiple resources to agents with heterogeneous demands. Technological advances such as cloud computing and data centers provide a new impetus for investigating this problem under the assumption that agents demand the resources in fixed proportions, known in economics as
Leontief
preferences
. In a recent paper, Ghodsi et al. [2011] introduced the
dominant resource fairness
(DRF) mechanism, which was shown to possess highly desirable theoretical properties under Leontief preferences. We extend their results in three directions. First, we show that DRF generalizes to more expressive settings, and leverage a new technical framework to formally extend its guarantees. Second, we study the relation between social welfare and properties such as truthfulness; DRF performs poorly in terms of social welfare, but we show that this is an unavoidable shortcoming that is shared by every mechanism that satisfies one of three basic properties. Third, and most importantly, we study a realistic setting that involves indivisibilities. We chart the boundaries of the possible in this setting, contributing a new relaxed notion of fairness and providing both possibility and impossibility results.
Funder
CMU-MSR Center for Computational Thinking
NSF
Publisher
Association for Computing Machinery (ACM)
Subject
Computational Mathematics,Marketing,Economics and Econometrics,Statistics and Probability,Computer Science (miscellaneous)
Reference18 articles.
1. The Combinatorial Assignment Problem: Approximate Competitive Equilibrium from Equal Incomes
2. No justified complaints
3. E. J. Friedman A. Ghodsi S. Shenker and I. Stoica. 2011. Strategyproofness Leontief economies and the Kalai-Smorodinsky solution. Manuscript. E. J. Friedman A. Ghodsi S. Shenker and I. Stoica. 2011. Strategyproofness Leontief economies and the Kalai-Smorodinsky solution. Manuscript.
Cited by
50 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献