Home > Research > Publications & Outputs > VCG-combinatorial Vickrey-clarke-groves auctions
View graph of relations

VCG-combinatorial Vickrey-clarke-groves auctions

Research output: Contribution to Journal/MagazineJournal articlepeer-review

<mark>Journal publication date</mark>30/04/2015
<mark>Journal</mark>Archive of Formal Proofs
Publication StatusPublished
<mark>Original language</mark>English


A VCG auction (named after their inventors Vickrey, Clarke, and Groves) is a generalization of the single-good, second price Vickrey auction to the case of a combinatorial auction (multiple goods, from which any participant can bid on each possible combination). We formalize in this entry VCG auctions, including tie-breaking and prove that the functions for the allocation and the price determination are well-defined. Furthermore we show that the allocation function allocates goods only to participants, only goods in the auction are allocated, and no good is allocated twice. We also show that the price function is non-negative. These properties also hold for the automatically extracted Scala code.