Maximizing the minimum load for selfish agents

DOI10.1016/j.tcs.2009.08.032zbMath1187.68091OpenAlexW1999960472MaRDI QIDQ1041221

Leah Epstein, Rob van Stee

Publication date: 1 December 2009

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2009.08.032

zbMATH Keywords

schedulingselfish agentsmaximizing minimum loadmonotone approximation algorithms

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Approximation algorithms (68W25) Agent technology and artificial intelligence (68T42)

Related Items (8)

A truthful constant approximation for maximizing the minimum load on related machines ⋮ Maximizing the minimum load: the cost of selfishness ⋮ Reducing price of anarchy of selfish task allocation with more selfishness ⋮ An efficient polynomial time approximation scheme for load balancing on uniformly related machines ⋮ The resource dependent assignment problem with a convex agent cost function ⋮ The cost of selfishness for maximizing the minimum load on uniformly related machines ⋮ A Unified Approach to Truthful Scheduling on Related Machines ⋮ On the sequential price of anarchy of isolation games

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• The exact LPT-bound for maximizing the minimum completion time
• A polynomial-time approximation scheme for maximizing the minimum machine completion time
• Approximation schemes for scheduling and covering on unrelated machines
• Truthful approximation mechanisms for restricted combinatorial auctions
• Truthful approximation mechanisms for scheduling selfish related machines
• The Santa Claus problem
• Frugal path mechanisms
• Truthful Approximation Schemes for Single-Parameter Agents
• Scheduling to Maximize the Minimum Processor Finish Time in a Multiprocessor System
• An Approximate Truthful Mechanism for Combinatorial Auctions with Single Parameter Agents
• STACS 2004
• Algorithms – ESA 2005
• Bounds for Certain Multiprocessing Anomalies
• On-line machine covering

This page was built for publication: Maximizing the minimum load for selfish agents