Optimal Lower Bounds for Anonymous Scheduling Mechanisms
Author(s)Ashlagi, Itai; Dobzinski, Shahar; Lavi, Ron
MetadataShow full item record
We consider the problem of designing truthful mechanisms on m unrelated machines, to minimize some optimization goal. Nisan and Ronen [Nisan, N., A. Ronen. 2001. Algorithmic mechanism design. Games Econom. Behav. 35 166–196] consider the specific goal of makespan minimization, and show a lower bound of 2, and an upper bound of m. This large gap inspired many attempts that yielded positive results for several special cases, but very partial success for the general case: the lower bound was slightly increased to 2.61 by Christodoulou et al. [Christodoulou, G., E. Koutsoupias, A. Kovács. 2010. Mechanism design for fractional scheduling on unrelated machines. ACM Trans. Algorithms (TALG) 6(2) 1–18] and Koutsoupias and Vidali [Koutsoupias, E., A. Vidali. 2007. A lower bound of 1+phi for truthful scheduling mechanisms. Proc. 32nd Internat. Sympos. Math. Foundations Comput. Sci. (MFCS)], while the best upper bound remains unchanged. In this paper we show the optimal lower bound on truthful anonymous mechanisms: no such mechanism can guarantee an approximation ratio better than m. Moreover, our proof yields similar optimal bounds for two other optimization goals: the sum of completion times and the lp norm of the schedule.
DepartmentSloan School of Management
Mathematics of Operations Research
Institute for Operations Research and the Management Sciences (INFORMS)
Ashlagi, Itai, Shahar Dobzinski, and Ron Lavi. “Optimal Lower Bounds for Anonymous Scheduling Mechanisms.” Mathematics of Operations Research 37, no. 2 (May 2012): 244–258.
Author's final manuscript