IDEAS home Printed from https://ideas.repec.org/p/arx/papers/2008.01618.html
   My bibliography  Save this paper

Distributionally Robust Pricing in Independent Private Value Auctions

Author

Listed:
  • Alex Suzdaltsev

Abstract

A seller chooses a reserve price in a second-price auction to maximize worst-case expected revenue when she knows only the mean of value distribution and an upper bound on either values themselves or variance. Values are private and iid. Using an indirect technique, we prove that it is always optimal to set the reserve price to the seller's own valuation. However, the maxmin reserve price may not be unique. If the number of bidders is sufficiently high, all prices below the seller's valuation, including zero, are also optimal. A second-price auction with the reserve equal to seller's value (or zero) is an asymptotically optimal mechanism (among all ex post individually rational mechanisms) as the number of bidders grows without bound.

Suggested Citation

  • Alex Suzdaltsev, 2020. "Distributionally Robust Pricing in Independent Private Value Auctions," Papers 2008.01618, arXiv.org, revised Aug 2020.
    • Handle: RePEc:arx:papers:2008.01618
    as

    Download full text from publisher

    File URL: http://arxiv.org/pdf/2008.01618
    File Function: Latest version
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. Kim-Sau Chung & J.C. Ely, 2007. "Foundations of Dominant-Strategy Mechanisms," The Review of Economic Studies, Review of Economic Studies Ltd, vol. 74(2), pages 447-476.
    2. Paarsch, Harry J., 1997. "Deriving an estimate of the optimal reserve price: An application to British Columbian timber sales," Journal of Econometrics, Elsevier, vol. 78(2), pages 333-357, June.
    3. , & , & ,, 2006. "Optimal auctions with ambiguity," Theoretical Economics, Econometric Society, vol. 1(4), pages 411-438, December.
    4. Dirk Bergemann & Benjamin Brooks & Stephen Morris, 2017. "First‐Price Auctions With General Information Structures: Implications for Bidding and Revenue," Econometrica, Econometric Society, vol. 85, pages 107-143, January.
    5. Songzi Du, 2018. "Robust Mechanisms Under Common Valuation," Econometrica, Econometric Society, vol. 86(5), pages 1569-1588, September.
    6. R. Preston McAfee & Daniel C. Quan & Daniel R. Vincent, 2002. "How to Set Minimum Acceptable Bids, with an Application to Real Estate Auctions," Journal of Industrial Economics, Wiley Blackwell, vol. 50(4), pages 391-416, December.
    7. Philippe Jehiel & Laurent Lamy, 2015. "On absolute auctions and secret reserve prices," RAND Journal of Economics, RAND Corporation, vol. 46(2), pages 241-270, June.
    8. Wolitzky, Alexander, 2016. "Mechanism design with maxmin agents: theory and an application to bilateral trade," Theoretical Economics, Econometric Society, vol. 11(3), September.
    Full references (including those not matched with items on IDEAS)

    Citations

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


    Cited by:

    1. He, Wei & Li, Jiangtao, 2022. "Correlation-robust auction design," Journal of Economic Theory, Elsevier, vol. 200(C).
    2. Yi-Chun Chen & Xiangqian Yang, 2020. "Information Design in Optimal Auctions," Papers 2010.08990, arXiv.org, revised Oct 2022.
    3. Chen, Yi-Chun & Yang, Xiangqian, 2023. "Information design in optimal auctions," Journal of Economic Theory, Elsevier, vol. 212(C).
    4. Pieter Kleer & Johan van Leeuwaarden, 2022. "Optimal Stopping Theory for a Distributionally Robust Seller," Papers 2206.02477, arXiv.org, revised Jun 2022.
    5. Wanchang Zhang, 2022. "Information-Robust Optimal Auctions," Papers 2205.04137, arXiv.org.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Suzdaltsev, Alex, 2022. "Distributionally robust pricing in independent private value auctions," Journal of Economic Theory, Elsevier, vol. 206(C).
    2. Tang, Rui & Zhang, Mu, 2021. "Maxmin implementation," Journal of Economic Theory, Elsevier, vol. 194(C).
    3. Alex Suzdaltsev, 2020. "An Optimal Distributionally Robust Auction," Papers 2006.05192, arXiv.org, revised Aug 2020.
    4. Wanchang Zhang, 2021. "Random Double Auction: A Robust Bilateral Trading Mechanism," Papers 2105.05427, arXiv.org, revised May 2022.
    5. Richard P. McLean & Andrew Postlewaite, 2024. "Information Requirements for Mechanism Design," PIER Working Paper Archive 24-035, Penn Institute for Economic Research, Department of Economics, University of Pennsylvania.
    6. Ethan Che, 2019. "Distributionally Robust Optimal Auction Design under Mean Constraints," Papers 1911.07103, arXiv.org, revised Feb 2022.
    7. Laohakunakorn, Krittanai & Levy, Gilat & Razin, Ronny, 2019. "Private and common value auctions with ambiguity over correlation," LSE Research Online Documents on Economics 101410, London School of Economics and Political Science, LSE Library.
    8. Zihao Li & Jonathan Libgober & Xiaosheng Mu, 2022. "Sequentially Optimal Pricing under Informational Robustness," Papers 2202.04616, arXiv.org, revised Jun 2024.
    9. Bhattacharya, Vivek & Manuelli, Lucas & Straub, Ludwig, 2018. "Imperfect public monitoring with a fear of signal distortion," Journal of Economic Theory, Elsevier, vol. 175(C), pages 1-37.
    10. Wanchang Zhang, 2022. "Robust Private Supply of a Public Good," Papers 2201.00923, arXiv.org, revised Jan 2022.
    11. Saponara, Nick, 2022. "Revealed reasoning," Journal of Economic Theory, Elsevier, vol. 199(C).
    12. Ju Hu & Xi Weng, 2021. "Robust persuasion of a privately informed receiver," Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 72(3), pages 909-953, October.
    13. He, Wei & Li, Jiangtao, 2022. "Correlation-robust auction design," Journal of Economic Theory, Elsevier, vol. 200(C).
    14. Laohakunakorn, Krittanai & Levy, Gilat & Razin, Ronny, 2019. "Private and common value auctions with ambiguity over correlation," Journal of Economic Theory, Elsevier, vol. 184(C).
    15. Richard McLean & Andrew Postlewaite, 2018. "A Very Robust Auction Mechanism," PIER Working Paper Archive 18-001, Penn Institute for Economic Research, Department of Economics, University of Pennsylvania, revised 16 Jan 2018.
    16. Wei He & Jiangtao Li & Weijie Zhong, 2024. "Rank-Guaranteed Auctions," Papers 2408.12001, arXiv.org.
    17. Simon Stevenson & James Young, 2015. "The Role of Undisclosed Reserves in English Open Outcry Auctions," Real Estate Economics, American Real Estate and Urban Economics Association, vol. 43(2), pages 375-402, June.
    18. Sosung Baik & Sung-Ha Hwang, 2021. "Auction design with ambiguity: Optimality of the first-price and all-pay auctions," Papers 2110.08563, arXiv.org.
    19. Tommaso Denti & Doron Ravid, 2023. "Robust Predictions in Games with Rational Inattention," Papers 2306.09964, arXiv.org.
    20. Song, Yangwei, 2018. "Efficient Implementation with Interdependent Valuations and Maxmin Agents," Rationality and Competition Discussion Paper Series 92, CRC TRR 190 Rationality and Competition.

    More about this item

    NEP fields

    This paper has been announced in the following NEP Reports:

    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:arx:papers:2008.01618. 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.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc 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 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: arXiv administrators (email available below). General contact details of provider: http://arxiv.org/ .

    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.