[go: up one dir, main page]
IDEAS home Printed from https://ideas.repec.org/p/arx/papers/2301.07312.html
   My bibliography  Save this paper

Auctions without commitment in the auto-bidding world

Author

Listed:
  • Aranyak Mehta
  • Andres Perlroth
Abstract
Advertisers in online ad auctions are increasingly using auto-bidding mechanisms to bid into auctions instead of directly bidding their value manually. One prominent auto-bidding format is the target cost-per-acquisition (tCPA) which maximizes the volume of conversions subject to a return-of-investment constraint. From an auction theoretic perspective however, this trend seems to go against foundational results that postulate that for profit-maximizing bidders, it is optimal to use a classic bidding system like marginal CPA (mCPA) bidding rather than using strategies like tCPA. In this paper we rationalize the adoption of such seemingly sub-optimal bidding within the canonical quasi-linear framework. The crux of the argument lies in the notion of commitment. We consider a multi-stage game where first the auctioneer declares the auction rules; then bidders select either the tCPA or mCPA bidding format and then, if the auctioneer lacks commitment, it can revisit the rules of the auction (e.g., may readjust reserve prices depending on the observed bids). Our main result is that so long as a bidder believes that the auctioneer lacks commitment to follow the rule of the declared auction then the bidder will make a higher profit by choosing the tCPA format over the mCPA format. We then explore the commitment consequences for the auctioneer. In a simplified version of the model where there is only one bidder, we show that the tCPA subgame admits a credible equilibrium while the mCPA format does not. That is, when the bidder chooses the tCPA format the auctioneer can credibly implement the auction rules announced at the beginning of the game. We also show that, under some mild conditions, the auctioneer's revenue is larger when the bidder uses the tCPA format rather than mCPA. We further quantify the value for the auctioneer to be able to commit to the declared auction rules.

