Worst-case efficiency ratio in false-name-proof combinatorial auction mechanisms
Date
2010
Authors
Iwasaki, A.
Conitzer, V.
Omori, Y.
Sakurai, Y.
Todo, T.
Guo, M.
Yokoo, M.
Editors
van der Hoek, W.
Kaminka, G.
Lesperance, Y.
Luck, M.
Sen, S.
Kaminka, G.
Lesperance, Y.
Luck, M.
Sen, S.
Advisors
Journal Title
Journal ISSN
Volume Title
Type:
Conference paper
Citation
Proceedings of the International Joint Conference on Autonomous Agents and Multiagent Systems, AAMAS, 2010 / van der Hoek, W., Kaminka, G., Lesperance, Y., Luck, M., Sen, S. (ed./s), vol.2, pp.633-640
Statement of Responsibility
Atsushi Iwasaki, Vincent Conitzer, Yoshifusa Omori, Yuko Sakurai, Taiki Todo, Mingyu Guo and Makoto Yokoo
Conference Name
9th International Conference on Autonomous Agents and Multiagent Systems (AAMAS) (10 May 2010 - 14 May 2010 : Toronto, Canada)
Abstract
This paper analyzes the worst-case efficiency ratio of false-name-proof combinatorial auction mechanisms. False-name-proofness generalizes strategy-proofness by assuming that a bidder can submit multiple bids under fictitious identifiers. Even the well-known Vickrey-Clarke-Groves mechanism is not false-name-proof. It has previously been shown that there is no false-name-proof mechanism that always achieves a Pareto efficient allocation. Consequently, if false-name bids are possible, we need to sacrifice efficiency to some extent. This leaves the natural question of how much surplus must be sacrificed. To answer this question, this paper focuses on worst-case analysis. Specifically, we consider the fraction of the Pareto efficient surplus that we obtain and try to maximize this fraction in the worst-case, under the constraint of false-name-proofness. As far as we are aware, this is the first attempt to examine the worst-case efficiency of false-name-proof mechanisms. We show that the worst-case efficiency ratio of any false-name-proof mechanism that satisfies some apparently minor assumptions is at most 2/(m + 1) for auctions with m different goods. We also observe that the worst-case efficiency ratio of existing false-name-proof mechanisms is generally 1/m or 0. Finally, we propose a novel mechanism, called the adaptive reserve price mechanism that is false-name-proof when all bidders are single-minded. The worst-case efficiency ratio is 2/(m + 1), i.e., optimal.
School/Discipline
Dissertation Note
Provenance
Description
Access Status
Rights
© 2010 International Foundation for Autonomous Agents and Multiagent Systems