research-article

Open access

Online Bidding Algorithms for Return-on-Spend Constrained Advertisers✱

Authors:

Swati Padmanabhan,

Di WangAuthors Info & Claims

WWW '23: Proceedings of the ACM Web Conference 2023

Pages 3550 - 3560

https://doi.org/10.1145/3543507.3583491

Published: 30 April 2023 Publication History

All formats PDF

Abstract

We study online auto-bidding algorithms for a single advertiser maximizing value under the Return-on-Spend (RoS) constraint, quantifying performance in terms of regret relative to the optimal offline solution that knows all queries a priori. We contribute a simple online algorithm that achieves near-optimal regret in expectation while always respecting the RoS constraint when the input queries are i.i.d. samples from some distribution. Integrating our results with [9] achieves near-optimal regret under both RoS and fixed budget constraints. Our algorithm uses the primal-dual framework with online mirror descent (OMD) for the dual updates, and the analysis utilizes new insights into the gradient structure.

Supplemental Material

PDF File

Appendix

Download
452.56 KB

References

[1]

Gagan Aggarwal, Ashwinkumar Badanidiyuru, and Aranyak Mehta. 2019. Autobidding with constraints. In International Conference on Web and Internet Economics. Springer, 17–30.

[2]

Shipra Agrawal and Nikhil R Devanur. 2014. Fast algorithms for online stochastic convex programming. In Proceedings of the twenty-sixth annual ACM-SIAM symposium on Discrete algorithms. SIAM, 1405–1424.

[3]

Rui Ai, Chang Wang, Chenchen Li, Jinshan Zhang, Wenhan Huang, and Xiaotie Deng. 2022. No-regret Learning in Repeated First-Price Auctions with Budget Constraints.

[4]

Zeyuan Allen-Zhu and Lorenzo Orecchia. 2014. Using optimization to break the epsilon barrier: A faster and simpler width-independent algorithm for solving positive linear programs in parallel. In Proceedings of the twenty-sixth annual ACM-SIAM symposium on Discrete algorithms. SIAM, 1439–1456.

[5]

Moshe Babaioff, Richard Cole, Jason Hartline, Nicole Immorlica, and Brendan Lucier. 2021. Non-Quasi-Linear Agents in Quasi-Linear Mechanisms. In 12th Innovations in Theoretical Computer Science Conference (ITCS 2021). Schloss Dagstuhl-Leibniz-Zentrum für Informatik.

[6]

Ashwinkumar Badanidiyuru, Zhe Feng, and Guru Guruganesh. 2021. Learning to Bid in Contextual First Price Auctions. CoRR abs/2109.03173 (2021). arXiv:2109.03173

[7]

Ashwinkumar Badanidiyuru, Robert Kleinberg, and Aleksandrs Slivkins. 2018. Bandits with knapsacks. Journal of the ACM (JACM) 65, 3 (2018), 1–55.

[8]

Santiago Balseiro, Yuan Deng, Jieming Mao, Vahab Mirrokni, and Song Zuo. 2021. Robust Auction Design in the Auto-bidding World. Advances in Neural Information Processing Systems 34 (2021), 17777–17788.

[9]

Santiago Balseiro, Haihao Lu, and Vahab Mirrokni. 2020. Dual Mirror Descent for Online Allocation Problems. In Proceedings of the 37th International Conference on Machine Learning(Proceedings of Machine Learning Research, Vol. 119), Hal Daumé III and Aarti Singh (Eds.). PMLR, 613–628.

[10]

Santiago R Balseiro, Yuan Deng, Jieming Mao, Vahab S Mirrokni, and Song Zuo. 2021. The landscape of auto-bidding auctions: Value versus utility maximization. In Proceedings of the 22nd ACM Conference on Economics and Computation. 132–133.

[11]

Santiago R Balseiro and Yonatan Gur. 2019. Learning in repeated auctions with budgets: Regret minimization and equilibrium. Management Science 65, 9 (2019), 3952–3968.

[12]

