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

Contextual Standard Auctions with Budgets: Revenue Equivalence and Efficiency Guarantees

Author

Listed:
  • Santiago Balseiro
  • Christian Kroer
  • Rachitesh Kumar

Abstract

The internet advertising market is a multi-billion dollar industry, in which advertisers buy thousands of ad placements every day by repeatedly participating in auctions. An important and ubiquitous feature of these auctions is the presence of campaign budgets, which specify the maximum amount the advertisers are willing to pay over a specified time period. In this paper, we present a new model to study the equilibrium bidding strategies in standard auctions, a large class of auctions that includes first- and second-price auctions, for advertisers who satisfy budget constraints on average. Our model dispenses with the common, yet unrealistic assumption that advertisers' values are independent and instead assumes a contextual model in which advertisers determine their values using a common feature vector. We show the existence of a natural value-pacing-based Bayes-Nash equilibrium under very mild assumptions. Furthermore, we prove a revenue equivalence showing that all standard auctions yield the same revenue even in the presence of budget constraints. Leveraging this equivalence, we prove Price of Anarchy bounds for liquid welfare and structural properties of pacing-based equilibria that hold for all standard auctions. In recent years, the internet advertising market has adopted first-price auctions as the preferred paradigm for selling advertising slots. Our work thus takes an important step toward understanding the implications of the shift to first-price auctions in internet advertising markets by studying how the choice of the selling mechanism impacts revenues, welfare, and advertisers' bidding strategies.

Suggested Citation

  • Santiago Balseiro & Christian Kroer & Rachitesh Kumar, 2021. "Contextual Standard Auctions with Budgets: Revenue Equivalence and Efficiency Guarantees," Papers 2102.10476, arXiv.org, revised Oct 2022.
  • Handle: RePEc:arx:papers:2102.10476
    as

    Download full text from publisher

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

    References listed on IDEAS

    as
    1. Kotowski, Maciej H., 2020. "First-price auctions with budget constraints," Theoretical Economics, Econometric Society, vol. 15(1), January.
    2. Sundaram,Rangarajan K., 1996. "A First Course in Optimization Theory," Cambridge Books, Cambridge University Press, number 9780521497190.
    3. Krishnamurthy Iyer & Ramesh Johari & Mukund Sundararajan, 2014. "Mean Field Equilibria of Dynamic Auctions with Learning," Management Science, INFORMS, vol. 60(12), pages 2949-2970, December.
    4. Vibhanshu Abhishek & Kartik Hosanagar, 2013. "Optimal Bidding in Multi-Item Multislot Sponsored Search Auctions," Operations Research, INFORMS, vol. 61(4), pages 855-873, August.
    5. Yeon-Koo Che & Ian Gale, 1998. "Standard Auctions with Financially Constrained Bidders," The Review of Economic Studies, Review of Economic Studies Ltd, vol. 65(1), pages 1-21.
    6. 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.
    7. Sundaram,Rangarajan K., 1996. "A First Course in Optimization Theory," Cambridge Books, Cambridge University Press, number 9780521497701.
    8. Pai, Mallesh M. & Vohra, Rakesh, 2014. "Optimal auctions with financially constrained buyers," Journal of Economic Theory, Elsevier, vol. 150(C), pages 383-425.
    9. 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.
    10. SCHMEIDLER, David, 1973. "Equilibrium points of nonatomic games," LIDAM Reprints CORE 146, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
    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. Zhaohua Chen & Mingwei Yang & Chang Wang & Jicheng Li & Zheng Cai & Yukun Ren & Zhihua Zhu & Xiaotie Deng, 2022. "Budget-Constrained Auctions with Unassured Priors: Strategic Equivalence and Structural Properties," Papers 2203.16816, arXiv.org, revised Feb 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. Kotowski, Maciej H., 2020. "First-price auctions with budget constraints," Theoretical Economics, Econometric Society, vol. 15(1), January.
    2. Santiago R. Balseiro & Ozan Candogan, 2017. "Optimal Contracts for Intermediaries in Online Advertising," Operations Research, INFORMS, vol. 65(4), pages 878-896, August.
    3. Savas Dayanik & Semih O. Sezer, 2023. "Optimal dynamic multi-keyword bidding policy of an advertiser in search-based advertising," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 97(1), pages 25-56, February.
    4. 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.
    5. Burkett, Justin, 2016. "Optimally constraining a bidder using a simple budget," Theoretical Economics, Econometric Society, vol. 11(1), January.
    6. Hana Choi & Carl F. Mela & Santiago R. Balseiro & Adam Leary, 2020. "Online Display Advertising Markets: A Literature Review and Future Directions," Information Systems Research, INFORMS, vol. 31(2), pages 556-575, June.
    7. 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.
    8. Dragos Florin Ciocan & Krishnamurthy Iyer, 2021. "Tractable Equilibria in Sponsored Search with Endogenous Budgets," Operations Research, INFORMS, vol. 69(1), pages 227-244, January.
    9. Zhaohua Chen & Chang Wang & Qian Wang & Yuqi Pan & Zhuming Shi & Zheng Cai & Yukun Ren & Zhihua Zhu & Xiaotie Deng, 2022. "Dynamic Budget Throttling in Repeated Second-Price Auctions," Papers 2207.04690, arXiv.org, revised Dec 2023.
    10. Kotowski, Maciej H. & Li, Fei, 2014. "On the continuous equilibria of affiliated-value, all-pay auctions with private budget constraints," Games and Economic Behavior, Elsevier, vol. 85(C), pages 84-108.
    11. 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.
    12. Carbajal, Juan Carlos & Mu'alem, Ahuva, 2020. "Selling mechanisms for a financially constrained buyer," Games and Economic Behavior, Elsevier, vol. 124(C), pages 386-405.
    13. Veronica Marotta & Yue Wu & Kaifu Zhang & Alessandro Acquisti, 2022. "The Welfare Impact of Targeted Advertising Technologies," Information Systems Research, INFORMS, vol. 33(1), pages 131-151, March.
    14. Brett, Craig & Weymark, John A., 2016. "Voting over selfishly optimal nonlinear income tax schedules with a minimum-utility constraint," Journal of Mathematical Economics, Elsevier, vol. 67(C), pages 18-31.
    15. Light, Bar & Weintraub, Gabriel, 2018. "Mean Field Equilibrium: Uniqueness, Existence, and Comparative Statics," Research Papers 3731, Stanford University, Graduate School of Business.
    16. Gonzalez, Stéphane & Rostom, Fatma Zahra, 2022. "Sharing the global outcomes of finite natural resource exploitation: A dynamic coalitional stability perspective," Mathematical Social Sciences, Elsevier, vol. 119(C), pages 1-10.
    17. Bobkova, Nina, 2020. "Asymmetric budget constraints in a first-price auction," Journal of Economic Theory, Elsevier, vol. 186(C).
    18. Vits, Jeroen & Gelders, Ludo & Pintelon, Liliane, 2006. "Production process changes: A dynamic programming approach to manage effective capacity and experience," International Journal of Production Economics, Elsevier, vol. 104(2), pages 473-481, December.
    19. Rasch, Alexander & Wambach, Achim, 2009. "Internal decision-making rules and collusion," Journal of Economic Behavior & Organization, Elsevier, vol. 72(2), pages 703-715, November.
    20. Sawada, Hiroyuki & Yan, Xiu-Tian, 2004. "Application of Gröbner bases and quantifier elimination for insightful engineering design," Mathematics and Computers in Simulation (MATCOM), Elsevier, vol. 67(1), pages 135-148.

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