Maximizing the Minimum Load for Selfish Agents

DOI10.1007/978-3-540-78773-0_23zbMATH Open1136.68352OpenAlexW2127213783MaRDI QIDQ5458534FDOQ5458534

Authors: Leah Epstein, Rob van Stee 

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

Recommendations

• Maximizing the minimum load for selfish agents
• Maximizing the minimum load: the cost of selfishness
• Selfish load balancing
• Tight bounds for selfish and greedy load balancing
• Tight Bounds for Selfish and Greedy Load Balancing

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (5)

• Maximizing the minimum load for selfish agents
• The cost of selfishness for maximizing the minimum load on uniformly related machines
• Title not available (Why is that?)
• Selfish load balancing
• Tight Bounds for Selfish and Greedy Load Balancing

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5458534)