IDEAS home Printed from https://ideas.repec.org/a/inm/oropre/v69y2021i3p859-876.html
   My bibliography  Save this article

Budget-Management Strategies in Repeated Auctions

Author

Listed:
  • Santiago Balseiro

    (Columbia University, New York, New York 10027)

  • Anthony Kim

    (Amazon, New York, New York, 10001)

  • Mohammad Mahdian

    (Google Research, New York, New York 10011)

  • Vahab Mirrokni

    (Google Research, New York, New York 10011)

Abstract

In online advertising, advertisers purchase ad placements by participating in a long sequence of repeated auctions. One of the most important features that advertising platforms often provide and advertisers often use is budget management, which allows advertisers to control their cumulative expenditures. Advertisers typically declare the maximum daily amount they are willing to pay, and the platform adjusts allocations and payments to guarantee that cumulative expenditures do not exceed budgets. There are multiple ways to achieve this goal, and each one, when applied to all budget-constrained advertisers simultaneously, drives the system toward a different equilibrium. Our goal is to compare the “system equilibria” of a range of budget-management strategies. In particular, we consider six different budget-management strategies, including probabilistic throttling, thresholding, bid shading, reserve pricing, and two versions of multiplicative boosting. We show that these methods admit a system equilibrium, study their incentive properties, prove dominance relations among them in a simplified setting, and confirm our theoretical findings using real ad auction data from a sponsored search. Our study sheds light on the impact of budget-management strategies on the trade-off between the seller’s profit and buyers’ utility and may be of practical relevance for advertising platforms.

Suggested Citation

  • 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.
  • Handle: RePEc:inm:oropre:v:69:y:2021:i:3:p:859-876
    DOI: 10.1287/opre.2020.2073
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/opre.2020.2073
    Download Restriction: no

    File URL: https://libkey.io/10.1287/opre.2020.2073?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    References listed on IDEAS

    as
    1. Guillermo Gallego & Garrett van Ryzin, 1994. "Optimal Dynamic Pricing of Inventories with Stochastic Demand over Finite Horizons," Management Science, INFORMS, vol. 40(8), pages 999-1020, August.
    2. Nick Arnosti & Marissa Beck & Paul Milgrom, 2016. "Adverse Selection and Auction Design for Internet Display Advertising," American Economic Review, American Economic Association, vol. 106(10), pages 2852-2866, October.
    3. 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.
    4. 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.
    5. Martin A. Lariviere, 2006. "A Note on Probability Distributions with Increasing Generalized Failure Rates," Operations Research, INFORMS, vol. 54(3), pages 602-604, June.
    6. Dragos Florin Ciocan & Krishnamurthy Iyer, 2021. "Tractable Equilibria in Sponsored Search with Endogenous Budgets," Operations Research, INFORMS, vol. 69(1), pages 227-244, January.
    7. 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.
    8. Roger B. Myerson, 1981. "Optimal Auction Design," Mathematics of Operations Research, INFORMS, vol. 6(1), pages 58-73, February.
    9. Pai, Mallesh M. & Vohra, Rakesh, 2014. "Optimal auctions with financially constrained buyers," Journal of Economic Theory, Elsevier, vol. 150(C), pages 383-425.
    10. 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.
    11. Cremer, Jacques & McLean, Richard P, 1988. "Full Extraction of the Surplus in Bayesian and Dominant Strategy Auctions," Econometrica, Econometric Society, vol. 56(6), pages 1247-1257, November.
    12. Laffont, Jean-Jacques & Robert, Jacques, 1996. "Optimal auction with financially constrained buyers," Economics Letters, Elsevier, vol. 52(2), pages 181-186, August.
    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. Benedikt Bünz & Benjamin Lubin & Sven Seuken, 2022. "Designing Core-Selecting Payment Rules: A Computational Search Approach," Information Systems Research, INFORMS, vol. 33(4), pages 1157-1173, December.
    2. Vincent Conitzer & Christian Kroer & Debmalya Panigrahi & Okke Schrijvers & Nicolas E. Stier-Moses & Eric Sodomka & Christopher A. Wilkens, 2022. "Pacing Equilibrium in First Price Auction Markets," Management Science, INFORMS, vol. 68(12), pages 8515-8535, December.
    3. Luofeng Liao & Christian Kroer & Sergei Leonenkov & Okke Schrijvers & Liang Shi & Nicolas Stier-Moses & Congshan Zhang, 2024. "Interference Among First-Price Pacing Equilibria: A Bias and Variance Analysis," Papers 2402.07322, 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. 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.
    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. 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.
    4. Baisa, Brian, 2017. "Auction design without quasilinear preferences," Theoretical Economics, Econometric Society, vol. 12(1), January.
    5. 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.
    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. Burkett, Justin, 2016. "Optimally constraining a bidder using a simple budget," Theoretical Economics, Econometric Society, vol. 11(1), January.
    8. 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.
    9. Kotowski, Maciej H., 2020. "First-price auctions with budget constraints," Theoretical Economics, Econometric Society, vol. 15(1), January.
    10. 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.
    11. Aranyak Mehta & Andres Perlroth, 2023. "Auctions without commitment in the auto-bidding world," Papers 2301.07312, arXiv.org, revised Mar 2023.
    12. Richter, Michael, 2019. "Mechanism design with budget constraints and a population of agents," Games and Economic Behavior, Elsevier, vol. 115(C), pages 30-47.
    13. 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.
    14. Baisa, Brian & Rabinovich, Stanislav, 2016. "Optimal auctions with endogenous budgets," Economics Letters, Elsevier, vol. 141(C), pages 162-165.
    15. Ilan Lobel, 2021. "Revenue Management and the Rise of the Algorithmic Economy," Management Science, INFORMS, vol. 67(9), pages 5389-5398, September.
    16. Debasis Mishra & Kolagani Paramahamsa, 2022. "Selling to a principal and a budget-constrained agent," Papers 2202.10378, arXiv.org, revised Jul 2022.
    17. Boulatov, Alexei & Severinov, Sergei, 2021. "Optimal and efficient mechanisms with asymmetrically budget constrained buyers," Games and Economic Behavior, Elsevier, vol. 127(C), pages 155-178.
    18. Hummel, Patrick, 2017. "Endogenous budget constraints," Mathematical Social Sciences, Elsevier, vol. 88(C), pages 11-15.
    19. Le, Phuong, 2018. "Pareto optimal budgeted combinatorial auctions," Theoretical Economics, Econometric Society, vol. 13(2), May.
    20. Santiago R. Balseiro & Ozan Candogan & Huseyin Gurkan, 2021. "Multistage Intermediation in Display Advertising," Manufacturing & Service Operations Management, INFORMS, vol. 23(3), pages 714-730, May.

    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:inm:oropre:v:69:y:2021:i:3:p:859-876. 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: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.html .

    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.