On-line routing of virtual circuits with applications to load balancing and machine scheduling
Journal of the ACM (JACM)
Algorithmic mechanism design (extended abstract)
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Computationally feasible VCG mechanisms
Proceedings of the 2nd ACM conference on Electronic commerce
Algorithms, games, and the internet
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
On-line Load Balancing for Related Machines
WADS '97 Proceedings of the 5th International Workshop on Algorithms and Data Structures
Truthful Mechanisms for One-Parameter Agents
FOCS '01 Proceedings of the 42nd IEEE symposium on Foundations of Computer Science
Truthful algorithms for scheduling selfish tasks on parallel machines
Theoretical Computer Science
Fast monotone 3-approximation algorithm for scheduling related machines
ESA'05 Proceedings of the 13th annual European conference on Algorithms
Truthful algorithms for scheduling selfish tasks on parallel machines
WINE'05 Proceedings of the First international conference on Internet and Network Economics
Truthful approximation mechanisms for scheduling selfish related machines
STACS'05 Proceedings of the 22nd annual conference on Theoretical Aspects of Computer Science
Scheduling selfish tasks: about the performance of truthful algorithms
COCOON'07 Proceedings of the 13th annual international conference on Computing and Combinatorics
| Hi-index | 0.00 |
We consider the problem of designing monotone deterministic algorithms for scheduling tasks on related machines in order to minimize the makespan. Several recent papers showed that monotonicity is a fundamental property to design truthful mechanisms for this scheduling problem. We give both theoretical and experimental results. For the case of two machines, when speeds of the machines are restricted to be powers of a given constant c 0, we prove that algorithm Largest Processing Time is monotone for any c ≥ 2 while it is not monotone for c ≤ 1.78; algorithm List Scheduling, instead, is monotone only for c 2. For the case of m machines we restrict our attention to the class of “greedy-like” monotone algorithms defined in [AP04]. We propose the greedy–like algorithm Uniform_RR and we prove that it is monotone when speeds are powers of a given integer constant c 0 and it obtains an approximation ratio that is not worse than algorithm Uniform, proposed in [AP04]. We also experimentally compare performances of Uniform, Uniform_RR, LPT, and several other monotone and greedy–like heuristics.