Improved Lower Bounds for Non-utilitarian Truthfulness

• Published in: Approximation and Online Algorithms Vol. 4927; pp. 15 - 26
• Main Author: Gamzu, Iftah
• Format: Book Chapter
• Language: English
• Published: Germany Springer Berlin / Heidelberg 2008; Springer Berlin Heidelberg
• Series: Lecture Notes in Computer Science
• Subjects: Algorithms & data structures; Allocation Algorithm; Approximation Ratio; Discrete mathematics; Outgoing Edge; Software Engineering; Task Allocation; Valuation Function
• ISBN: 3540779175; 9783540779179
• ISSN: 0302-9743; 1611-3349
• DOI: 10.1007/978-3-540-77918-6_2

One of the most fundamental results in the field of mechanism design states that every utilitarian social choice function admits a mechanism that truthfully implements it. In stark contrast with this finding, when one considers a non-utilitarian social choice function, it turns out that no guarantees can be made, i.e. there are non-utilitarian functions, which cannot be truthfully implemented. In light of this state of affairs, one of the most natural and intriguing objectives of research is to understand the inherent limitations in the infrastructure of truthful mechanisms for non-utilitarian social choice functions. In this paper, we focus our attention on studying the boundaries imposed by truthfulness for two non-utilitarian multi-parameter optimization problems. The first is the workload minimization in inter-domain routing problem, and the other is the unrelated machines scheduling problem. Our main findings can be briefly summarized as follows: We prove that any truthful deterministic mechanism, and any universal truthful randomized mechanism for the workload minimization in inter-domain routing problem cannot achieve an approximation guarantee that is better than 2. These results improve the current lower bounds of \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$(1 + \sqrt{5}) / 2 \approx 1.618$\end{document} and \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$(3 + \sqrt{5}) / 4 \approx 1.309$\end{document}, which are due to Mu’alem and Schapira [SODA ’07].We establish a lower bound of \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$1 + \sqrt{2} \approx 2.414$\end{document} on the achievable approximation ratio of any truthful deterministic mechanism for the unrelated machines scheduling problem when the number of machines is at least 3. This lower bound is comparable to a recent result by Christodoulou, Koutsoupias and Vidali [SODA ’07]. Nevertheless, our approach is considerably simpler, and thus may shed some new light on the core of this problem.