A new lower bound for deterministic truthful scheduling

DOI10.1007/978-3-030-57980-7_15zbMath1506.90099OpenAlexW3089866064MaRDI QIDQ5918586

Alexander Hammerl, Yiannis Giannakopoulos, Diogo Poças

Publication date: 21 December 2022

Published in: Algorithmic Game Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-030-57980-7_15

zbMATH Keywords

makespan minimizationmechanism designtruthfulnessscheduling unrelated machines

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Mechanism design theory (91B03)

Related Items (2)

A new lower bound for deterministic truthful scheduling ⋮ The Pareto frontier of inefficiency in mechanism design

This page was built for publication: A new lower bound for deterministic truthful scheduling