The Combinatorial Clock Auction (CCA) has frequently been used in recent spectrum auctions. It combines a dynamic clock phase and a one-off supplementary round. The winning allocation and the corresponding prices are determined by the VCG rules. These rules should encourage truthful bidding,...

We show that the class of preferences satisfying the Gross Substitutes condition of Kelso and Crawford (1982) is strictly larger than the class of Endowed Assignment Valuations of Hatfield and Milgrom (2005), thus resolving the open question posed by the latter paper. In particular, our result...

This paper studies the possibility of implementing Pareto optimal outcomes in the combinatorial auction setting where bidders may have budget constraints. I show that when the setting involves a single good, or multiple goods but with single-minded bidders, there is a unique mechanism, called...

This paper studies the possibility of implementing Pareto optimal outcomes in the combinatorial auction setting where bidders may have budget constraints. I show that when the setting involves a single good, or multiple goods but with single-minded bidders, there is a unique mechanism, called...

We show that the class of preferences satisfying the Gross Substitutes condition of Kelso and Crawford (1982) is strictly larger than the class of Endowed Assignment Valuations of Hatfield and Milgrom (2005), thus resolving the open question posed by the latter paper. In particular, our result...

Many auctions involve the sale of heterogenous indivisible objects. Examples are wireless spectrum, delivery routes and airport time slots. Because of complementarities or substitution effects between the objects, bidders have preferences not just over individual items but over subsets of them....

Robert Wilson und Paul Milgrom erhielten am 10. Dezember 2020 den Preis der Schwedischen Nationalbank für Wirtschaftswissenschaften zu Ehren von Alfred Nobel. Die Ökonomen erhielten den Preis für ihre Beiträge zur Auktionstheorie und für die Entwicklung neuer Auktionsformate.

When combinatorial bidding is permitted in auctions, such as the proposed FCC Auction #31, the resulting full valuations and winner-determination problem can be computationally challenging. We present a branch-and-price algorithm based on a set-packing formulation originally proposed by Dietrich...

There is interest in designing simultaneous auctions for situations such as the recent FCC radio spectrum auctions, in which the value of assets to a bidder depends on which other assets he or she wins. In such auctions, bidders may wish to submit bids for combinations of assets. When this is...