Fair Queuing and Other Probabilistic Allocation Methods
Mathematics of Operations Research
On approximately fair allocations of indivisible goods
EC '04 Proceedings of the 5th ACM conference on Electronic commerce
Approximate mechanism design without money
Proceedings of the 10th ACM conference on Electronic commerce
Finding approximate competitive equilibria: efficient and fair course allocation
Proceedings of the 9th International Conference on Autonomous Agents and Multiagent Systems: volume 1 - Volume 1
The reservoir model and architecture for open federated cloud computing
IBM Journal of Research and Development
Dominant resource fairness: fair allocation of multiple resource types
Proceedings of the 8th USENIX conference on Networked systems design and implementation
No justified complaints: on fair sharing of multiple resources
Proceedings of the 3rd Innovations in Theoretical Computer Science Conference
Proceedings of the 11th International Conference on Autonomous Agents and Multiagent Systems - Volume 2
Multi-resource fair queueing for packet processing
Proceedings of the ACM SIGCOMM 2012 conference on Applications, technologies, architectures, and protocols for computer communication
Multi-resource fair queueing for packet processing
ACM SIGCOMM Computer Communication Review - Special october issue SIGCOMM '12
Mechanism design for fair division: allocating divisible items without payments
Proceedings of the fourteenth ACM conference on Electronic commerce
Cake cutting: not just child's play
Communications of the ACM
No agent left behind: dynamic fair division of multiple resources
Proceedings of the 2013 international conference on Autonomous agents and multi-agent systems
Hierarchical scheduling for diverse datacenter workloads
Proceedings of the 4th annual Symposium on Cloud Computing
Market mechanisms for managing datacenters with heterogeneous microarchitectures
ACM Transactions on Computer Systems (TOCS)
REF: resource elasticity fairness with sharing incentives for multiprocessors
Proceedings of the 19th international conference on Architectural support for programming languages and operating systems
Balancing fairness and efficiency in tiered storage systems with bottleneck-aware allocation
FAST'14 Proceedings of the 12th USENIX conference on File and Storage Technologies
| Hi-index | 0.02 |
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.