Informational limitations of ascending combinatorial auctions

A-Tier
Journal: Journal of Economic Theory
Year: 2010
Volume: 145
Issue: 3
Pages: 1203-1223

Authors (2)

Blumrosen, Liad (not in RePEc) Nisan, Noam (Hebrew University of Jerusalem)

Score contribution per author:

2.011 = (α=2.01 / 2 authors) × 2.0x A-tier

α: calibrated so average coauthorship-adjusted count equals average raw count

Abstract

We study the inherent limitations of natural widely-used classes of ascending combinatorial auctions. Specifically, we show that ascending combinatorial auctions that do not use both non-linear prices and personalized prices cannot achieve social efficiency with general bidder valuations. We also show that the loss of efficiency can be severe and that only a diminishing fraction of the social welfare may be captured. This justifies the added complexity in the auctions suggested by, e.g., Parkes and Ungar (2000) [29] and Ausubel and Milgrom (2002) [2].

Technical Details

RePEc Handle
repec:eee:jetheo:v:145:y:2010:i:3:p:1203-1223
Journal Field
Theory
Author Count
2
Added to Database
2026-01-26