A Lower Bound for Scheduling MechanismsReport as inadecuate




A Lower Bound for Scheduling Mechanisms - Download this document for free, or read online. Document in PDF available to download.

Algorithmica

, Volume 55, Issue 4, pp 729–740

First Online: 24 January 2008Received: 07 May 2007Accepted: 03 January 2008

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+\sqrt{2}\ for 3 or more machines.

KeywordsAlgorithmic mechanism design Scheduling unrelated machines Lower bound Supported in part by IST-15964 AEOLUS and the Greek GSRT.

Download to read the full article text



Author: George Christodoulou - Elias Koutsoupias - Angelina Vidali

Source: https://link.springer.com/







Related documents