Simultaneous Pooled Auctions
AbstractSuppose a seller wants to sell k similar or identical objects and there are n greater than k potential buyers. Suppose that each buyer wants only one object. In this case, we suggest the use of a simultaneous auction that would work as follows. Players are asked to submit sealed bids for one object. The individual with the highest bid chooses an object first; the individual with the second-highest bid chooses the next object; and this process continues until the individual with the kth highest bid receives the last object. Each individual pays the equivalent to his other bid. When objects are identical, we show that the proposed auction generates the same revenue as a first-price sealed-bid sequential auction. When objects are perfectly correlated, there is no known solution for sequential auctions, whereas we can characterize bidding strategies in the proposed auction. Moreover, the proposed auction is optimal (given an appropriately chosen reserve price), and it may be easier and cheaper to run than a sequential auction. Copyright 1998 by Kluwer Academic Publishers
Download InfoIf 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.
Bibliographic InfoArticle provided by Springer in its journal Journal of Real Estate Finance & Economics.
Volume (Year): 17 (1998)
Issue (Month): 3 (November)
Contact details of provider:
Web page: http://www.springerlink.com/link.asp?id=102945
Other versions of this item:
- D44 - Microeconomics - - Market Structure and Pricing - - - Auctions
- D40 - Microeconomics - - Market Structure and Pricing - - - General
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.:
- Mayer Christopher J., 1995. "A Model of Negotiated Sales Applied to Real Estate Auctions," Journal of Urban Economics, Elsevier, vol. 38(1), pages 1-22, July.
- Fl. Menezes & P.K.Monteiro, 1994.
"Sequential Asymmetric Auctions With Endogenous Participation,"
9402001, EconWPA, revised 09 Jun 1994.
- Flavio Menezes & Paulo Monteiro, 1997. "Sequential asymmetric auctions with endogenous participation," Theory and Decision, Springer, vol. 43(2), pages 187-202, September.
- repec:att:wimass:9215 is not listed on IDEAS
- Gale Ian L. & Hausch Donald B., 1994. "Bottom-Fishing and Declining Prices in Sequential Auctions," Games and Economic Behavior, Elsevier, vol. 7(3), pages 318-331, November.
- Kfir Eliaz, 2003.
"Creating competition out of thin air: Market thickening and right-to-choose auctions,"
Theory workshop papers
658612000000000047, UCLA Department of Economics.
- Eliaz, Kfir & Offerman, Theo & Schotter, Andrew, 2004. "Creating Competition Out of Thin Air: Market Thickening and Right-to-Choose Auctions," CEPR Discussion Papers 4678, C.E.P.R. Discussion Papers.
- Burguet, Roberto, 2007.
"Right to choose in oral auctions,"
Elsevier, vol. 95(2), pages 167-173, May.
- Maarten C.W. Janssen & Vladimir A. Karamychev & Emiel Maasland, 2008. "Simultaneous Pooled Auctions with Multiple Bids and Preference Lists," Tinbergen Institute Discussion Papers 08-034/1, Tinbergen Institute.
- Page Jr., Frank H., 1998.
"Existence of optimal auctions in general environments,"
Journal of Mathematical Economics,
Elsevier, vol. 29(4), pages 389-418, May.
- Page Jr., F.H., 1997. "Existence of Optimal Auctions in General Environments," Discussion Paper 1997-28, Tilburg University, Center for Economic Research.
- Salmon, Timothy C. & Iachini, Michael, 2007. "Continuous ascending vs. pooled multiple unit auctions," Games and Economic Behavior, Elsevier, vol. 61(1), pages 67-85, October.
- Maarten C.W. Janssen & Vladimir A. Karamychev & Emiel Maasland, 2008.
"Simultaneous Pooled Auctions with Multiple Bids and Preference Lists,"
Tinbergen Institute Discussion Papers
08-034/1, Tinbergen Institute.
- Maarten C. W. Janssen & Vladimir A. Karamychev & Emiel Maasland, 2010. "Simultaneous Pooled Auctions with Multiple Bids and Preference Lists," Journal of Institutional and Theoretical Economics (JITE), Mohr Siebeck, Tübingen, vol. 166(2), pages 286-298, June.
- Juan Feng, 2004. "Optimal Allocation Mechanisms When Bidders Ranking for the objects is common," Econometric Society 2004 North American Summer Meetings 545, Econometric Society.
- Sander Renes, 2011. "Balancing the Bids, Solutions for Unit Price Auctions," Tinbergen Institute Discussion Papers 11-047/1, Tinbergen Institute.
- Eliaz, Kfir & Offerman, Theo & Schotter, Andrew, 2008. "Creating competition out of thin air: An experimental study of right-to-choose auctions," Games and Economic Behavior, Elsevier, vol. 62(2), pages 383-416, March.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Guenther Eichhorn) or (Christopher F. Baum).
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.