Beyond dominant resource fairness: Extensions, limitations, and indivisibilities

ACM Transactions on Economics and Computation

Volumn 3, Issue 1, 2015, Pages

  Parkes, David C ^a   Procaccia, Ariel D ^b   Shah, Nisarg ^b  

^a HARVARD UNIVERSITY   (United States)

^b Carnegie Mellon University   (United States)

Author keywords

Fair division; Resource allocation

Indexed keywords

DISTRIBUTED COMPUTER SYSTEMS; RESOURCE ALLOCATION;

DATA CENTERS; FAIR DIVISIONS; HETEROGENEOUS DEMAND; IMPOSSIBILITY RESULTS; MULTIPLE RESOURCES; SOCIAL WELFARE; TECHNICAL FRAMEWORKS; TECHNOLOGICAL ADVANCES;

ECONOMICS;

EID: 85037613647     PISSN: 21678375     EISSN: 21678383     Source Type: Journal    
DOI: 10.1145/2739040     Document Type: Conference Paper

References (18)

1. E. Budish. 2011. The combinatorial assignment problem: Approximate competitive equilibrium from equal incomes. J. Political Economy 119, 6, 1061-1103.
2. D. Dolev, D. G. Feitelson, J. Y. Halpern, R. Kupferman, and N. Linial. 2012. No justified complaints: On fair sharing of multiple resources. In Proceedings of the 3rd Innovations in Theoretical Computer Science Conference. 68-75.
3. E. J. Friedman, A. Ghodsi, S. Shenker, and I. Stoica. 2011. Strategyproofness, Leontief economies and the Kalai-Smorodinsky solution. Manuscript.
4. A. Ghodsi, M. Zaharia, B. Hindman, A. Konwinski, S. Shenker, and I. Stoica. 2011. Dominant resource fairness: Fair allocation of multiple resource types. In Proceedings of the 8th USENIX Conference on Networked Systems Design and Implementation. 24-37.
5. A. Gutman and N. Nisan. 2012. Fair allocation without trade. In Proceedings of the 11th International Joint Conference on Autonomous Agents and Multi-Agent Systems. 719-728.
6. I. Kash, A. D. Procaccia, and N. Shah. 2013. No agent left behind: Dynamic fair division of multiple resources. In Proceedings of the 12th International Joint Conference on Autonomous Agents and MultiAgent Systems.
7. J. Li and J. Xue. 2011. Egalitarian division under Leontief preferences. Economic Theory, 1-26.
8. R. J. Lipton, E. Markakis, E. Mossel, and A. Saberi. 2004. On approximately fair allocations of indivisible goods. In Proceedings of the 6th ACM Conference on Electronic Commerce. 125-131.
9. H. Moulin. 2003. Fair Division and Collective Welfare. MIT Press.
10. H. Moulin and R. Stong. 2002. Fair queuing and other probabilistic allocation methods. Math. Operations Res. 27, 1, 1-30.
11. A. Nicolò. 2004. Efficiency and truthfulness with Leontief preferences. A note on two-agent, two-good economies. Rev. Economic Design 8, 4, 373-382.
12. A. Othman, T. Sandholm, and E. Budish. 2010. Finding approximate competitive equilibria: Efficient and fair course allocation. In Proceedings of the 9th International Joint Conference on Autonomous Agents and Multi-Agent Systems. 873-880.
13. D. C. Parkes. 2007. Online mechanisms. In Algorithmic Game Theory, N. Nisan, T. Roughgarden, É. Tardos, and V. Vazirani (Eds.), Cambridge University Press, Chapter 16.
14. E. Pazner and D. Schmeidler. 1978. Egalitarian equivalent allocations: A new concept of economic equity. Quart. J. Economics 92, 4, 671-687.
15. A. D. Procaccia and M. Tennenholtz. 2009. Approximate mechanism design without money. In Proceedings of the 10th ACM Conference on Electronic Commerce. 177-186.
16. B. Rochwerger, D. Breitgand, E. Levy, A. Galis, K. Nagin, I. Llorente, R. Montero, Y. Wolfsthal, E. Elmroth, J. Cáceres, M. Ben-Yehuda, W. Emmerich, and F. Galán. 2009. The RESERVOIR model and architecture for open federated cloud computing. IBM J. Res. Dev. 53, 4.
17. H. Varian. 1974. Equity, envy and efficiency. J. Economic Theory 9, 63-91.
18. J. Zou, S. Gujar, and D. C. Parkes. 2010. Tolerable manipulability in dynamic assignment without money. In Proceedings of the 24th AAAI Conference on Artificial Intelligence. 947-952.