The Price of Anarchy for Minsum Related Machine Scheduling
From MaRDI portal
Publication:2896395
DOI10.1007/978-3-642-29116-6_22zbMath1242.90076OpenAlexW1909697184WikidataQ62044140 ScholiaQ62044140MaRDI QIDQ2896395
Publication date: 16 July 2012
Published in: Approximation and Online Algorithms (Search for Journal in Brave)
Full work available at URL: https://research.utwente.nl/en/publications/the-price-of-anarchy-for-minsum-related-machine-scheduling(038bbb9e-309e-400b-bac4-2411c9dce02d).html
Deterministic scheduling theory in operations research (90B35) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Related Items (10)
A selfish allocation heuristic in scheduling: equilibrium and inefficiency bound analysis ⋮ Anarchy in the UJ: coordination mechanisms for minimizing the number of late jobs ⋮ Implementation of optimal schedules in outsourcing with identical suppliers ⋮ Tight bounds for the price of anarchy and stability in sequential transportation games ⋮ The price of anarchy for utilitarian scheduling games on related machines ⋮ Inefficiency of games with social context ⋮ Decentralized utilitarian mechanisms for scheduling games ⋮ On the price of anarchy of two-stage machine scheduling games ⋮ Truthfulness for the Sum of Weighted Completion Times ⋮ Improved price of anarchy for machine scheduling games with coordination mechanisms
This page was built for publication: The Price of Anarchy for Minsum Related Machine Scheduling
