Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
skip to main content
10.1145/3589334.3645344acmconferencesArticle/Chapter ViewAbstractPublication PageswebconfConference Proceedingsconference-collections
research-article

Budget-Constrained Auctions with Unassured Priors: Strategic Equivalence and Structural Properties

Published: 13 May 2024 Publication History

Abstract

In today's online advertising markets, it is common for advertisers to set long-term budgets. Correspondingly, advertising platforms adopt budget control methods to ensure that advertisers' payments lie within their budgets. Most budget control methods rely on the value distributions of advertisers. However, due to the complex advertising landscape and potential privacy concerns, the platform hardly learns advertisers' true priors. Thus, it is crucial to understand how budget control auction mechanisms perform under unassured priors.
This work answers this problem from multiple aspects. Specifically, we examine five budget-constrained parameterized mechanisms: bid-discount/pacing first-price/second-price auctions and the Bayesian revenue-optimal auction. We consider the unassured prior game among the seller and all buyers induced by these five mechanisms in the stochastic model. We restrict the parameterized mechanisms to satisfy the budget-extracting condition, which maximizes the seller's revenue by extracting buyers' budgets as effectively as possible. Our main result shows that the Bayesian revenue-optimal mechanism and the budget-extracting bid-discount first-price mechanism yield the same set of Nash equilibrium outcomes in the unassured prior game. This implies that simple mechanisms can be as robust as the optimal mechanism under unassured priors in the budget-constrained setting. In the symmetric case, we further show that all these five (budget-extracting) mechanisms share the same set of possible outcomes. We further dig into the structural properties of these mechanisms. We characterize sufficient and necessary conditions on the budget-extracting parameter tuple for bid-discount/pacing first-price auctions. Meanwhile, when buyers do not take strategic behaviors, we exploit the dominance relationships of these mechanisms by revealing their intrinsic structures. In summary, our results establish vast connections among budget-constrained auctions with unassured priors and explore their structural properties, particularly highlighting the advantages of first-price mechanisms.

Supplemental Material

MOV File
Supplemental video
MP4 File
presentation video

References

