The Price of Anarchy on Uniformly Related Machines Revisited

DOI10.1007/978-3-540-79309-0_6zbMath1136.91351OpenAlexW1586529440MaRDI QIDQ5459971

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

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

Related Items (2)

Computation of equilibria and the price of anarchy in bottleneck congestion games ⋮ Equilibria for two parallel links: the strong price of anarchy versus the price of anarchy

Cites Work

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

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