Consider a setting with n sellers having i.i.d. costs with log-concave density f from cumulative F, and a buyer who puts a premium [Delta]i on procuring from seller i. We show how for any given [Delta]1,...,[Delta]n, a simple second price bonus auction can be chosen which comes surprisingly close to giving the auctioneer the same surplus as an optimal mechanism. The bonuses depend only on the magnitude and monotonicity of the slope of virtual costs given F. We show that these in turn depend only on fairly coarse information about F. We explore how this result generalizes to asymmetrically distributed costs.
['Vlad Mares', 'Jeroen M. Swinkels']
Near-Optimality of Second Price Mechanisms in a Class of Asymmetric Auctions