The Price of Anarchy on Uniformly Related Machines Revisited

DOI10.1007/978-3-540-79309-0_6zbMATH Open1136.91351OpenAlexW1586529440MaRDI QIDQ5459971FDOQ5459971

Authors: Leah Epstein, Rob van Stee 

Publication date: 2 May 2008

Published in: Algorithmic Game Theory (Search for Journal in Brave)

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

Recommendations

• The price of anarchy on uniformly related machines revisited
• The Price of Anarchy for Minsum Related Machine Scheduling
• The price of anarchy for utilitarian scheduling games on related machines
• The cost of selfishness for maximizing the minimum load on uniformly related machines
• Selfish jobs with favorite machines: price of anarchy vs. strong price of anarchy

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Applications of game theory (91A80)

Cites Work

• Worst-case equilibria
• How bad is selfish routing?
• Tight bounds for worst-case equilibria
• Strong Price of Anarchy for Machine Load Balancing
• Bounds for LPT Schedules on Uniform Processors
• Approximate equilibria and ball fusion
• Algorithmic mechanism design
• Bounds for List Schedules on Uniform Processors
• Title not available (Why is that?)
• Algorithms, games, and the internet
• Strong equilibrium in congestion games
• The price of selfish routing
• Title not available (Why is that?)
• Performance guarantees of local search for multiprocessor scheduling
• A linear time approximation algorithm for multiprocessor scheduling
• Equilibria for two parallel links: the strong price of anarchy versus the price of anarchy
• Title not available (Why is that?)
• An On-Line Algorithm for Some Uniform Processor Scheduling
• Title not available (Why is that?)
• Title not available (Why is that?)
• Tighter Approximation Bounds for LPT Scheduling in Two Special Cases

Cited In (4)

• Equilibria for two parallel links: the strong price of anarchy versus the price of anarchy
• The Price of Anarchy for Minsum Related Machine Scheduling
• The cost of selfishness for maximizing the minimum load on uniformly related machines
• Computation of equilibria and the price of anarchy in bottleneck congestion games

This page was built for publication: The Price of Anarchy on Uniformly Related Machines Revisited

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