Approximation algorithms for scheduling unrelated parallel machines
Mathematical Programming: Series A and B
An approximation algorithm for the generalized assignment problem
Mathematical Programming: Series A and B
Convex programming for scheduling unrelated parallel machines
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
Weak monotonicity suffices for truthfulness on convex domains
Proceedings of the 6th ACM conference on Electronic commerce
Truthful randomized mechanisms for combinatorial auctions
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
A BGP-based mechanism for lowest-cost routing
Distributed Computing - Special issue: PODC 02
Truthful mechanism design for multi-dimensional scheduling via cycle monotonicity
Proceedings of the 8th ACM conference on Electronic commerce
Setting lower bounds on truthfulness: extended abstract
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
A lower bound for scheduling mechanisms
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Probabilistic computations: Toward a unified measure of complexity
SFCS '77 Proceedings of the 18th Annual Symposium on Foundations of Computer Science
A lower bound of 1 + ϕ for truthful scheduling mechanisms
MFCS'07 Proceedings of the 32nd international conference on Mathematical Foundations of Computer Science
Mechanism design for fractional scheduling on unrelated machines
ICALP'07 Proceedings of the 34th international conference on Automata, Languages and Programming
| Hi-index | 5.23 |
We study the limitations 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: 1.We prove that any truthful deterministic mechanism and any universal truthful randomized mechanism for workload minimization in inter-domain routing cannot achieve approximation ratio better than 2. These results improve the current lower bounds of (1+5)/2~1.618 and (3+5)/4~1.309 due to Mu'alem and Schapira [A. Mu'alem, M. Schapira, Setting lower bounds on truthfulness, in: Proceedings 18th annual ACM-SIAM Symposium on Discrete Algorithms, 2007, pp. 1143-1152]. 2.We establish a lower bound of 1+2~2.414 on the achievable approximation guarantee of any truthful deterministic mechanism for unrelated machines scheduling when the number of machines is at least 3. This lower bound is comparable to a recent result by Christodoulou, Koutsoupias and Vidali [G. Christodoulou, E. Koutsoupias, A. Vidali, A lower bound for scheduling mechanisms, in: Proceedings 18th annual ACM-SIAM Symposium on Discrete Algorithms, 2007, pp. 1163-1170].