This paper studies multi-unit ascending (English) auctions with a buyer’s option. The buyer’s option gives the winner of an auction the right to purchase any number of units at the winning price. We develop a theoretical model and derive the optimal strategies for the bidders. The model predicts various behavioral implications (e.g., the winner never exercises the option, the price declines...) that are tested using a unique data set on wine auctions held at the Paris-based auction house Drouot. We also analyze why the buyer’s option is used. Estimating the model in a structural econometric way, and using counterfactual comparisons, we find that the buyer’s option does not affect the seller’s revenue (relative to a system where the units are auctioned sequentially without the option). Drouot, however, saves a lot of time with the option and this effect represents a considerable amount of money. The time saving effect seems thus to be the primary purpose of the buyer’s option.
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 Laboratoire d'Economie Appliquee, INRA in its series Research Unit Working Papers with number
0409.
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.:
Cited by: (explanations, 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.)
Did you know? All full texts are decentralized with the publishers, none reside on this server, thus making it possible to offer this service for free to all parties.