The Price of Anarchy on Uniformly Related Machines Revisited

DOI10.1007/978-3-540-79309-0_6MaRDI QIDQ5459971zbMATH OpenOpenAlexFDO

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

Mathematics Subject Classification ID

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

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

Cites work

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

Cited in

(9)

• The price of anarchy on uniformly related machines revisited
• 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 price of anarchy for utilitarian scheduling games on related machines
• 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
• Allocation game on m-uniform parallel machines
• Selfish jobs with favorite machines: price of anarchy vs. strong price of anarchy
• Price of anarchy for machine load balancing game with 3 machines

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)