user

Truthful Approximation Mechanisms for Scheduling Selfish Related Machines

被引：0
|
作者：
Nir Andelman
Yossi Azar
Motti Sorani
机构：
[1] Computer Science,
[2] Tel-Aviv University,undefined
来源：
Theory of Computing Systems | 2007年 / 40卷
关键词：
Payment Scheme; Maximum Completion Time; Deterministic Mechanism; Fast Machine; Related Machine;
D O I：
暂无
中图分类号：
学科分类号：
摘要：
We consider the problem of scheduling jobs on related machines owned by selfish agents. We provide a 5-approximation deterministic truthful mechanism, the first deterministic truthful result for the problem. Previously, Archer and Tardos showed a 2-approximation randomized mechanism which is truthful in expectation only (a weaker notion of truthfulness). In case the number of machines is constant, we provide a deterministic Fully Polynomial-Time Approximation Scheme (FPTAS) and a suitable payment scheme that yields a truthful mechanism for the problem. This result, which is based on converting FPTAS to monotone FPTAS, improves a previous result of Auletta et al., who showed a (4 + ε)-approximation truthful mechanism.
引用
收藏
页码：423 / 436
页数：13
相关论文
共 50 条
  • [1] Truthful approximation mechanisms for scheduling selfish related machines
    Andelman, Nir
    Azar, Yossi
    Sorani, Motti
    [J]. THEORY OF COMPUTING SYSTEMS, 2007, 40 (04) : 423 - 436
  • [2] Truthful approximation mechanisms for scheduling selfish related machines
    Andelman, N
    Azar, Y
    Sorani, M
    [J]. STACS 2005, PROCEEDINGS, 2005, 3404 : 69 - 82
  • [3] 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
  • [4] Truthful algorithms for scheduling selfish tasks on parallel machines
    Angel, E
    Bampis, E
    Pascual, F
    [J]. INTERNET AND NETWORK ECONOMICS, PROCEEDINGS, 2005, 3828 : 698 - 707
  • [5] Truthful algorithms for scheduling selfish tasks on parallel machines
    Angel, Eric
    Bampis, Evripidis
    Pascual, Fanny
    [J]. THEORETICAL COMPUTER SCIENCE, 2006, 369 (1-3) : 157 - 168
  • [6] Randomized truthful algorithms for scheduling selfish tasks on parallel machines
    Angel, Eric
    Bampis, Evripidis
    Thibault, Nicolas
    [J]. THEORETICAL COMPUTER SCIENCE, 2012, 414 (01) : 1 - 8
  • [7] New Bounds for Truthful Scheduling on Two Unrelated Selfish Machines
    Kuryatnikova, Olga
    Vera, Juan C.
    [J]. THEORY OF COMPUTING SYSTEMS, 2020, 64 (02) : 199 - 226
  • [8] New Bounds for Truthful Scheduling on Two Unrelated Selfish Machines
    Olga Kuryatnikova
    Juan C. Vera
    [J]. Theory of Computing Systems, 2020, 64 : 199 - 226
  • [9] Randomized Truthful Algorithms for Scheduling Selfish Tasks on Parallel Machines
    Angel, Eric
    Bampis, Evripidis
    Thibault, Nicolas
    [J]. LATIN 2010: THEORETICAL INFORMATICS, 2010, 6034 : 38 - +
  • [10] Randomized Truthful Mechanisms for Scheduling Unrelated Machines
    Lu, Pinyan
    Yu, Changyuan
    [J]. INTERNET AND NETWORK ECONOMICS, PROCEEDINGS, 2008, 5385 : 402 - 413
12345