A collection of items is to be distributed among several bidders, and each bidder is to receive at most one item. Assuming that the bidders place some monetary value on each of the items, it has been shown that there is a unique vector of equilibrium prices that is optimal, in a suitable sense, for the bidders. In this paper we describe two dynamic auction mechanisms: one achieves this equilibrium and the other approximates it to any desired degree of accuracy.
(This abstract was borrowed from another version of this item.)
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:ucp:jpolec:v:94:y:1986:i:4:p:863-72. 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: (Journals Division)
If references are entirely missing, you can add them using this form.