This work initiates the study of cost-sharing mechanisms that, in addition to the usual incentive compatibility conditions, make it disadvantageous for the users to employ pseudonyms. We show that this is possible only if all serviced users pay the same price, which implies that such mechanisms do not exist even for certain subadditive cost functions. In practice, a user can increase her utility by lying in one way (misreport her willingness to pay) or another (misreport her identity). We prove also results for approximately budget-balanced mechanisms. Finally, we consider mechanisms that rely on some kind of "reputation" associated to the pseudonyms and show that they are provably better. © 2009 Springer-Verlag Berlin Heidelberg.
CITATION STYLE
Penna, P., Schoppmann, F., Silvestri, R., & Widmayer, P. (2009). Pseudonyms in cost-sharing games. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5929 LNCS, pp. 256–267). https://doi.org/10.1007/978-3-642-10841-9_24
Mendeley helps you to discover research relevant for your work.