Randomized truthful algorithms for scheduling selfish tasks on parallel machines

DOI10.1016/J.TCS.2011.10.006zbMath1234.68041OpenAlexW2107831512MaRDI QIDQ764300

Nicolas Thibault, Evripidis Bampis, Eric Angel

Publication date: 13 March 2012

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2011.10.006

zbMATH Keywords

schedulingapproximationalgorithmic game theory

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Approximation algorithms (68W25)

Related Items (2)

Incentive compatible mechanisms for scheduling two-parameter job agents on parallel identical machines to minimize the weighted number of late jobs ⋮ Truthfulness for the Sum of Weighted Completion Times

Cites Work

• Truthful algorithms for scheduling selfish tasks on parallel machines
• On truthfulness and approximation for scheduling selfish tasks
• Scheduling Selfish Tasks: About the Performance of Truthful Algorithms
• Automata, Languages and Programming
• Bounds for Certain Multiprocessing Anomalies

This page was built for publication: Randomized truthful algorithms for scheduling selfish tasks on parallel machines