IDEAS home Printed from https://ideas.repec.org/p/arx/papers/2509.21439.html

Dynamic Threats to Credible Auctions

Author

Listed:
  • Martino Banchio
  • Andrzej Skrzypacz
  • Frank Yang

Abstract

A seller wants to sell a good to a set of bidders using a credible mechanism. We show that when the seller has private information about her cost, it is impossible for a static mechanism to achieve the optimal revenue. In particular, even the optimal first-price auction is not credible. We show that the English auction can credibly implement the optimal mechanism, unlike the optimal Dutch auction. For symmetric mechanisms in which only winners pay, we also characterize all the static auctions that are credible: They are first-price auctions that depend only on the seller's cost ex post via a secret reserve, and may profitably pool bidders via a bid restriction. Our impossibility result highlights the role of public institutions and helps explain the use of dynamic mechanisms in informal auctions.

Suggested Citation

  • Martino Banchio & Andrzej Skrzypacz & Frank Yang, 2025. "Dynamic Threats to Credible Auctions," Papers 2509.21439, arXiv.org.
    • Handle: RePEc:arx:papers:2509.21439
    as

    Download full text from publisher

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

    References listed on IDEAS

    as
    1. repec:hal:pseose:halshs-01273256 is not listed on IDEAS
    2. Bester, Helmut & Strausz, Roland, 2001. "Contracting with Imperfect Commitment and the Revelation Principle: The Single Agent Case," Econometrica, Econometric Society, vol. 69(4), pages 1077-1098, July.
    3. Vianney Dequiedt & David Martimort, 2015. "Vertical Contracting with Informational Opportunism," American Economic Review, American Economic Association, vol. 105(7), pages 2141-2182, July.
    4. Tymofiy Mylovanov & Thomas Tröger, 2014. "Mechanism Design by an Informed Principal: Private Values with Transferable Utility," The Review of Economic Studies, Review of Economic Studies Ltd, vol. 81(4), pages 1668-1707.
    5. Alejandro M. Manelli & Daniel R. Vincent, 2010. "Bayesian and Dominant‐Strategy Implementation in the Independent Private‐Values Model," Econometrica, Econometric Society, vol. 78(6), pages 1905-1938, November.
    6. Qingmin Liu & Konrad Mierendorff & Xianwen Shi & Weijie Zhong, 2019. "Auctions with Limited Commitment," American Economic Review, American Economic Association, vol. 109(3), pages 876-910, March.
    Full references (including those not matched with items on IDEAS)

    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. Suehyun Kwon, 2018. "Selling Complementary Goods: Information and Products," CESifo Working Paper Series 7394, CESifo.
    2. Markus Möller, 2024. "Transparent Matching Mechanisms," ECONtribute Discussion Papers Series 306, University of Bonn and University of Cologne, Germany.
    3. Suehyun Kwon, 2019. "Informed-Principal Problem in Mechanisms with Limited Commitment," CESifo Working Paper Series 7513, CESifo.
    4. Doval, Laura & Skreta, Vasiliki, 2024. "Optimal mechanism for the sale of a durable good," Theoretical Economics, Econometric Society, vol. 19(2), May.
    5. Laura Doval & Vasiliki Skreta, 2022. "Mechanism Design With Limited Commitment," Econometrica, Econometric Society, vol. 90(4), pages 1463-1500, July.
    6. Markus Möller, 2025. "Transparent Matching Mechanisms," CRC TR 224 Discussion Paper Series crctr224_2025_666, University of Bonn and University of Mannheim, Germany.
    7. Martino Banchio & Frank Yang, 2021. "Dynamic Pricing with Limited Commitment," Papers 2102.07742, arXiv.org, revised Dec 2021.
    8. Suehyun Kwon, 2019. "Revelation Principle with Persistent Correlated Types: Impossibility Result," CESifo Working Paper Series 7782, CESifo.
    9. Andrew Koh & Sivakorn Sanguanmoo & Kei Uzui, 2024. "Informational Puts," Papers 2411.09191, arXiv.org, revised Dec 2024.
    10. Santiago R. Balseiro & Omar Besbes & Gabriel Y. Weintraub, 2019. "Dynamic Mechanism Design with Budget-Constrained Buyers Under Limited Commitment," Operations Research, INFORMS, vol. 67(3), pages 711-730, May.
    11. Fugger, Nicolas & Gretschko, Vitali & Pollrich, Martin, 2019. "Sequential procurement with limited commitment," ZEW Discussion Papers 19-030, ZEW - Leibniz Centre for European Economic Research.
    12. Ahrash Dianat & Mikhail Freer, 2021. "Credibility in Second-Price Auctions: An Experimental Test," Papers 2105.00204, arXiv.org, revised Jan 2023.
    13. Francesco Giovannoni & Toomas Hinnosaar, 2022. "Pricing Novel Goods," Papers 2208.04985, arXiv.org, revised Aug 2024.
    14. Xi Shan & Lixin Ye & Chenglin Zhang, 2024. "Note on Optimal Procurement Mechanisms for Assembly," Manufacturing & Service Operations Management, INFORMS, vol. 26(6), pages 2231-2236, November.
    15. Hori, Kazumi, 2008. "The role of private benefits in information acquisition," Journal of Economic Behavior & Organization, Elsevier, vol. 68(3-4), pages 626-631, December.
    16. Goeree, Jacob K. & Kushnir, Alexey, 2016. "Reduced form implementation for environments with value interdependencies," Games and Economic Behavior, Elsevier, vol. 99(C), pages 250-256.
    17. Beccuti, Juan & Möller, Marc, 2021. "Screening by mode of trade," Games and Economic Behavior, Elsevier, vol. 129(C), pages 400-420.
    18. Dennis L. Gärtner, 2010. "Monopolistic screening under learning by doing," RAND Journal of Economics, RAND Corporation, vol. 41(3), pages 574-597, September.
    19. Johannes Münster & Markus Reisinger, 2021. "Sequencing Bilateral Negotiations with Externalities," ECONtribute Discussion Papers Series 096, University of Bonn and University of Cologne, Germany.
    20. Anton Kolotilin & Andriy Zapechelnyuk, 2025. "Persuasion Meets Delegation," Econometrica, Econometric Society, vol. 93(1), pages 195-228, January.

    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:2509.21439. 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: https://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.