scientific article; zbMATH DE number 6146483
From MaRDI portal
Publication:4910748
DOI10.4230/LIPIcs.STACS.2008.1314zbMath1259.68022MaRDI QIDQ4910748
Publication date: 19 March 2013
Full work available at URL: http://subs.emis.de/LIPIcs/frontdoor_8293.html
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Approximation algorithms (68W25) Randomized algorithms (68W20)
Related Items (13)
The VCG Mechanism for Bayesian Scheduling ⋮ Setting lower bounds on truthfulness ⋮ Improved lower bounds for non-utilitarian truthfulness ⋮ Mechanisms for scheduling with single-bit private values ⋮ A lower bound of \(1+\varphi \) for truthful scheduling mechanisms ⋮ Unrelated parallel machine scheduling -- perspectives and progress ⋮ 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 ⋮ A new lower bound for deterministic truthful scheduling ⋮ New bounds for truthful scheduling on two unrelated selfish machines ⋮ Truthful mechanisms for two-range-values variant of unrelated scheduling ⋮ Fair by design: multidimensional envy-free mechanisms
This page was built for publication:
