Truthfulness for the Sum of Weighted Completion Times

  title={Truthfulness for the Sum of Weighted Completion Times},
  author={Eric Angel and Evripidis Bampis and Fanny Pascual and Nicolas Thibault},
We consider the problem of designing truthful mechanisms for scheduling selfish tasks on a single machine or on a set of m parallel machines. The objective of every selfish task is the minimization of its completion time while the aim of the mechanism is the minimization of the sum of weighted completion times. For the model without payments, we prove that there is no \((2-\epsilon )\)-approximate deterministic truthful algorithm and no \((\frac{3}{2}-\epsilon )\)-approximate randomized… 

Scheduling theory prevails against powerful sel sh clients

  • Business
  • 2017
You run a job processing machine. Every day, many clients send you jobs to complete. You process the jobs in a uniformly random order. Everyone is happy. One day, you notice that many size-1 jobs are

Computation, Communication, Rationality and Incentives in Collective and Cooperative Decision Making

  • Economics
from its start to end of July 2016. The report is structured along the work packages described in the project proposal. • Coordinator: Olivier Spanjaard (LIP6). This work package focuses on the

Efficient Online Scheduling of Electric Vehicle Charging Using a Service-Price Menu

By letting the EV users pick their most preferable menu option, the proposed algorithm achieves a near optimal total weighted charging completion time, and prevents the users from strategically misreporting their preferences, while offering a practical and implementable solution to the problem of EVs - charging station interaction.

Implementation of optimal schedules in outsourcing with identical suppliers

This paper deals with decentralized decision-making situations in which firms outsource production orders to multiple identical suppliers and shows that for the general case there exists no anonymous mechanism that implements optimal schedules in correlated equilibrium.

Noncooperative Supply Chain Scheduling



Randomized truthful algorithms for scheduling selfish tasks on parallel machines

On truthfulness and approximation for scheduling selfish tasks

The notion of increasing algorithm and a simple reduction that transforms any increasing algorithm into a truthful one are introduced and it is shown that some of the classical scheduling algorithms are indeed increasing.

Truthful Approximation Mechanisms for Scheduling Selfish Related Machines

A 5-approximation deterministic truthful mechanism is provided, the first Deterministic truthful result for the problem of scheduling jobs on related machines owned by selfish agents and improves a previous result of Auletta et al.

Scheduling Selfish Tasks: About the Performance of Truthful Algorithms

This paper deals with problems which fall into the domain of selfish scheduling: a protocol is in charge of building a schedule for a set of tasks without directly knowing their length. The protocol

Truthful mechanisms for one-parameter agents

  • Aaron ArcherÉ. Tardos
  • Computer Science
    Proceedings 2001 IEEE International Conference on Cluster Computing
  • 2001
An exact characterization for the algorithms that can be used to design truthful mechanisms for such load balancing problems using appropriate side payments is given, and a lower bound of 2//spl radic/3 is proved for the best approximation ratio achievable by truthful mechanism.

Worst Case Bound of an LRF Schedule for the Mean Weighted Flow-Time Problem

The worst case behavior of a heuristic algorithm which requires time $O(n\log n)$ is investigated, and it is shown that the mean weighted flow-time obtained by the algorithm does not exceed ${{(\sqrt 2 + 1)} / 2} \cong 1.0207$ times that of an optimal schedule.

Deterministic monotone algorithms for scheduling on related machines

The Price of Anarchy for Minsum Related Machine Scheduling

This work addresses the classical uniformly related machine scheduling problem with minsum objective and shows that the price of anarchy in this setting is bounded from above by 2.58, and gives a lower bound of e/(e−1)≈1.

Inner product spaces for MinSum coordination mechanisms

This work designs the first combinatorial constant-factor approximation algorithm minimizing weighted completion time for unrelated machine scheduling, which achieves a factor of 2+ε for any ε > 0, and involves imitating best response dynamics using a variant of ProportionalSharing as the policy.

Scheduling Unrelated Machines by Randomized Rounding

We present a new class of randomized approximation algorithms for unrelated parallel machine scheduling problems with the average weighted completion time objective. The key idea is to assign jobs