A lower bound for scheduling mechanisms

Abstract

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 on algorithmic mechanism design, where it was shown that the approximation ratio of mechanisms is between 2 and n. We improve the lower bound to 1+ √2 for 3 or more machines. © 2008 Springer Science+Business Media, LLC.