A Strategyproof Mechanism for Scheduling Divisible Loads in Tree Networks

The underlying assumption of Divisible Load Scheduling is that the processors composing the network are obedient, i.e., they do not “cheat” the algorithm. This assumption is unrealistic if the processors are owned by autonomous, self-interested organizations that have no a priori motivation for cooperation and they will manipulate the algorithm if it is beneficial to do so. In this paper we propose the strategyproof mechanism DLS-TL for scheduling divisible loads in tree networks. Our proposal augments Divisible Load Theory (DLT) with incentives such that it is beneficial for processors to report their true processing capacity and compute their assignments at full processing capacity. Additionally, incentives are provided for processors to report algorithm deviants. Deviants are penalized which abates the processors’ willingness to deviate.