The cost of selfishness for maximizing the minimum load on uniformly related machines

DOI10.1007/s10878-012-9555-yzbMath1291.90092OpenAlexW1991574533MaRDI QIDQ2015810

Elena Kleiman, Rob van Stee, Leah Epstein

Publication date: 24 June 2014

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/2381/37390

zbMATH Keywords

machine schedulingprice of anarchyprice of stabilitymaximizing the minimum load

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items

Inefficiency of Nash equilibrium for scheduling games with constrained jobs: a parametric analysis ⋮ Maximizing the minimum load: the cost of selfishness ⋮ On the price of anarchy of two-stage machine scheduling games ⋮ Inefficiency of the Nash equilibrium for selfish machine covering on two hierarchical uniform machines ⋮ On the sequential price of anarchy of isolation games

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• The structure and complexity of Nash equilibria for a selfish routing game
• The price of selfish routing
• Maximizing the minimum load for selfish agents
• A Unified Approach to Truthful Scheduling on Related Machines
• Performance Guarantees of Local Search for Multiprocessor Scheduling
• The Santa Claus problem
• Tight bounds for worst-case equilibria
• A linear time approximation algorithm for multiprocessor scheduling
• Truthful Approximation Schemes for Single-Parameter Agents
• The Price of Stability for Network Design with Fair Cost Allocation
• Convergence time to Nash equilibrium in load balancing
• Scheduling to Maximize the Minimum Processor Finish Time in a Multiprocessor System
• Bounds on Multiprocessing Timing Anomalies
• Max-min Online Allocations with a Reordering Buffer
• Approximation and Online Algorithms

This page was built for publication: The cost of selfishness for maximizing the minimum load on uniformly related machines