Truthful mechanisms for generalized utilitarian problems

4Citations
Citations of this article
5Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

In this paper we investigate extensions of the well-known Vickrey-Clarke-Groves (VCG) mechanisms to problems whose objective function is not utilitarian and whose agents' utilities are not quasi-linear. We provide a generalization of utilitarian problems, termed consistent problems, and prove that every consistent problem admits a truthful mechanism. These mechanisms, termed VCGconsistent (VCGc) mechanisms, can be seen as a natural extension of VCG mechanisms for utilitarian problems. We then investigate extensions/restrictions of consistent problems. This yields three classes of problems for which (i) VCGc mechanisms are the only truthful mechanisms, (ii) no truthful VCGc mechanism exists, and (iii) no truthful mechanism exists, respectively. Showing that a given problem is in one of these three classes is straightforward, thus yielding a simple way to see whether VCGc mechanisms are appropriate or not. Finally, we apply our results to a number of basic non-utilitarian problems. © 2004 Springer Science + Business Media, Inc.

Cite

CITATION STYLE

APA

Melideo, G., Penna, P., Proietti, G., Wattenhofer, R., & Widmayer, P. (2004). Truthful mechanisms for generalized utilitarian problems. In IFIP Advances in Information and Communication Technology (Vol. 155, pp. 167–180). Springer New York LLC. https://doi.org/10.1007/1-4020-8141-3_15

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free