Please use this identifier to cite or link to this item: http://hdl.handle.net/2440/88261
Type: Conference paper
Title: VCG redistribution with gross substitutes
Author: Guo, M.
Citation: Proceedings of the Twenty-Fifth AAAI Conference on Artificial Intelligence, 2011 / pp.675-680
Publisher: AAAI Press
Publisher Place: Menlo Park, California
Issue Date: 2011
ISBN: 9781577355076
Conference Name: Twenty-Fifth AAAI Conference on Artificial Intelligence (07 Aug 2011 - 11 Aug 2011 : San Francisco, Ca.)
Statement of
Responsibility: 
Mingyu Guo
Abstract: For the problem of allocating resources among multiple strategic agents, the well-known Vickrey-Clarke-Groves (VCG) mechanism is efficient, strategy-proof, and it never incurs a deficit. However, in general, under the VCG mechanism, payments flow out of the system of agents, which reduces the agents' utilities. VCG redistribution mechanisms aim to return as much of the VCG payments as possible back to the agents, without affecting the desirable properties of the VCG mechanism. Most previous research on VCG redistribution mechanisms has focused on settings with homogeneous items and/or settings with unit-demand agents. In this paper, we study VCG redistribution mechanisms in the more general setting of combinatorial auctions. We show that when the gross substitutes condition holds, we are able to design mechanisms that guarantee to redistribute a large fraction of the VCG payments.
Rights: Copyright 2011, Association for the Advancement of Artificial Intelligence
RMID: 0030008300
Published version: https://www.aaai.org/ocs/index.php/AAAI/AAAI11/paper/view/3733/3947
Appears in Collections:Computer Science publications

Files in This Item:
There are no files associated with this item.


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.