Christian Borgs, Jennifer Chayes, Nicole Immorlica, Kamal Jain, Omid Etesami, and Mohammad Mahdian. 2007. Dynamics of bid optimization in online advertisement auctions. In Proceedings of the 16th international conference on World Wide Web. 531–540.

[13]

Matteo Castiglioni, Andrea Celli, Alberto Marchesi, Giulia Romano, and Nicola Gatti. 2022. A Unifying Framework for Online Optimization with Long-Term Constraints. arXiv preprint arXiv:2209.07454 (2022).

[14]

Andrea Celli, Riccardo Colini-Baldeschi, Christian Kroer, and Eric Sodomka. 2022. The Parity Ray Regularizer for Pacing in Auction Markets. In Proceedings of the ACM Web Conference 2022 (Virtual Event, Lyon, France) (WWW ’22). Association for Computing Machinery, New York, NY, USA, 162–172.

[15]

Vincent Conitzer, Christian Kroer, Debmalya Panigrahi, Okke Schrijvers, Nicolas E Stier-Moses, Eric Sodomka, and Christopher A Wilkens. 2022. Pacing Equilibrium in First Price Auction Markets. Management Science (2022).

[16]

Vincent Conitzer, Christian Kroer, Eric Sodomka, and Nicolas E Stier-Moses. 2022. Multiplicative pacing equilibria in auction markets. Operations Research 70, 2 (2022), 963–989.

[17]

Yuan Deng, Jieming Mao, Vahab Mirrokni, and Song Zuo. 2021. Towards efficient auctions in an auto-bidding world. In Proceedings of the Web Conference 2021. 3965–3973.

[18]

Nikhil R Devanur and Thomas P Hayes. 2009. The adwords problem: online keyword matching with budgeted bidders under random permutations. In Proceedings of the 10th ACM conference on Electronic commerce. 71–78.

[19]

Nikhil R. Devanur, Kamal Jain, Balasubramanian Sivan, and Christopher A. Wilkens. 2019. Near Optimal Online Algorithms and Fast Approximation Algorithms for Resource Allocation Problems. J. ACM 66, 1 (2019). https://doi.org/10.1145/3284177

[20]

Zhe Feng, Chara Podimata, and Vasilis Syrgkanis. 2018. Learning to Bid Without Knowing Your Value. In Proceedings of the 2018 ACM Conference on Economics and Computation. 505–522.

[21]

Yuan Gao, Kaiyu Yang, Yuanlong Chen, Min Liu, and Noureddine El Karoui. 2022. Bidding Agent Design in the LinkedIn Ad Marketplace. arXiv preprint arXiv:2202.12472 (2022).

[22]

Negin Golrezaei, Patrick Jaillet, Jason Cheuk Nam Liang, and Vahab Mirrokni. 2021. Bidding and Pricing in Budget and ROI Constrained Markets. arXiv preprint arXiv:2107.07725 (2021).

[23]

Yanjun Han, Zhengyuan Zhou, Aaron Flores, Erik Ordentlich, and Tsachy Weissman. 2020. Learning to Bid Optimally and Efficiently in Adversarial First-price Auctions. CoRR abs/2007.04568 (2020). arxiv:2007.04568

[24]

Nicole Immorlica, Karthik Abinav Sankararaman, Robert Schapire, and Aleksandrs Slivkins. 2019. Adversarial bandits with knapsacks. In 2019 IEEE 60th Annual Symposium on Foundations of Computer Science (FOCS). IEEE, 202–219.

[25]

Mehrdad Mahdavi, Rong Jin, and Tianbao Yang. 2012. Trading regret for efficiency: online convex optimization with long term constraints. The Journal of Machine Learning Research 13, 1 (2012), 2503–2528.

[26]

Mehrdad Mahdavi, Tianbao Yang, and Rong Jin. 2013. Stochastic convex optimization with multiple objectives. Advances in neural information processing systems 26 (2013).

[27]

Shie Mannor, John N Tsitsiklis, and Jia Yuan Yu. 2009. Online Learning with Sample Path Constraints.Journal of Machine Learning Research 10, 3 (2009).

