Truthful mechanisms for deadline scheduling

Truthful mechanism, as a type of mechanism design is considered a subfield of economic theory. It is characterized by formulating rules of a game intended to attain a specific outcome, which is a concept born out of the game theory, as well as, solution concept. In deadline scheduling problem, there is one central server and m machines. Given a set of jobs, the central server intends to distribute the jobs to each machine based on the reported deadline from the machine. Our goal is to design a strategy-proof mechanism such that each machine will report its deadline truthfully. In this paper, we first demostrate the criteria for truthfulness in deadline scheduling, and we provide a mechanism, which consists of an allocation algorithm and a payment scheme, using randomized techniques. We also compute the competitive ratio for different objective functions.