IDEAS home Printed from https://ideas.repec.org/a/oup/restud/v86y2019i4p1527-1555..html
   My bibliography  Save this article

Robustly Optimal Auctions with Unknown Resale Opportunities

Author

Listed:
  • Gabriel Carroll
  • Ilya Segal

Abstract

The standard revenue-maximizing auction discriminates against a priori stronger bidders so as to reduce their information rents. We show that such discrimination is no longer optimal when the auction’s winner may resell to another bidder, and the auctioneer has non-Bayesian uncertainty about such resale opportunities. We identify a “worst-case” resale scenario, in which bidders’ values become publicly known after the auction and losing bidders compete Bertrand-style to buy the object from the winner. With this form of resale, misallocation no longer reduces the information rents of the high-value bidder, as he could still secure the same rents by buying the object in resale. Under regularity assumptions, we show that revenue is maximized by a version of the Vickrey auction with bidder-specific reserve prices, first proposed by Ausubel and Cramton (2004). The proof of optimality involves constructing Lagrange multipliers on a double continuum of binding non-local incentive constraints.

Suggested Citation

  • Gabriel Carroll & Ilya Segal, 2019. "Robustly Optimal Auctions with Unknown Resale Opportunities," The Review of Economic Studies, Review of Economic Studies Ltd, vol. 86(4), pages 1527-1555.
    • Handle: RePEc:oup:restud:v:86:y:2019:i:4:p:1527-1555.
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1093/restud/rdy041
    Download Restriction: Access to full text is restricted to subscribers.
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Citations

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


    Cited by:

    1. Flores, Daniel, 2024. "A two-part tariff monopolist with resale," Economics Letters, Elsevier, vol. 243(C).
    2. Hendricks, Ken & Wiseman, Thomas, 2022. "How to sell in a sequential auction market," Theoretical Economics, Econometric Society, vol. 17(4), November.
    3. Lopomo, Giuseppe & Rigotti, Luca & Shannon, Chris, 2022. "Detectability, duality, and surplus extraction," Journal of Economic Theory, Elsevier, vol. 204(C).
    4. Moshe Babaioff & Nicole Immorlica & Yingkai Li & Brendan Lucier, 2021. "Making Auctions Robust to Aftermarkets," Papers 2107.05853, arXiv.org, revised Nov 2022.
    5. Xiaogang Che & Tilman Klumpp, 2023. "Auctions versus sequential mechanisms when resale is allowed," Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 75(4), pages 1207-1245, May.
    6. Bergemann, Dirk & Ottaviani, Marco, 2021. "Information Markets and Nonmarkets," CEPR Discussion Papers 16459, C.E.P.R. Discussion Papers.
    7. Bergemann, Dirk & Brooks, Benjamin & Morris, Stephen, 2020. "Countering the winner's curse: optimal auction design in a common value model," Theoretical Economics, Econometric Society, vol. 15(4), November.
    8. Kenneth Hendricks & Thomas Wiseman, 2021. "How To Sell (or Procure) in a Sequential Auction," Papers 2110.13121, arXiv.org.
    9. Jerry Anunrojwong & Santiago R. Balseiro & Omar Besbes, 2023. "Robust Auction Design with Support Information," Papers 2305.09065, arXiv.org, revised Jan 2025.
    10. Roberto Sarkisian & Takuro Yamashita, 2024. "Optimal student allocation with peer effects," Review of Economic Design, Springer;Society for Economic Design, vol. 28(3), pages 551-571, September.

    More about this item

    Keywords

    Ausubel-Cramton-Vickrey (ACV) auction; Auctions with resale; Duality in auction design; Non-local incentive constraints; Robust revenue maximization; Worst case;
    All these keywords.

    JEL classification:

    • D44 - Microeconomics - - Market Structure, Pricing, and Design - - - Auctions
    • D82 - Microeconomics - - Information, Knowledge, and Uncertainty - - - Asymmetric and Private Information; Mechanism Design

    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:oup:restud:v:86:y:2019:i:4:p:1527-1555.. 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: Oxford University Press (email available below). General contact details of provider: https://academic.oup.com/restud .

    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.