A Deterministic Truthful PTAS for Scheduling Related Machines
DOI10.1137/120866038zbMath1290.68055arXiv0907.3068OpenAlexW2036744632MaRDI QIDQ2862203
George Christodoulou, Annamária Kovács
Publication date: 14 November 2013
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/0907.3068
algorithmic mechanism designalgorithmic game theoryrelated machine schedulingtruthful scheduling mechanisms
Analysis of algorithms and problem complexity (68Q25) 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 (10)
This page was built for publication: A Deterministic Truthful PTAS for Scheduling Related Machines