[28]

Aranyak Mehta, Amin Saberi, Umesh Vazirani, and Vijay Vazirani. 2007. Adwords and generalized online matching. Journal of the ACM (JACM) 54, 5 (2007), 22–es.

[29]

Roger B Myerson. 1981. Optimal auction design. Mathematics of operations research 6, 1 (1981), 58–73.

[30]

Thomas Nedelec, Clément Calauzènes, Noureddine El Karoui, and Vianney Perchet. 2022. Learning in Repeated Auctions. Foundations and Trends® in Machine Learning 15, 3 (2022), 176–334. https://doi.org/10.1561/2200000077

[31]

Gali Noti and Vasilis Syrgkanis. 2021. Bid Prediction in Repeated Auctions with Learning. In Proceedings of the Web Conference 2021 (Ljubljana, Slovenia) (WWW ’21). Association for Computing Machinery, New York, NY, USA, 3953–3964.

[32]

Jonathan Weed, Vianney Perchet, and Philippe Rigollet. 2016. Online learning in repeated auctions. In Conference on Learning Theory. PMLR, 1562–1583.

[33]

Hao Yu, Michael Neely, and Xiaohan Wei. 2017. Online convex optimization with stochastic constraints. Advances in Neural Information Processing Systems 30 (2017).

[34]

Hao Yu and Michael J Neely. 2020. A Low Complexity Algorithm with Regret and O(1) Constraint Violations for Online Convex Optimization with Long Term Constraints. Journal of Machine Learning Research 21, 1 (2020), 1–24.

Cited By

Wei CZelditch BChen JRibeiro ATay JElizondo BSelvaraj SGupta AAlmeida LBaeza-Yates RBonchi F(2024)Neural Optimization with Adaptive Heuristics for Intelligent Marketing SystemProceedings of the 30th ACM SIGKDD Conference on Knowledge Discovery and Data Mining10.1145/3637528.3671591(5938-5949)Online publication date: 25-Aug-2024
https://dl.acm.org/doi/10.1145/3637528.3671591
Jee DJin SYoo JAhn BBaeza-Yates RBonchi F(2024)Learning to Bid the Interest Rate in Online Unsecured Personal LoansProceedings of the 30th ACM SIGKDD Conference on Knowledge Discovery and Data Mining10.1145/3637528.3671584(5150-5160)Online publication date: 25-Aug-2024
https://dl.acm.org/doi/10.1145/3637528.3671584
Korenkevych DCheng FBalakir ANikulkov AGao LCen ZXu ZZhu ZBaeza-Yates RBonchi F(2024)Offline Reinforcement Learning for Optimizing Production Bidding PoliciesProceedings of the 30th ACM SIGKDD Conference on Knowledge Discovery and Data Mining10.1145/3637528.3671555(5251-5259)Online publication date: 25-Aug-2024
https://dl.acm.org/doi/10.1145/3637528.3671555
Show More Cited By

Index Terms

Online Bidding Algorithms for Return-on-Spend Constrained Advertisers✱
1. Information systems
  1. World Wide Web
    1. Online advertising
      1. Sponsored search advertising
2. Theory of computation
  1. Theory and algorithms for application domains
    1. Algorithmic game theory and mechanism design
      1. Computational advertising theory
    2. Machine learning theory
      1. Online learning theory

Recommendations

A Study of the Partnership Between Advertisers and Publishers
Passive and Active Measurement
Abstract
Ad networks (e.g., Google Ads and Facebook Ads), advertisers, publishers (websites and mobile apps), and users are the main participants in the online advertising ecosystem. Ad networks dominate the advertising landscape in terms of determining ...
Online Advertising: Experimental Facts on Ethics, Involvement, and Product Type

The purpose of this chapter is to provide some insights into advertisements on the Iranian websites. Firstly, in publisher side, is the ethic a matter of fact in accepting Internet advertisements to publish? Second, to provide a preliminary insight into ...
Is Combining Contextual and Behavioral Targeting Strategies Effective in Online Advertising?

