Optimal Lower Bounds for Anonymous Scheduling Mechanisms
From MaRDI portal
Publication:2884315
DOI10.1287/moor.1110.0534zbMath1238.91071OpenAlexW2034780413MaRDI QIDQ2884315
Ron Lavi, Itai Ashlagi, Shahar Dobzinski
Publication date: 24 May 2012
Published in: Mathematics of Operations Research (Search for Journal in Brave)
Full work available at URL: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.309.5752
Applications of game theory (91A80) Deterministic scheduling theory in operations research (90B35) Auctions, bargaining, bidding and selling, and other market models (91B26) Approximation algorithms (68W25)
Related Items (17)
The VCG Mechanism for Bayesian Scheduling ⋮ Setting lower bounds on truthfulness ⋮ Approximation guarantee of OSP mechanisms: the case of machine scheduling and facility location ⋮ The anarchy of scheduling without money ⋮ Mechanisms for scheduling with single-bit private values ⋮ Copula-based randomized mechanisms for truthful scheduling on two unrelated machines ⋮ A lower bound of \(1+\varphi \) for truthful scheduling mechanisms ⋮ Mechanism design with a restricted action space ⋮ Recent Developments in the Mechanism Design Problem for Scheduling ⋮ Truthful mechanism design via correlated tree rounding ⋮ Average-case approximation ratio of scheduling without payments ⋮ No truthful mechanism can be better than \(n\) approximate for two natural problems ⋮ Bayesian optimal knapsack procurement ⋮ A new lower bound for deterministic truthful scheduling ⋮ Bribeproof Mechanisms for Two-Values Domains ⋮ The Anarchy of Scheduling Without Money ⋮ The Pareto frontier of inefficiency in mechanism design
This page was built for publication: Optimal Lower Bounds for Anonymous Scheduling Mechanisms
