STACS 2005

DOI10.1007/b106485zbMath1118.90307OpenAlexW4230940848MaRDI QIDQ5710720

Nir Andelman, Motti Sorani, Yossi Azar

Publication date: 2 December 2005

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/b106485

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Approximation algorithms (68W25)

Related Items (20)

Approximations and auctions for scheduling batches on related machines ⋮ Truthful algorithms for scheduling selfish tasks on parallel machines ⋮ Approximate composable truthful mechanism design ⋮ Approximate Truthful Mechanism Design for Two-Dimensional Orthogonal Knapsack Problem ⋮ Well-behaved online load balancing against strategic jobs ⋮ Distributed algorithmic mechanism design for scheduling on unrelated machines ⋮ A lower bound of \(1+\varphi \) for truthful scheduling mechanisms ⋮ A monotone approximation algorithm for scheduling with precedence constraints ⋮ Optimal collusion-resistant mechanisms with verification ⋮ A General Scheme for Designing Monotone Algorithms for Scheduling Problems with Precedence Constraints ⋮ Multistage interval scheduling games ⋮ The power of verification for one-parameter agents ⋮ Preemptive Scheduling on Selfish Machines ⋮ Maximizing the Minimum Load for Selfish Agents ⋮ Fast payment schemes for truthful mechanisms with verification ⋮ Truthfulness for the Sum of Weighted Completion Times ⋮ Truthful mechanisms for two-range-values variant of unrelated scheduling ⋮ Fair cost-sharing methods for scheduling jobs on parallel machines ⋮ A lower bound for scheduling mechanisms ⋮ On truthfulness and approximation for scheduling selfish tasks

This page was built for publication: STACS 2005