New bounds for truthful scheduling on two unrelated selfish machines
From MaRDI portal
Publication:2300622
DOI10.1007/s00224-019-09927-xzbMath1434.68678arXiv1711.04796MaRDI QIDQ2300622
Juan Carlos Vera, Olga Kuryatnikova
Publication date: 27 February 2020
Published in: Theory of Computing Systems (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1711.04796
minimax optimization; approximation; algorithmic mechanism design; piecewise functions; truthful scheduling
90C47: Minimax problems in mathematical programming
90B35: Deterministic scheduling theory in operations research
68W25: Approximation algorithms
68W20: Randomized algorithms
Uses Software