Maximizing the Minimum Load for Selfish Agents

DOI10.1007/978-3-540-78773-0_23zbMath1136.68352OpenAlexW2127213783MaRDI QIDQ5458534

Rob van Stee, Leah Epstein

Publication date: 15 April 2008

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

Full work available at URL: https://doi.org/10.1007/978-3-540-78773-0_23

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Cites Work

• The exact LPT-bound for maximizing the minimum completion time
• A polynomial-time approximation scheme for maximizing the minimum machine completion time
• Truthful approximation mechanisms for restricted combinatorial auctions
• The Santa Claus problem
• Scheduling to Maximize the Minimum Processor Finish Time in a Multiprocessor System
• STACS 2004
• Algorithms – ESA 2005
• Bounds for Certain Multiprocessing Anomalies
• STACS 2005
• On-line machine covering
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Maximizing the Minimum Load for Selfish Agents