IDEAS home Printed from https://ideas.repec.org/a/kap/jrefec/v17y1998i3p219-32.html

Simultaneous Pooled Auctions

Author

Listed:
  • Menezes, Flavio M
  • Monteiro, Paulo Klinger

Abstract

Suppose 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

Suggested Citation

  • Menezes, Flavio M & Monteiro, Paulo Klinger, 1998. "Simultaneous Pooled Auctions," The Journal of Real Estate Finance and Economics, Springer, vol. 17(3), pages 219-232, November.
    • Handle: RePEc:kap:jrefec:v:17:y:1998:i:3:p:219-32
    as

    Download full text from publisher

    File URL: http://journals.kluweronline.com/issn/0895-5638/contents
    File Function: link to full text
    Download Restriction: Access to full text is restricted to subscribers.
    ---><---

    As the access to this document is restricted, you may want to look for a different version below or

    for a different version of it.

    Other versions of this item:

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. 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.
    2. Page Jr., Frank H., 1998. "Existence of optimal auctions in general environments," Journal of Mathematical Economics, Elsevier, vol. 29(4), pages 389-418, May.
    3. Estrella Alonso & Joaquin Sanchez-Soriano & Juan Tejada, 2015. "A parametric family of two ranked objects auctions: equilibria and associated risk," Annals of Operations Research, Springer, vol. 225(1), pages 141-160, February.
    4. Kfir Eliaz, 2003. "Creating competition out of thin air: Market thickening and right-to-choose auctions," Theory workshop papers 658612000000000047, UCLA Department of Economics.
    5. 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.
    6. Sander Renes, 2011. "Balancing the Bids, Solutions for Unit Price Auctions," Tinbergen Institute Discussion Papers 11-047/1, Tinbergen Institute.
    7. Jonathan E. Alevy & Julianna Butler & Michael Price, 2016. "Multi-good Demand in Bidder's Choice Auctions: Experimental Evidence from the Lab and the Field," Working Papers 2016-01, University of Alaska Anchorage, Department of Economics.
    8. Juan Feng, 2008. "—Optimal Mechanism for Selling a Set of Commonly Ranked Objects," Marketing Science, INFORMS, vol. 27(3), pages 501-512, 05-06.
    9. Yuen Leng Chow & Joseph T.L. Ooi, 2014. "First-Price Sealed-Bid Tender versus English Open Auction: Evidence from Land Auctions," Real Estate Economics, American Real Estate and Urban Economics Association, vol. 42(2), pages 253-278, June.
    10. Burguet, Roberto, 2007. "Right to choose in oral auctions," Economics Letters, Elsevier, vol. 95(2), pages 167-173, May.
    11. 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.
    12. Juan Feng, 2004. "Optimal Allocation Mechanisms When Bidders Ranking for the objects is common," Econometric Society 2004 North American Summer Meetings 545, Econometric Society.
    13. Estrella Alonso & Joaquín Sánchez-Soriano & Juan Tejada, 2020. "Mixed Mechanisms for Auctioning Ranked Items," Mathematics, MDPI, vol. 8(12), pages 1-26, December.

    More about this item

    JEL classification:

    • D44 - Microeconomics - - Market Structure, Pricing, and Design - - - Auctions

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:kap:jrefec:v:17:y:1998:i:3:p:219-32. See general information about how to correct material in RePEc.

    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.

    We have no bibliographic references for this item. You can help adding them by using 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 RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.