Revenue-maximizing Dutch auctions with discrete bid levels
This paper is concerned with setting a predetermined number of bid levels in a Dutch auction to maximize the auctioneer's expected revenue. As a departure from the traditional methods used by applied economists and game-theorists, a novel approach is taken in this study to tackle the problem by formulating the auctioning process as a constrained nonlinear program and applying standard optimization techniques to solve it. Aside from proposing respective closed-form formulae for computing the optimal bid levels and the auctioneer's maximum expected revenue, we also show that the bid decrements should be increasing if there are two or more bidders in the Dutch auction. Additionally, the auctioneer's maximum expected revenue increases with the number of bidders as well as the number of bid levels. Finally, managerial implications of the key findings as well as limitations of this research work are discussed.
If you experience problems downloading a file, check if you have the proper application to view it first. 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.
As the access to this document is restricted, you may want to look for a different version under "Related research" (further below) or search for a different version of it.
When requesting a correction, please mention this item's handle: RePEc:eee:ejores:v:215:y:2011:i:3:p:721-729. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Zhang, Lei)
If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.
If references are entirely missing, you can add them using this form.
If the full references list an item that is present in RePEc, but the system did not link to it, you can help with this form.
If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your profile, as there may be some citations waiting for confirmation.
Please note that corrections may take a couple of weeks to filter through the various RePEc services.