A Unified Approach to Truthful Scheduling on Related Machines

被引：6
|
作者：
Epstein, Leah [1 ]
Levin, Asaf [2 ]
van Stee, Rob [3 ]
机构：
[1] Univ Haifa, Dept Math, IL-3498838 Haifa, Israel
[2] Technion Israel Inst Technol, Fac Ind Engn & Management, IL-3200003 Haifa, Israel
[3] Univ Leicester, Dept Comp Sci, Leicester LE1 7RH, Leics, England
来源：
MATHEMATICS OF OPERATIONS RESEARCH | 2016年 / 41卷 / 01期
关键词：
scheduling; monotone approximation algorithms; algorithmic game theory; APPROXIMATION SCHEMES; ALGORITHMS; MECHANISMS; BOUNDS; LOAD;
D O I：
10.1287/moor.2015.0730
中图分类号：
C93 [管理学]; O22 [运筹学];
学科分类号：
070105 ; 12 ; 1201 ; 1202 ; 120202 ;
摘要：
We present a unified framework for designing deterministic monotone polynomial time approximation schemes (PTASs) for a wide class of scheduling problems on uniformly related machines. This class includes (among others) minimizing the makespan, maximizing the minimum load, and minimizing the p-norm of the machine loads vector. Previously, this kind of result was only known for the makespan objective. Monotone algorithms have the property that an increase in the speed of a machine cannot decrease the amount of work assigned to it. Our results imply the existence of a truthful mechanism that can be implemented in polynomial time, where the social goal is approximated within arbitrary precision.
引用
收藏
页码：332 / 351
页数：20
相关论文
共 50 条
  • [1] A Unified Approach to Truthful Scheduling on Related Machines
    Epstein, Leah
    Levin, Asaf
    van Stee, Rob
    [J]. PROCEEDINGS OF THE TWENTY-FOURTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS (SODA 2013), 2013, : 1243 - 1252
  • [2] A DETERMINISTIC TRUTHFUL PTAS FOR SCHEDULING RELATED MACHINES
    Christodoulou, George
    Kovacs, Annamaria
    [J]. SIAM JOURNAL ON COMPUTING, 2013, 42 (04) : 1572 - 1595
  • [3] A deterministic truthful PTAS for scheduling related machines
    Christodoulou, George
    Kovacs, Annamaria
    [J]. PROCEEDINGS OF THE TWENTY-FIRST ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 2010, 135 : 1005 - +
  • [4] Truthful approximation mechanisms for scheduling selfish related machines
    Andelman, Nir
    Azar, Yossi
    Sorani, Motti
    [J]. THEORY OF COMPUTING SYSTEMS, 2007, 40 (04) : 423 - 436
  • [5] Deterministic truthful approximation mechanisms for scheduling related machines
    Auletta, V
    De Prisco, R
    Penna, P
    Persiano, G
    [J]. STACS 2004, PROCEEDINGS, 2004, 2996 : 608 - 619
  • [6] Truthful approximation mechanisms for scheduling selfish related machines
    Andelman, N
    Azar, Y
    Sorani, M
    [J]. STACS 2005, PROCEEDINGS, 2005, 3404 : 69 - 82
  • [7] Truthful Approximation Mechanisms for Scheduling Selfish Related Machines
    Nir Andelman
    Yossi Azar
    Motti Sorani
    [J]. Theory of Computing Systems, 2007, 40 : 423 - 436
  • [8] A Unified Approach to Scheduling on Unrelated Parallel Machines
    Kumar, V. S. Anil
    Marathe, Madhav V.
    Parthasarathy, Srinivasan
    Srinivasan, Aravind
    [J]. JOURNAL OF THE ACM, 2009, 56 (05)
  • [9] Randomized Truthful Mechanisms for Scheduling Unrelated Machines
    Lu, Pinyan
    Yu, Changyuan
    [J]. INTERNET AND NETWORK ECONOMICS, PROCEEDINGS, 2008, 5385 : 402 - 413
  • [10] An improved randomized truthful mechanism for scheduling unrelated machines
    Lu, Pinyan
    Yu, Changyuan
    [J]. STACS 2008: PROCEEDINGS OF THE 25TH INTERNATIONAL SYMPOSIUM ON THEORETICAL ASPECTS OF COMPUTER SCIENCE, 2008, : 527 - 538
12345