[1]
Gagan Aggarwal, Ashish Goel, and Rajeev Motwani. 2006. Truthful auctions for pricing search keywords. In Proceedings of the 7th ACM Conference on Electronic Commerce. 1--7.
[2]
Gagan Aggarwal, Andres Perlroth, and Junyao Zhao. 2023. Multi-Channel Auction Design in the Autobidding World. arXiv preprint arXiv:2301.13410 (2023).
[3]
Santiago Balseiro, Anthony Kim, Mohammad Mahdian, and Vahab Mirrokni. 2017. Budget management strategies in repeated auctions. In Proceedings of the 26th International Conference on World Wide Web. 15--23.
[4]
Santiago Balseiro, Christian Kroer, and Rachitesh Kumar. 2023 a. Contextual standard auctions with budgets: Revenue equivalence and efficiency guarantees. Management Science (2023).
[5]
Santiago R Balseiro, Omar Besbes, and Gabriel Y Weintraub. 2015. Repeated auctions with budgets in ad exchanges: Approximations and design. Management Science, Vol. 61, 4 (2015), 864--884.
[6]
Santiago R Balseiro, Yuan Deng, Jieming Mao, Vahab Mirrokni, and Song Zuo. 2022a. Optimal Mechanisms for Value Maximizers with Budget Constraints via Target Clipping. In Proceedings of the 23rd ACM Conference on Economics and Computation. 475--475.
[7]
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.
[8]
Santiago R Balseiro and Yonatan Gur. 2019. Learning in repeated auctions with budgets: Regret minimization and equilibrium. Management Science, Vol. 65, 9 (2019), 3952--3968.
[9]
Santiago R Balseiro, Haihao Lu, and Vahab Mirrokni. 2023 b. The best of many worlds: Dual mirror descent for online allocation problems. Operations Research, Vol. 71, 1 (2023), 101--119.
[10]
Santiago R Balseiro, Haihao Lu, Vahab Mirrokni, and Balasubramanian Sivan. 2022b. Analysis of Dual-Based PID Controllers through Convolutional Mirror Descent. arXiv preprint arXiv:2202.06152 (2022).
[11]
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. 162--172.
[12]
Yeon-Koo Che and Ian Gale. 1998. Standard auctions with financially constrained bidders. The Review of Economic Studies, Vol. 65, 1 (1998), 1--21.
[13]
Yeon-Koo Che and Ian Gale. 2000. The optimal mechanism for selling to a budget-constrained buyer. Journal of Economic theory, Vol. 92, 2 (2000), 198--233.
[14]
Xi Chen, Christian Kroer, and Rachitesh Kumar. 2021a. The Complexity of Pacing for Second-Price Auctions. In Proceedings of the 22nd ACM Conference on Economics and Computation. 318--318.
[15]
Xi Chen, Christian Kroer, and Rachitesh Kumar. 2021b. Throttling equilibria in auction markets. arXiv preprint arXiv:2107.10923 (2021).
[16]
Zhaohua Chen, Xiaotie Deng, Jicheng Li, Chang Wang, Mingwei Yang, Zheng Cai, Yukun Ren, and Zhihua Zhu. 2022. Budget-Constrained Auctions with Unassured Priors: Strategic Equivalence and Structural Properties. arXiv preprint arXiv:2203.16816 (2022).
[17]
Vincent Conitzer, Christian Kroer, Debmalya Panigrahi, Okke Schrijvers, Nicolas E Stier-Moses, Eric Sodomka, and Christopher A Wilkens. 2022a. Pacing Equilibrium in First Price Auction Markets. Management Science (2022).
[18]
Vincent Conitzer, Christian Kroer, Eric Sodomka, and Nicolas E Stier-Moses. 2022b. Multiplicative pacing equilibria in auction markets. Operations Research, Vol. 70, 2 (2022), 963--989.
[19]
Xiaotie Deng, Tao Lin, and Tao Xiao. 2020. Private data manipulation in optimal sponsored search auction. In Proceedings of The Web Conference 2020. 2676--2682.
[20]
Xiaotie Deng, Tao Xiao, and Keyu Zhu. 2017. Learn to play maximum revenue auction. IEEE Transactions on Cloud Computing, Vol. 7, 4 (2017), 1057--1067.
[21]
Xiaotie Deng and Keyu Zhu. 2019. On Bayesian epistemology of Myerson auction. IEEE Transactions on Cloud Computing, Vol. 9, 3 (2019), 1172--1179.
[22]
Yuan Deng, Negin Golrezaei, Patrick Jaillet, Jason Cheuk Nam Liang, and Vahab Mirrokni. 2023. Multi-channel autobidding with budget and ROI constraints. arXiv preprint arXiv:2302.01523 (2023).
[23]
Yuan Deng, Vahab Mirrokni, and Song Zuo. 2021. Non-Clairvoyant Dynamic Mechanism Design with Budget Constraints and Beyond. In Proceedings of the 22nd ACM Conference on Economics and Computation. 369--369.
[24]
Juan Feng, Hemant K Bhargava, and David M Pennock. 2007. Implementing sponsored search in web search engines: Computational evaluation of alternative mechanisms. INFORMS Journal on Computing, Vol. 19, 1 (2007), 137--148.
[25]
Yiding Feng and Jason D Hartline. 2018. An end-to-end argument in mechanism design (prior-independent auctions for budgeted agents). In 2018 IEEE 59th Annual Symposium on Foundations of Computer Science (FOCS). IEEE, 404--415.
[26]
Yiding Feng, Brendan Lucier, and Aleksandrs Slivkins. 2023. Strategic Budget Selection in a Competitive Autobidding World. arXiv preprint arXiv:2307.07374 (2023).
[27]
Zhe Feng, Guru Guruganesh, Christopher Liaw, Aranyak Mehta, and Abhishek Sethi. 2021. Convergence analysis of no-regret bidding algorithms in repeated auctions. In Proceedings of the AAAI Conference on Artificial Intelligence, Vol. 35. 5399--5406.
[28]
Jason Gaitonde, Yingkai Li, Bar Light, Brendan Lucier, and Aleksandrs Slivkins. 2023. Budget Pacing in Repeated Auctions: Regret and Efficiency Without Convergence. In 14th Innovations in Theoretical Computer Science Conference (ITCS 2023), Vol. 251. 52.
[29]
Negin Golrezaei, Patrick Jaillet, Jason Cheuk Nam Liang, and Vahab Mirrokni. 2021a. Bidding and pricing in budget and ROI constrained markets. arXiv preprint arXiv:2107.07725 (2021).
[30]
Negin Golrezaei, Max Lin, Vahab Mirrokni, and Hamid Nazerzadeh. 2021b. Boosted Second Price Auctions: Revenue Optimization for Heterogeneous Bidders. In Proceedings of the 27th ACM SIGKDD Conference on Knowledge Discovery & Data Mining. 447--457.
[31]
Google Ad Manager. 2019. An update on first price auctions for Google Ad Manager. https://www.blog.google/products/admanager/update-first-price-auctions-google-ad-manager/. 2019-05--10.
[32]
Google Ad Manager. 2023. Average daily budget: Definition. https://support.google.com/google-ads/answer/6312?hl=en. Accessed: 2023-09--26.
[33]
Google LLC. 2023. Google Ads - Official Site - Expand Your Business Globally. https://ads.google.com/home/. Accessed: 2023-09--26.
[34]
Ramki Gummadi, Peter Key, and Alexandre Proutiere. 2013. Optimal bidding strategies and equilibria in dynamic auctions with budget constraints. Available at SSRN 2066175 (2013).
[35]
Yoav Kolumbus and Noam Nisan. 2022. Auctions between regret-minimizing agents. In Proceedings of the ACM Web Conference 2022. 100--111.
[36]
Sébastien Lahaie and David M Pennock. 2007. Revenue analysis of a family of ranking rules for keyword auctions. In Proceedings of the 8th ACM Conference on Electronic Commerce. 50--56.
[37]
Meta Ads. 2023. Your customers are here. Find them with Meta ads. https://www.facebook.com/business/ads. Accessed: 2023-09--26.
[38]
Roger B Myerson. 1981. Optimal auction design. Mathematics of operations research, Vol. 6, 1 (1981), 58--73.
[39]
Thomas Nedelec, Noureddine El Karoui, and Vianney Perchet. 2019. Learning to bid in revenue-maximizing auctions. In International Conference on Machine Learning. PMLR, 4781--4789.
[40]
Mallesh M Pai and Rakesh Vohra. 2014. Optimal auctions with financially constrained buyers. Journal of Economic Theory, Vol. 150 (2014), 383--425.
[41]
Statista. 2023. Digital advertising spending worldwide from 2021 to 2026. https://www.statista.com/statistics/237974/online-advertising-spending-worldwide/. Accessed: 2023-06--26.
[42]
Pingzhong Tang and Yulong Zeng. 2018. The price of prior dependence in auctions. In Proceedings of the 2018 ACM Conference on Economics and Computation. 485--502.

Recommendations

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences
WWW '24: Proceedings of the ACM Web Conference 2024
May 2024
4826 pages
ISBN:9798400701719
DOI:10.1145/3589334
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than the author(s) must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected].

Sponsors

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 13 May 2024

Permissions

Request permissions for this article.

Check for updates

Author Tags

  1. budget-constrained auctions
  2. strategic equivalence
  3. structural properties
  4. unassured priors

Qualifiers

  • Research-article

Funding Sources

  • Tencent Marketing Solution

Conference

WWW '24
Sponsor:
WWW '24: The ACM Web Conference 2024
May 13 - 17, 2024
Singapore, Singapore

Acceptance Rates

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

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • 0
    Total Citations
  • 44
    Total Downloads
  • Downloads (Last 12 months)44
  • Downloads (Last 6 weeks)9
Reflects downloads up to 18 Aug 2024

Other Metrics

Citations

View Options

Get Access

Login options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Media

Figures

Other

Tables

Share

Share

Share this Publication link

Share on social media