Online targeting has been increasingly used to deliver ads to consumers. But discovering how to target the most valuable web visitors and generate a high response rate is still a challenge for advertising intermediaries and advertisers. The purpose of ...

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences

WWW '23: Proceedings of the ACM Web Conference 2023

April 2023

4293 pages

ISBN:9781450394161

DOI:10.1145/3543507

Copyright © 2023 Owner/Author.

This work is licensed under a Creative Commons Attribution International 4.0 License.

Sponsors

SIGWEB: ACM Special Interest Group on Hypertext, Hypermedia, and Web

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 30 April 2023

Check for updates

Author Tags

Qualifiers

Research-article
Research
Refereed limited

Data Availability

Appendix https://dl.acm.org/doi/10.1145/3543507.3583491#supp.pdf

Conference

WWW '23

Sponsor:

SIGWEB

WWW '23: The ACM Web Conference 2023

April 30 - May 4, 2023

TX, Austin, USA

Acceptance Rates

Overall Acceptance Rate 1,899 of 8,196 submissions, 23%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

6
Total Citations
View Citations
711
Total Downloads

Downloads (Last 12 months)455
Downloads (Last 6 weeks)74

Reflects downloads up to 09 Nov 2024

Other Metrics

View Author Metrics

Citations

Cited By

Wei CZelditch BChen JRibeiro ATay JElizondo BSelvaraj SGupta AAlmeida LBaeza-Yates RBonchi F(2024)Neural Optimization with Adaptive Heuristics for Intelligent Marketing SystemProceedings of the 30th ACM SIGKDD Conference on Knowledge Discovery and Data Mining10.1145/3637528.3671591(5938-5949)Online publication date: 25-Aug-2024
https://dl.acm.org/doi/10.1145/3637528.3671591
Jee DJin SYoo JAhn BBaeza-Yates RBonchi F(2024)Learning to Bid the Interest Rate in Online Unsecured Personal LoansProceedings of the 30th ACM SIGKDD Conference on Knowledge Discovery and Data Mining10.1145/3637528.3671584(5150-5160)Online publication date: 25-Aug-2024
https://dl.acm.org/doi/10.1145/3637528.3671584
Korenkevych DCheng FBalakir ANikulkov AGao LCen ZXu ZZhu ZBaeza-Yates RBonchi F(2024)Offline Reinforcement Learning for Optimizing Production Bidding PoliciesProceedings of the 30th ACM SIGKDD Conference on Knowledge Discovery and Data Mining10.1145/3637528.3671555(5251-5259)Online publication date: 25-Aug-2024
https://dl.acm.org/doi/10.1145/3637528.3671555
Deng YMao JMirrokni VTeng YZuo SChua TNgo CKa-Wei Lee RKumar RLauw H(2024)Non-uniform Bid-scaling and Equilibria for Different Auctions: An Empirical StudyProceedings of the ACM Web Conference 202410.1145/3589334.3645659(256-266)Online publication date: 13-May-2024
https://dl.acm.org/doi/10.1145/3589334.3645659
Liaw CMehta AZhu WChua TNgo CKa-Wei Lee RKumar RLauw H(2024)Efficiency of Non-Truthful Auctions in Auto-bidding with Budget ConstraintsProceedings of the ACM Web Conference 202410.1145/3589334.3645636(223-234)Online publication date: 13-May-2024
https://dl.acm.org/doi/10.1145/3589334.3645636
Chen YWang QDuan ZSun HChen ZYan XDeng XKrause ABrunskill ECho KEngelhardt BSabato SScarlett J(2023)Coordinated dynamic bidding in repeated second-price auctions with budgetsProceedings of the 40th International Conference on Machine Learning10.5555/3618408.3618607(5052-5086)Online publication date: 23-Jul-2023
https://dl.acm.org/doi/10.5555/3618408.3618607

View Options

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

HTML Format

View this article in HTML Format.

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

Media

Figures

Other

Tables

View Table of Contents