Worst-case optimal redistribution of VCG payments in multi-unit auctions

Mingyu Guo and Vincent Conitzer

Games and Economic Behavior, 2009, vol. 67, issue 1, 69-98

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.

Date: 2009
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (35)

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0899-8256(08)00126-7
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:gamebe:v:67:y:2009:i:1:p:69-98

Access Statistics for this article

Games and Economic Behavior is currently edited by E. Kalai

More articles in Games and Economic Behavior from Elsevier
Bibliographic data for series maintained by Catherine Liu ().