We consider algorithmic problems in a distributed setting where the participants cannot be assumed to follow the algorithm but rather their own self-interest. As such participants, termed agents, are capable of manipulating the algorithm, the algorithm designer should ensure in advance that the agents' interests are best served by behaving correctly. Following notions from the field of mechanism design, we suggest a framework for studying such algorithms. Our main technical contribution concerns the study of a representative task scheduling problem for which the standard mechanism design tools do not suffice.
Bibliographical noteFunding Information:
∗This research was supported by grants from the Israeli ministry of Science and the Israeli academy of sciences. †E-mail: firstname.lastname@example.org. ‡To whom correspondence should be addressed. E-mail: email@example.com.