Multiattribute auctions extend traditional auction settings to allow negotiation over nonprice attributes such as weight, color, and terms of delivery, in addition to price and promise to improve market efficiency in markets with configurable goods. This paper provides an iterative auction...

We propose a model for demand estimation in multi-agent, differentiated product settings and present an estimation algorithm that uses reversible jump MCMC techniques to classify agents' types. Our model extends the popular setup in Berry, Levinsohn and Pakes (1995) to allow for the data-driven...

Descending price auctions are adopted for goods that must be sold quickly and in private values environments, for instance in flower, fish, and tobacco auctions. In this paper, we introduce ex post efficient descending auctions for two environments: multiple non-identical items and buyers with...

Descending price auctions are adopted for goods that must be sold quickly and in private values environments, for instance in flower, fish, and tobacco auctions. In this paper, we introduce efficient descending auctions for two environments: multiple non-identical items and buyers with...

Ascending price auctions typically involve a single price path with buyers paying their final bid price. Using this traditional definition, no ascending price auction can achieve the Vickrey-Clarke-Groves (VCG) outcome for general private valuations in the combinatorial auction setting. We relax...

Cake cutting is a common metaphor for the division of a heterogeneous divisible good. There are numerous papers that study the problem of fairly dividing a cake; a small number of them also take into account self-interested agents and consequent strategic issues, but these papers focus on...