Article ID Journal Published Year Pages File Type
10334502 Theoretical Computer Science 2009 9 Pages PDF
Abstract
Finally, we consider mechanisms with verification, introduced by Nisan and Ronen [N. Nisan, A. Ronen, Algorithmic mechanism design, in: Proceedings of the 31st Annual ACM Symposium on Theory of Computing, STOC, 1999, pp. 129-140], for offline scheduling problems. We present the first constant-competitive online truthful mechanism with verification for any number of machines.
Keywords
Related Topics
Physical Sciences and Engineering Computer Science Computational Theory and Mathematics
Preview
On designing truthful mechanisms for online scheduling
Authors
, , , ,