On Ascending Vickrey Auctions for Heterogeneous Objects

Vickrey auctions, multi-item auctions, combinatorial auctions,

Ascending auctions: some impossibility results and their resolutions with final price discounts

When bidders are not substitutes, we show that there is no standard ascend-ing auction that implements a bidder-optimal competitive equilibrium under truthful bidding. Such an impossibility holds also in environments where the Vickrey payoff vector is a competitive equilibrium payoff and is thus stronger than de Vries, Schummer and Vohra s [On ascending Vickrey auctions for het-erogeneous objects, J. Econ. Theory, 132, 95-118] impossibility result with regards to the Vickrey payoff vector under general valuations. Similarly to Mishra and Parkes [Ascending price Vickrey auctions for general valuations, J. Econ. Theory, 132, 335-366], the impossibility can be circumvented by giving price discounts to the bidders from the final vector of prices. Nevertheless, the similarity is misleading: the solution we propose satisfies a minimality infor-mation revelation property that fails to be satisfied in any ascending auction that implements the Vickrey payoffs for general valuations. We investigate related issues when strictly positive increments have to be used under general continuous valuations.Lorsque les enchérisseurs ne sont pas substituts, nous montrons qu'il n'existe pas de mécanisme d'enchères ascendantes qui implémente un équilibre concurrentiel qui soit optimal pour les enchérisseurs. Un tel résultat d'impossibilité reste vrai dans les environnements où les payements de Vickrey sont concurrentiels et est donc plus fort que le résultat d'impossibilité de De Vries, Schummer et Vohra [On ascending Vickrey auctions for heterogeneous objects, J. Econ. Theory, 132, 95-118] relatif à l'implémentation des payements de Vickrey sans restrictions sur les valuations. De la même manière que dans Mishra et Parkes [Ascending price Vickrey auctions for general valuations, J. Econ. Theory, 132, 335-366], l'impossibilité est levée si l'on autorise une phase de réduction des prix à la fin de l'enchère. La similarité est trompeuse : la solution que l'on propose satisfait une propriété de "minimalité" relativement à la révélation des préférences des enchérisseurs, une propriété qui ne peut être satisfaite dans aucune des enchères qui implémente les payements de Vickrey. Nous analysons aussi la robustesse de tels mécanismes à la présence d'incréments

Mixed Bundling Auctions

We study multi-object auctions where agents have private and additive valuations for heterogeneous objects. We focus on the revenue properties of a class of dominant strategy mechanisms where a weight is assigned to each partition of objects. The weights influence the probability with which partitions are chosen in the mechanism. This class contains efficient auctions, pure bundling auctions, mixed bundling auctions, auctions with reserve prices and auctions with pre-packaged bundles. For any number of objects and bidders, both the pure bundling auction and separate, efficient auctions for the single objects are revenue-inferior to an auction that involves mixed bundling

Auctioning Securities

Treasury debt and other divisible securities are traditionally sold in either a pay-your-bid (discriminatory) auction or a uniform-price auction. We compare these auction formats with a Vickrey auction and also with two ascending-bid auctions. The Vickrey auction and the alternative ascending-bid auction (Ausubel 1996) have important theoretical advantages for sellers. In a setting without private information, these auctions achieve the maximal revenue as a unique equilibrium in dominant strategies. In contrast, the pay- your-bid, uniform-price, and standard ascending-bid auction admit a multiplicity of equilibria that yield low revenues for the seller. We show how these results extend to a setting where bidders have affiliated private information. Our results question the standard ways that securities are offered to the public.Auctions; Multi-Unit Auctions, Security Auctions, Treasury Auctions

Spectrum Auction Design

Spectrum auctions are used by governments to assign and price licenses for wireless communications. The standard approach is the simultaneous ascending auction, in which many related lots are auctioned simultaneously in a sequence of rounds. I analyze the strengths and weaknesses of the approach with examples from US spectrum auctions. I then present a variation, the package clock auction, adopted by the UK, which addresses many of the problems of the simultaneous ascending auction while building on its strengths. The package clock auction is a simple dynamic auction in which bidders bid on packages of lots. Most importantly, the auction allows alternative technologies that require the spectrum to be organized in different ways to compete in a technology-neutral auction. In addition, the pricing rule and information policy are carefully tailored to mitigate gaming behavior. An activity rule based on revealed preference promotes price discovery throughout the clock stage of the auction. Truthful bidding is encouraged, which simplifies bidding and improves efficiency. Experimental tests and early auctions confirm the advantages of the approach.Auctions, spectrum auctions, market design, package auction, clock auction, combinatorial auction

Multi-Unit Auctions to Allocate Water Scarcity Simulating Bidding Behaviour with Agent Based Models

Multi-unit auctions are promising mechanisms for the reallocation of water. The main advantage of such auctions is to avoid the lumpy bid issue. However, there is great uncertainty about the best auction formats when multi-unit auctions are used. The theory can only supply the structural properties of equilibrium strategies and the multiplicity of equilibria makes comparisons across auction formats difficult. Empirical studies and experiments have improved our knowledge of multi- unit auctions but they remain scarce and most experiments are restricted to two bidders and two units. Moreover, they demonstrate that bidders have limited rationality and learn through experience. This paper constructs an agent-based model of bidders to compare the performance of alternative auction formats under circumstances where bidders submit continuous bid supply functions and learn over time to adjust their bids to improve their net incomes. We demonstrate that under the generalized Vickrey, simulated bids converge towards truthful bids as predicted by the theory and that bid shading is the rule for the uniform and discriminatory auctions. Our study allows us to assess the potential gains from agent-based modelling approaches in the assessment of the dynamic performance of multi-unit procurement auctions. Some recommendations on the desirable format of water auctions are provided.Multi-unit auctions, Learning, Multi-agent models, Water allocation