Beyond Dominant Resource Fairness

Author:

Parkes David C.1,Procaccia Ariel D.2,Shah Nisarg2

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篇论文的施引文献,订阅后可以查看论文全部施引文献

1. Dynamic Multi-Resource Fair Allocation with Elastic Demands;Journal of Grid Computing;2024-02-27

2. A Task Scheduling Algorithm for Micro-cloud Platform Based on Task Real-time;Proceedings of the 2023 2nd International Conference on Networks, Communications and Information Technology;2023-06-16

3. Privacy as a Resource in Differentially Private Federated Learning;IEEE INFOCOM 2023 - IEEE Conference on Computer Communications;2023-05-17

4. Multiresource fair allocation with time window constraints;The Journal of Supercomputing;2023-04-22

5. Multi-resource fair allocation with bandwidth requirement compression in the cloud–edge system;Computers and Electrical Engineering;2023-01

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3