Exact and Approximate Algorithms for Scheduling Nonidentical Processors
Journal of the ACM (JACM)
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Truthful Mechanisms for One-Parameter Agents
FOCS '01 Proceedings of the 42nd IEEE symposium on Foundations of Computer Science
Mechanisms for discrete optimization with rational agents
Mechanisms for discrete optimization with rational agents
Truthful approximation mechanisms for scheduling selfish related machines
STACS'05 Proceedings of the 22nd annual conference on Theoretical Aspects of Computer Science
Deterministic monotone algorithms for scheduling on related machines
WAOA'04 Proceedings of the Second international conference on Approximation and Online Algorithms
A sufficient condition for truthfulness with single parameter agents
EC '06 Proceedings of the 7th ACM conference on Electronic commerce
Truthful algorithms for scheduling selfish tasks on parallel machines
Theoretical Computer Science
Truthful mechanism design for multi-dimensional scheduling via cycle monotonicity
Proceedings of the 8th ACM conference on Electronic commerce
A lower bound for scheduling mechanisms
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Coordinating Competitive Agents in Dynamic Airport Resource Scheduling
MATES '07 Proceedings of the 5th German conference on Multiagent System Technologies
The power of verification for one-parameter agents
Journal of Computer and System Sciences
Approximation and Online Algorithms
Truthful mechanisms for two-range-values variant of unrelated scheduling
Theoretical Computer Science
Tighter approximation bounds for LPT scheduling in two special cases
Journal of Discrete Algorithms
Maximizing the minimum load for selfish agents
Theoretical Computer Science
Mechanism design for fractional scheduling on unrelated machines
ACM Transactions on Algorithms (TALG)
Cost sharing methods for makespan and completion time scheduling
STACS'07 Proceedings of the 24th annual conference on Theoretical aspects of computer science
Preemptive scheduling on selfish machines
CAAN'07 Proceedings of the 4th conference on Combinatorial and algorithmic aspects of networking
Maximizing the minimum load for selfish agents
LATIN'08 Proceedings of the 8th Latin American conference on Theoretical informatics
A deterministic truthful PTAS for scheduling related machines
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Distributed algorithmic mechanism design for scheduling on unrelated machines
Journal of Parallel and Distributed Computing
Lower bound for envy-free and truthful makespan approximation on related machines
SAGT'11 Proceedings of the 4th international conference on Algorithmic game theory
Truthful Approximation Schemes for Single-Parameter Agents
SIAM Journal on Computing
Decentralization and mechanism design for online machine scheduling
SWAT'06 Proceedings of the 10th Scandinavian conference on Algorithm Theory
Tighter approximation bounds for LPT scheduling in two special cases
CIAC'06 Proceedings of the 6th Italian conference on Algorithms and Complexity
A monotone approximation algorithm for scheduling with precedence constraints
Operations Research Letters
Approximations and auctions for scheduling batches on related machines
Operations Research Letters
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
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 scheduling n jobs to m machines of different speeds s.t. the makespan is minimized (Q||Cmax). We provide a fast and simple, deterministic monotone 3-approximation algorithm for Q||Cmax Monotonicity is relevant in the context of truthful mechanisms: when each machine speed is only known to the machine itself, we need to motivate that machines declare their true speeds to the scheduling mechanism. As shown by Archer and Tardos, such motivation is possible only if the scheduling algorithm used by the mechanism is monotone. The best previous monotone algorithm that is polynomial in m, was a 5-approximation by Andelman et al. A randomized 2-approximation method, satisfying a weaker definition of truthfulness, is given by Archer. As a core result, we prove the conjecture of Auletta et al., that the greedy algorithm (Lpt) is monotone if machine speeds are all integer powers of 2.