Suggested Citation

  • Aranyak Mehta & Andres Perlroth, 2023. "Auctions without commitment in the auto-bidding world," Papers 2301.07312, arXiv.org, revised Mar 2023.
    • Handle: RePEc:arx:papers:2301.07312
    as

    Download full text from publisher

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

    References listed on IDEAS

    as
    1. Bester, Helmut & Strausz, Roland, 2000. "Imperfect commitment and the revelation principle: the multi-agent case," Economics Letters, Elsevier, vol. 69(2), pages 165-171, November.
    2. Che, Yeon-Koo & Gale, Ian, 2000. "The Optimal Mechanism for Selling to a Budget-Constrained Buyer," Journal of Economic Theory, Elsevier, vol. 92(2), pages 198-233, June.
    3. 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.
    4. Santiago R. Balseiro & Yonatan Gur, 2019. "Learning in Repeated Auctions with Budgets: Regret Minimization and Equilibrium," Management Science, INFORMS, vol. 65(9), pages 3952-3968, September.
    5. Gul, Faruk & Sonnenschein, Hugo & Wilson, Robert, 1986. "Foundations of dynamic monopoly and the coase conjecture," Journal of Economic Theory, Elsevier, vol. 39(1), pages 155-190, June.
    6. Roger B. Myerson, 1981. "Optimal Auction Design," Mathematics of Operations Research, INFORMS, vol. 6(1), pages 58-73, February.
    7. Laffont, Jean-Jacques & Robert, Jacques, 1996. "Optimal auction with financially constrained buyers," Economics Letters, Elsevier, vol. 52(2), pages 181-186, August.
    8. Matheus V. X. Ferreira & S. Matthew Weinberg, 2020. "Credible, Truthful, and Two-Round (Optimal) Auctions via Cryptographic Commitments," Papers 2004.01598, arXiv.org, revised May 2020.
    9. Mohammad Akbarpour & Shengwu Li, 2020. "Credible Auctions: A Trilemma," Econometrica, Econometric Society, vol. 88(2), pages 425-467, March.
    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. Yiding Feng & Brendan Lucier & Aleksandrs Slivkins, 2023. "Strategic Budget Selection in a Competitive Autobidding World," Papers 2307.07374, arXiv.org, revised Nov 2023.
    2. Yeganeh Alimohammadi & Aranyak Mehta & Andres Perlroth, 2023. "Incentive Compatibility in the Auto-bidding World," Papers 2301.13414, arXiv.org, revised May 2024.

    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. 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.
    2. Skreta, Vasiliki, 2015. "Optimal auction design under non-commitment," Journal of Economic Theory, Elsevier, vol. 159(PB), pages 854-890.
    3. Hannu Vartiainen, 2003. "Auction Design without Commitment," Working Papers 2003.24, Fondazione Eni Enrico Mattei.
    4. Santiago Balseiro & Anthony Kim & Mohammad Mahdian & Vahab Mirrokni, 2021. "Budget-Management Strategies in Repeated Auctions," Operations Research, INFORMS, vol. 69(3), pages 859-876, May.
    5. Bergemann, Dirk & Pavan, Alessandro, 2015. "Introduction to Symposium on Dynamic Contracts and Mechanism Design," Journal of Economic Theory, Elsevier, vol. 159(PB), pages 679-701.
    6. Yiding Feng & Jason Hartline & Yingkai Li, 2020. "Simple Mechanisms for Agents with Non-linear Utilities," Papers 2003.00545, arXiv.org, revised Oct 2022.
    7. Markus Möller, 2024. "Transparent Matching Mechanisms," ECONtribute Discussion Papers Series 306, University of Bonn and University of Cologne, Germany.
    8. Quintero Jaramillo, Jose E., 2004. "Liquidity constraints and credit subsidies in auctions," DEE - Working Papers. Business Economics. WB wb040604, Universidad Carlos III de Madrid. Departamento de Economía de la Empresa.
    9. Dirk Bergemann & Alessandro Pavan, 2015. "Introduction to JET Symposium Issue on "Dynamic Contracts and Mechanism Design"," Cowles Foundation Discussion Papers 2016, Cowles Foundation for Research in Economics, Yale University.
    10. Mohammad Akbarpour & Shengwu Li, 2020. "Credible Auctions: A Trilemma," Econometrica, Econometric Society, vol. 88(2), pages 425-467, March.
    11. Burkett, Justin, 2016. "Optimally constraining a bidder using a simple budget," Theoretical Economics, Econometric Society, vol. 11(1), January.
    12. Wei Chen & Milind Dawande & Ganesh Janakiraman, 2018. "Optimal Procurement Auctions Under Multistage Supplier Qualification," Manufacturing & Service Operations Management, INFORMS, vol. 20(3), pages 566-582, July.
    13. Burkett, Justin, 2015. "Endogenous budget constraints in auctions," Journal of Economic Theory, Elsevier, vol. 158(PA), pages 1-20.
    14. Meryem Essaidi & Matheus V. X. Ferreira & S. Matthew Weinberg, 2022. "Credible, Strategyproof, Optimal, and Bounded Expected-Round Single-Item Auctions for all Distributions," Papers 2205.14758, arXiv.org.
    15. Laura Doval & Vasiliki Skreta, 2022. "Mechanism Design With Limited Commitment," Econometrica, Econometric Society, vol. 90(4), pages 1463-1500, July.
    16. Santiago R. Balseiro & Ozan Candogan, 2017. "Optimal Contracts for Intermediaries in Online Advertising," Operations Research, INFORMS, vol. 65(4), pages 878-896, August.
    17. Juan I. Beccuti, 2014. "Optimal Selling Mechanisms under Imperfect Commitment: Extending to the Multi-Period Case," Diskussionsschriften dp1402, Universitaet Bern, Departement Volkswirtschaft.
    18. Chaithanya Bandi & Dimitris Bertsimas, 2014. "Optimal Design for Multi-Item Auctions: A Robust Optimization Approach," Mathematics of Operations Research, INFORMS, vol. 39(4), pages 1012-1038, November.
    19. Santiago R. Balseiro & Omar Besbes & Gabriel Y. Weintraub, 2015. "Repeated Auctions with Budgets in Ad Exchanges: Approximations and Design," Management Science, INFORMS, vol. 61(4), pages 864-884, April.
    20. Pai, Mallesh M. & Vohra, Rakesh, 2014. "Optimal auctions with financially constrained buyers," Journal of Economic Theory, Elsevier, vol. 150(C), pages 383-425.

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