Skip to main content
Article thumbnail
Location of Repository

Auctions in which losers set the price

By Claudio Mezzetti and Ilia Tsetlin

Abstract

Updated March 2007We study auctions of a single asset among symmetric bidders with a¢ liated values. We\ud show that the second-price auction minimizes revenue among all e¢ cient auction mechanisms\ud in which only the winner pays, and the price only depends on the losers bids. In particular,\ud we show that the k-th price auction generates higher revenue than the second-price auction,\ud for all k > 2. If rationing is allowed, with shares of the asset rationed among the t highest\ud bidders, then the (t + 1)-st price auction yields the lowest revenue among all auctions with\ud rationing in which only the winners pay and the unit price only depends on the losers \ud bids. Finally, we compute bidding functions and revenue of the k-th price auction, with and\ud without rationing, for an illustrative example much used in the experimental literature to\ud study rst-price, second-price and English auctions.\ud Journal of Economic Literature Classi cation Numb

Topics: Auctions, Second-Price Auction, English Auction, k-th Price Auction, Affliated values, Rationing, Robust Mechanism Design
Publisher: Dept. of Economics, University of Leicester
Year: 2006
OAI identifier: oai:lra.le.ac.uk:2381/7439

Suggested articles


To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.