A lower bound for scheduling mechanisms

被引：0

作者：

Christodoulou, George ^{[1
]}

Koutsoupias, Elias ^{[2
]}

Vidali, Angelina ^{[2
]}

机构：

[1] Max Planck Inst Informat, Saarbrucken, Germany

[2] Univ Athens, Dept Informat, Athens, Greece

来源：

PROCEEDINGS OF THE EIGHTEENTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS | 2007年

关键词：

D O I：

暂无

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

We study the mechanism design problem of scheduling tasks on n unrelated machines in which the machines are the players of the mechanism. The problem was proposed and studied in the seminal paper of Nisan and Ronen, where it was shown that the approximation ratio of mechanisms is between 2 and n. We improve the lower bound to 1 + root 2 for 3 or more machines.

引用

页码：1163 / +

页数：3