Data networks
Elements of information theory
Elements of information theory
Theoretical Computer Science
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
Beyond dominant resource fairness: extensions, limitations, and indivisibilities
Proceedings of the 13th ACM Conference on Electronic Commerce
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
On-line fair allocations based on bottlenecks and global priorities
Proceedings of the 4th ACM/SPEC International Conference on Performance Engineering
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
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 consider the age-old problem of allocating items among different agents in a way that is efficient and fair. Two papers, by Dolev et al. and Ghodsi et al., have recently studied this problem in the context of computer systems. Both papers had similar models for agent preferences, but advocated different notions of fairness. We formalize both fairness notions in economic terms, extending them to apply to a larger family of utilities. Noting that in settings with such utilities efficiency is easily achieved in multiple ways, we study notions of fairness as criteria for choosing between different efficient allocations. Our technical results are algorithms for finding fair allocations corresponding to two fairness notions: Regarding the notion suggested by Ghodsi et al., we present a polynomial-time algorithm that computes an allocation for a general class of fairness notions, in which their notion is included. For the other, suggested by Dolev et al., we show that a competitive market equilibrium achieves the desired notion of fairness, thereby obtaining a polynomial-time algorithm that computes such a fair allocation and solving the main open problem raised by Dolev et al.