Truthfulness for the sum of weighted completion times

DOI10.1007/978-3-319-42634-1_2MaRDI QIDQ2817845zbMATH OpenOpenAlexFDO

Authors Fanny Pascual, Nicolas Thibault, Eric Angel, Evripidis Bampis

Publication date 2 September 2016

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-42634-1_2

Mathematics Subject Classification ID

Randomized algorithms (68W20) Deterministic scheduling theory in operations research (90B35) Approximation algorithms (68W25)

Recommendations

• On truthfulness and approximation for scheduling selfish tasks
• Truthful algorithms for scheduling selfish tasks on parallel machines
• Randomized truthful algorithms for scheduling selfish tasks on parallel machines
• Randomized truthful algorithms for scheduling selfish tasks on parallel machines
• Scheduling Selfish Tasks: About the Performance of Truthful Algorithms

Cites work

• Algorithmic mechanism design (extended abstract)
• Approximation and Online Algorithms
• Incentives in Teams
• Inner product spaces for minsum coordination mechanisms
• On truthfulness and approximation for scheduling selfish tasks
• Optimal Coordination Mechanisms for Multi-job Scheduling Games
• Randomized truthful algorithms for scheduling selfish tasks on parallel machines
• STACS 2005
• Scheduling Selfish Tasks: About the Performance of Truthful Algorithms
• Scheduling Unrelated Machines by Randomized Rounding
• Scheduling tasks from selfish multi-tasks agents
• The Price of Anarchy for Minsum Related Machine Scheduling
• Truthful algorithms for scheduling selfish tasks on parallel machines
• Worst Case Bound of an LRF Schedule for the Mean Weighted Flow-Time Problem
• Worst-case equilibria

Cited in

(6)

• Implementation of optimal schedules in outsourcing with identical suppliers
• Scheduling Selfish Tasks: About the Performance of Truthful Algorithms
• Truthful many-to-many assignment with private weights
• Incentive compatible mechanisms for scheduling two-parameter job agents on parallel identical machines to minimize the weighted number of late jobs
• Randomized truthful algorithms for scheduling selfish tasks on parallel machines
• Randomized truthful algorithms for scheduling selfish tasks on parallel machines

This page was built for publication: Truthfulness for the sum of weighted completion times

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2817845)