An Approximation Alaorithm for Max-Min Fair Allocation of Indivisible Goods

被引：0
|
作者：
Asadpour, Arash [1 ]
Saberi, Amin [1 ]
机构：
[1] Stanford Univ, Stanford, CA 94305 USA
来源：
STOC 07: PROCEEDINGS OF THE 39TH ANNUAL ACM SYMPOSIUM ON THEORY OF COMPUTING | 2007年
关键词：
Approximation Algorithms; Randomized Rounding; Game Theory;
D O I：
暂无
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
In this paper we give the first approximation algorithm for the problem of max-min fair allocation of indivisible goods. The approximation ratio of our algorithm is Omega(1/root k log(3) k). As a part of our algorithm, we design an iterative method for rounding a fractional matching on a tree which might be of independent interest.
引用
收藏
页码：114 / 121
页数：8
相关论文
共 50 条
  • [41] Computing optimal max-min fair resource allocation for elastic flows
    Nace, Dritan
    Doan, Nhat-Linh
    Gourdin, Eric
    Liau, Bernard
    [J]. IEEE-ACM TRANSACTIONS ON NETWORKING, 2006, 14 (06) : 1272 - 1281
  • [42] Can the Max-Min Fair Allocation Be Trustful in a Centralized Resource System?
    Chen, Zheng
    Gu, Zhaoquan
    Wang, Yuexuan
    [J]. WIRELESS ALGORITHMS, SYSTEMS, AND APPLICATIONS, PT I, 2020, 12384 : 51 - 64
  • [43] Utility Max-Min Fair Rate Allocation for Multiuser Multimedia Communications
    Zhang, Qing
    Liu, Guizhong
    Li, Fan
    [J]. ADVANCES IN MULTIMEDIA MODELING, PT I, 2011, 6523 : 470 - 480
  • [44] Max-min fair survivable networks
    Bashllari, A.
    Nace, D.
    Gourdin, E.
    Klopfenstein, O.
    [J]. ANNALS OF TELECOMMUNICATIONS, 2008, 63 (9-10) : 511 - 522
  • [45] Groupwise Maximin Fair Allocation of Indivisible Goods
    Barman, Siddharth
    Biswas, Arpita
    Krishnamurthy, Sanath Kumar
    Narahari, Yadati
    [J]. THIRTY-SECOND AAAI CONFERENCE ON ARTIFICIAL INTELLIGENCE / THIRTIETH INNOVATIVE APPLICATIONS OF ARTIFICIAL INTELLIGENCE CONFERENCE / EIGHTH AAAI SYMPOSIUM ON EDUCATIONAL ADVANCES IN ARTIFICIAL INTELLIGENCE, 2018, : 916 - 923
  • [46] FAIR ALLOCATION OF INDIVISIBLE GOODS AND CRITERIA OF JUSTICE
    ALKAN, A
    DEMANGE, G
    GALE, D
    [J]. ECONOMETRICA, 1991, 59 (04) : 1023 - 1039
  • [47] Fair Allocation of Indivisible Goods: Improvements and Generalizations
    Ghodsi, Mohammad
    Hajiaghayi, MohammadTaghi
    Seddighin, Masoud
    Seddighin, Saeed
    Yami, Hadi
    [J]. ACM EC'18: PROCEEDINGS OF THE 2018 ACM CONFERENCE ON ECONOMICS AND COMPUTATION, 2018, : 539 - 556
  • [48] Lexicographic max-min fair rate allocation in random access wireless networks
    Wang, Xin
    Kar, Koushik
    Pang, Jong-Shi
    [J]. PROCEEDINGS OF THE 45TH IEEE CONFERENCE ON DECISION AND CONTROL, VOLS 1-14, 2006, : 1294 - 1300
  • [49] A Weighted Max-Min fair rate allocation for available bit rate service
    Hou, YT
    Tzeng, HHY
    Panwar, SS
    [J]. GLOBECOM 97 - IEEE GLOBAL TELECOMMUNICATIONS CONFERENCE, CONFERENCE RECORD, VOLS 1-3, 1997, : 492 - 497
  • [50] Fair Allocation of Indivisible Goods to Asymmetric Agents
    Farhadi, Alireza
    Ghodsi, Mohammad
    Hajiaghayi, MohammadTaghi
    Lahaie, Sebastien
    Pennock, David
    Seddighin, Masoud
    Seddighin, Saeed
    Yami, Hadi
    [J]. JOURNAL OF ARTIFICIAL INTELLIGENCE RESEARCH, 2019, 64 : 1 - 20
12345