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

The Targeted-Loss Exposure Frontier in Auctions

Author

Listed:
  • Hiroaki Odahara

    (Market Design Center, Graduate School of Economics, The University of Tokyo
    Graduate School of Informatics and Engineering, The University of Electro-Communications)

Abstract

Pay-to-bid auctions charge participants before allocation and therefore make losing-side payments vulnerable to seller intervention. This paper introduces targeted-loss exposure, a stress test that records a designated bidder's payment when one rival's equilibrium report is fixed at an arbitrarily high level while her type distribution is preserved. Under nonnegative payments and an ordering in which a winner pays at least as much as a loser, revenue equivalence yields a sharp two-bidder bound attained by the silent war of attrition. For any number of bidders, the same format attains the upper bound among payment-ordered rank-local rules. The proof formulates payment location as a linear program and constructs a dual probability measure. With more than two bidders, complementary slackness determines the optimal loser-payment schedule almost everywhere. Winner-pay auctions have zero exposure, standard all-pay auctions lie strictly below the frontier, and frontier exposure decreases as the number of bidders rises. A loser-only rule shows that removing payment ordering can make exposure unbounded. A common-shock extension also shows that anticipating intervention changes bids but preserves the ordering of standard formats. The results separate the total interim payment fixed by revenue equivalence from the winning or losing state to which that payment is attached.

Suggested Citation

  • Hiroaki Odahara, 2026. "The Targeted-Loss Exposure Frontier in Auctions," Papers 2607.29518, arXiv.org.
  • Handle: RePEc:arx:papers:2607.29518
    as

    Download full text from publisher

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

    References listed on IDEAS

    as
    1. Roger B. Myerson, 1981. "Optimal Auction Design," Mathematics of Operations Research, INFORMS, vol. 6(1), pages 58-73, February.
    2. Murto, Pauli & Välimäki, Juuso, 2017. "Large all-pay auctions with IPV bidders," Journal of Economic Theory, Elsevier, vol. 169(C), pages 629-640.
    3. Mohammad Akbarpour & Shengwu Li, 2020. "Credible Auctions: A Trilemma," Econometrica, Econometric Society, vol. 88(2), pages 425-467, March.
    4. Ned Augenblick, 2016. "The Sunk-Cost Fallacy in Penny Auctions," The Review of Economic Studies, Review of Economic Studies Ltd, vol. 83(1), pages 58-86.
    5. Krishna, Vijay & Morgan, John, 1997. "An Analysis of the War of Attrition and the All-Pay Auction," Journal of Economic Theory, Elsevier, vol. 72(2), pages 343-362, February.
    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. Sosung Baik & Sung-Ha Hwang, 2021. "Auction design with ambiguity: Optimality of the first-price and all-pay auctions," Papers 2110.08563, arXiv.org.
    2. Aner Sela & Yizhaq Minchuk, 2024. "Carrots and sticks: collaboration of taxation and subsidies in contests," Working Papers 2407, Ben-Gurion University of the Negev, Department of Economics.
    3. Giuseppe Lopomo, 2004. "Optimality and Robustness of the English Auction," Levine's Bibliography 122247000000000391, UCLA Department of Economics.
    4. Deng, Shanglyu & Fu, Qiang & Wu, Zenan & Zhu, Yuxuan, 2024. "Contests with sequential entry and incomplete information," Theoretical Economics, Econometric Society, vol. 19(2), May.
    5. Alireza Fallah & Ali Makhdoumi & Azarakhsh Malekian & Asuman Ozdaglar, 2024. "Optimal and Differentially Private Data Acquisition: Central and Local Mechanisms," Operations Research, INFORMS, vol. 72(3), pages 1105-1123, May.
    6. Andrew Komo & Scott Duke Kominers & Tim Roughgarden, 2024. "Shill-Proof Auctions," Papers 2404.00475, arXiv.org, revised Dec 2025.
    7. Levine, David K. & Mattozzi, Andrea & Modica, Salvatore, 2024. "The tripartite auction folk theorem," European Economic Review, Elsevier, vol. 162(C).
    8. Mezzetti, Claudio & Tsetlin, Ilia, 2009. "Auctions in which losers set the price," Games and Economic Behavior, Elsevier, vol. 66(2), pages 855-864, July.
    9. Wenqian Wang & Zhiwen Zheng, 2025. "On the Dominance of Truth-Telling in Gradual Mechanisms," Papers 2501.08802, arXiv.org, revised Jun 2026.
    10. Yizhaq Minchuk & Aner Sela, 2020. "Contests with insurance," Review of Economic Design, Springer;Society for Economic Design, vol. 24(1), pages 1-22, June.
    11. Alexander Teytelboym & Shengwu Li & Scott Duke Kominers & Mohammad Akbarpour & Piotr Dworczak, 2021. "Discovering Auctions: Contributions of Paul Milgrom and Robert Wilson," Scandinavian Journal of Economics, Wiley Blackwell, vol. 123(3), pages 709-750, July.
    12. Enache, Andreea & Florens, Jean-Pierre, 2024. "Quantile analysis of “hazard-rate” game models," Journal of Econometrics, Elsevier, vol. 238(2).
    13. Stenborg, Markku, 2003. "Waiting for F/OSS: Coordinating the Production of Free/Open Source Software," Discussion Papers 884, The Research Institute of the Finnish Economy.
    14. Ødegaard, Fredrik & Anderson, Chris K., 2014. "All-pay auctions with pre- and post-bidding options," European Journal of Operational Research, Elsevier, vol. 239(2), pages 579-592.
    15. Sui, Yong, 2006. "All-pay auctions with resale," MPRA Paper 11463, University Library of Munich, Germany, revised Oct 2007.
    16. Lauri Lov'en & Sasu Tarkoma, 2026. "The Endogeneity of Miscalibration: Impossibility and Escape in Scored Reporting," Papers 2605.07671, arXiv.org, revised Oct 2026.
    17. David P. Myatt, 2005. "Instant Exit from the Asymmetric War of Attrition," Economics Series Working Papers 160, University of Oxford, Department of Economics.
    18. Matheus V. X. Ferreira & Daniel J. Moroz & David C. Parkes & Mitchell Stern, 2021. "Dynamic Posted-Price Mechanisms for the Blockchain Transaction Fee Market," Papers 2103.14144, arXiv.org, revised Nov 2021.
    19. Cramton, Peter C, 1995. "Money Out of Thin Air: The Nationwide Narrowband PCS Auction," Journal of Economics & Management Strategy, Wiley Blackwell, vol. 4(2), pages 267-343, Summer.
    20. Jamie Tucker-Foltz & Richard Zeckhauser, 2026. "Cheap Talk in Bilateral Trade," Papers 2606.01250, arXiv.org.

    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:2607.29518. 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.