A New and Improved Design For Multi-Object Iterative Auctions
In this paper we present a new improved design for multi-object auctions and report on the results of tests of that design. We merge the better features of two extant but very different auction processes, the Milgrom FCC design (see Milgrom (1995)) and the Adaptive User Selection Mechanism (AUSM) of Banks et al. (1989)). Then, by adding one crucial new feature, we are able to create a new design, the Resource Allocation Design (RAD) auction process, which performs better than both. We are able to demonstrate, in both simple and complex environments, that the RAD auction achieves higher efficiencies, lower bidder losses, and faster times to completion without increasing the complexity of a bidder's problem.
|Date of creation:||Nov 1998|
|Date of revision:|
|Publication status:||Published: Management Science Vol. 51, #3, March 2005, pp. 419-434.|
|Contact details of provider:|| Postal: |
Phone: 626 395-4065
Fax: 626 405-9841
Web page: http://www.hss.caltech.edu/ssEmail:
|Order Information:|| Postal: Working Paper Assistant, Division of the Humanities and Social Sciences, 228-77, Caltech, Pasadena CA 91125|
When requesting a correction, please mention this item's handle: RePEc:clt:sswopa:1054. 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: (Victoria Mason)
If references are entirely missing, you can add them using this form.