IDEAS home Printed from https://ideas.repec.org/a/wly/quante/v8y2017i1p181-200.html
   My bibliography  Save this article

Ascending auctions with bidder asymmetries

Author

Listed:
  • Dominic Coey
  • Bradley Larsen
  • Kane Sweeney
  • Caio Waisman

Abstract

We present a partial identification approach for ascending auctions with bidder asymmetries, where bidders' asymmetric types may be unobservable to the econometrician. Our approach yields sharp bounds and builds on and generalizes other recent bounds approaches for correlated private values ascending auctions. When bidder identities are observable, our approach yields tighter bounds than previous approaches that ignore asymmetry, demonstrating that bidder asymmetries can function as an aid rather than a hindrance to identification. We present a nonparametric estimation and inference approach relying on our identification argument and apply it to data from U.S. timber auctions, finding that bounds on optimal reserve prices and other objects of interest are noticeably tighter when exploiting bidder asymmetries.

Suggested Citation

  • Dominic Coey & Bradley Larsen & Kane Sweeney & Caio Waisman, 2017. "Ascending auctions with bidder asymmetries," Quantitative Economics, Econometric Society, vol. 8(1), pages 181-200, March.
  • Handle: RePEc:wly:quante:v:8:y:2017:i:1:p:181-200
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/
    Download Restriction: no
    ---><---

    Citations

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


    Cited by:

    1. Yu Zhu, 2020. "Inference in nonparametric/semiparametric moment equality models with shape restrictions," Quantitative Economics, Econometric Society, vol. 11(2), pages 609-636, May.
    2. Joachim Freyberger & Bradley J. Larsen, 2022. "Identification in ascending auctions, with an application to digital rights management," Quantitative Economics, Econometric Society, vol. 13(2), pages 505-543, May.
    3. Jayeeta Bhattacharya & Nathalie Gimenes & Emmanuel Guerre, 2019. "Semiparametric Quantile Models for Ascending Auctions with Asymmetric Bidders," Papers 1911.13063, arXiv.org, revised Sep 2020.
    4. Dominic Coey & Bradley J. Larsen & Kane Sweeney & Caio Waisman, 2021. "Scalable Optimal Online Auctions," Marketing Science, INFORMS, vol. 40(4), pages 593-618, July.
    5. Marleen Marra, 2020. "Sample Spacings for Identification: The Case of English Auctions with Absentee Bidding," Working Papers hal-03878412, HAL.
    6. Kirkegaard, René, 2022. "Efficiency in asymmetric auctions with endogenous reserve prices," Games and Economic Behavior, Elsevier, vol. 132(C), pages 234-239.

    More about this item

    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:wly:quante:v:8:y:2017:i:1:p:181-200. 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: Wiley Content Delivery (email available below). General contact details of provider: https://edirc.repec.org/data/essssea.html .

    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.