Journal
GAMES AND ECONOMIC BEHAVIOR
Volume 46, Issue 1, Pages 174-188Publisher
ACADEMIC PRESS INC ELSEVIER SCIENCE
DOI: 10.1016/S0899-8256(03)00045-9
Keywords
auction; strategy-proof; mechanism design
Categories
Ask authors/readers for more resources
We examine the effect of false-name bids on combinatorial auction protocols. False-name bids are bids submitted by a single bidder using multiple identifiers such as multiple e-mail addresses. The obtained results are summarized as follows: (1) the Vickrey-Clarke-Groves (VCG) mechanism, which is strategy-proof and Pareto efficient when there exists no false-name bid, is not false-name-proof; (2) there exists no false-name-proof combinatorial auction protocol that satisfies Pareto efficiency; (3) one sufficient condition where the VCG mechanism is false-name-proof is identified, i.e., the concavity of a surplus function over bidders. (C) 2003 Elsevier Inc. All rights reserved.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available