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 条
  • [1] AN APPROXIMATION ALGORITHM FOR MAX-MIN FAIR ALLOCATION OF INDIVISIBLE GOODS
    Asadpour, Arash
    Saberi, Amin
    [J]. SIAM JOURNAL ON COMPUTING, 2010, 39 (07) : 2970 - 2989
  • [2] On the Max-Min Fair Stochastic Allocation of Indivisible Goods
    Kawase, Yasushi
    Sumita, Hanna
    [J]. THIRTY-FOURTH AAAI CONFERENCE ON ARTIFICIAL INTELLIGENCE, THE THIRTY-SECOND INNOVATIVE APPLICATIONS OF ARTIFICIAL INTELLIGENCE CONFERENCE AND THE TENTH AAAI SYMPOSIUM ON EDUCATIONAL ADVANCES IN ARTIFICIAL INTELLIGENCE, 2020, 34 : 2070 - 2078
  • [3] Approximate Solutions To Max-Min Fair and Proportionally Fair Allocations of Indivisible Goods
    Nhan-Tam Nguyen
    Trung Thanh Nguyen
    Rothe, Joerg
    [J]. AAMAS'17: PROCEEDINGS OF THE 16TH INTERNATIONAL CONFERENCE ON AUTONOMOUS AGENTS AND MULTIAGENT SYSTEMS, 2017, : 262 - 271
  • [4] Algorithms for Max-Min Share Fair Allocation of Indivisible Chores
    Aziz, Haris
    Rauchecker, Gerhard
    Schryen, Guido
    Walsh, Toby
    [J]. THIRTY-FIRST AAAI CONFERENCE ON ARTIFICIAL INTELLIGENCE, 2017, : 335 - 341
  • [5] Online Max-min Fair Allocation
    Kawase, Yasushi
    Sumita, Hanna
    [J]. ALGORITHMIC GAME THEORY, SAGT 2022, 2022, 13584 : 526 - 543
  • [6] General Max-Min Fair Allocation
    Ko, Sheng-Yen
    Chen, Ho-Lin
    Cheng, Siu-Wing
    Hon, Wing-Kai
    Liao, Chung-Shou
    [J]. COMPUTING AND COMBINATORICS (COCOON 2021), 2021, 13025 : 63 - 75
  • [7] Asymptotic optimality of the max-min fair allocation
    Ye, Heng-Qing
    Yao, David D.
    [J]. WODES 2006: EIGHTH INTERNATIONAL WORKSHOP ON DISCRETE EVENT SYSTEMS, PROCEEDINGS, 2006, : 352 - +
  • [8] Approximation algorithms for the max-min allocation problem
    Khot, Subhash
    Ponnuswami, Ashok Kumar
    [J]. APPROXIMATION, RANDOMIZATION, AND COMBINATORIAL OPTIMIZATION: ALGORITHMS AND TECHNIQUES, 2007, 4627 : 204 - +
  • [9] MaxNet: an efficient max-min fair allocation scheme
    Nguyen, DD
    Wang, JD
    Andrew, L
    Chan, S
    [J]. PERFORMANCE CHALLENGES FOR EFFICIENT NEXT GENERATION NETWORKS, VOLS 6A-6C, 2005, 6A-6C : 79 - 89
  • [10] On (1, ε)-Restricted Max-Min Fair Allocation Problem
    Chan, T. -H. Hubert
    Tang, Zhihao Gavin
    Wu, Xiaowei
    [J]. ALGORITHMICA, 2018, 80 (07) : 2181 - 2200
12345