Worst-case optimal redistribution of VCG payments in multi-unit auctions
Date
2009
Authors
Guo, M.
Conitzer, V.
Editors
Advisors
Journal Title
Journal ISSN
Volume Title
Type:
Journal article
Citation
Games and Economic Behavior, 2009; 67(1):69-98
Statement of Responsibility
Mingyu Guo, Vincent Conitzer
Conference Name
Abstract
For allocation problems with one or more items, the well-known Vickrey-Clarke-Groves (VCG) mechanism (aka Clarke mechanism, Generalized Vickrey Auction) is efficient, strategy-proof, individually rational, and does not incur a deficit. However, it is not (strongly) budget balanced: generally, the agents' payments will sum to more than 0. We study mechanisms that redistribute some of the VCG payments back to the agents, while maintaining the desirable properties of the VCG mechanism. Our objective is to come as close to budget balance as possible in the worst case. For auctions with multiple indistinguishable units in which marginal values are nonincreasing, we derive a mechanism that is optimal in this sense. We also derive an optimal mechanism for the case where we drop the non-deficit requirement. Finally, we show that if marginal values are not required to be nonincreasing, then the original VCG mechanism is worst-case optimal. © 2008 Elsevier Inc. All rights reserved.
School/Discipline
Dissertation Note
Provenance
Description
Access Status
Rights
© 2008 Elsevier Inc. All rights reserved.