Nicolas Gruyer () (LEEA (air transport economics laboratory), ENAC)
Abstract
This paper studies the optimal auction for a seller who is bound to sell a single item to one of two potential buyers organized in a ”well-coordinated” cartel. After discussing the way the cartel reacts to any auction mechanism, we show that if the seller has no way to deter collusion, he can still accomodate it optimally with a very simple mechanism, either having the cartel pay to get an efficient allocation or randomly allocating the item. We then discuss the way to implement this mechanism, so that it enables a fair amount of competition if the seller made a mistake and the buyers don’t collude. We find that a simple implementation using reserve prices and lotteries may yield expected revenues close to the optimum if buyers compete, while highly increasing expected revenues if they collude. Finally, we discuss the extension to the n-buyers case.
Download Info
To download:
If you experience problems downloading a file, check if you have the
proper application to
view it first. Information about this may be contained
in the File-Format links below. In case of further problems read
the IDEAS help
page. Note that these files are not on the IDEAS
site. Please be patient as the files may be large.
Publisher Info
Paper provided by LEEA (air transport economics laboratory), ENAC (french national civil aviation school) in its series Economics Working Papers with number
02.
References listed on IDEAS Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.:
Cramton, Peter C & Palfrey, Thomas R, 1990.
"Cartel Enforcement with Uncertainty about Costs,"
International Economic Review,
Department of Economics, University of Pennsylvania and Osaka University Institute of Social and Economic Research Association, vol. 31(1), pages 17-47, February.
[Downloadable!] (restricted)
Other versions: