Mechanism design for fractional scheduling on unrelated machines
From MaRDI portal
Publication:2930317
DOI10.1145/1721837.1721854zbMath1300.90014OpenAlexW2151792026MaRDI QIDQ2930317
Annamária Kovács, George Christodoulou, Elias Koutsoupias
Publication date: 18 November 2014
Published in: ACM Transactions on Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/1721837.1721854
Deterministic scheduling theory in operations research (90B35) Auctions, bargaining, bidding and selling, and other market models (91B26) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Approximation algorithms (68W25)
Related Items (12)
Setting lower bounds on truthfulness ⋮ The anarchy of scheduling without money ⋮ Mechanisms for scheduling with single-bit private values ⋮ A lower bound of \(1+\varphi \) for truthful scheduling mechanisms ⋮ Recent Developments in the Mechanism Design Problem for Scheduling ⋮ Truthful mechanism design via correlated tree rounding ⋮ Optimal collusion-resistant mechanisms with verification ⋮ No truthful mechanism can be better than \(n\) approximate for two natural problems ⋮ A new lower bound for deterministic truthful scheduling ⋮ The Anarchy of Scheduling Without Money ⋮ The Pareto frontier of inefficiency in mechanism design ⋮ THE PRICE OF MULTI-ORGANIZATION CONSTRAINT IN UNRELATED PARALLEL MACHINE SCHEDULING
This page was built for publication: Mechanism design for fractional scheduling on unrelated machines
