Multi-Platform Autobidding with and without Predictions
We study the problem of finding the optimal bidding strategy for an advertiser in a multi-platform auction setting. The competition on a platform is captured by a value and a cost function, mapping bidding strategies to value and cost respectively. We assume a diminishing returns property, whereby the marginal cost is increasing in value. The advertiser uses an autobidder that selects a bidding strategy for each platform, aiming to maximize total value subject to budget and return-on-spend constraint. The advertiser has no prior information and learns about the value and cost functions by querying a platform with a specific bidding strategy. Our goal is to design algorithms that find the optimal bidding strategy with a small number of queries.
Authors
- Mingfei Zhao (ORCID: https://orcid.org/0000-0002-8008-0922)
- Xizhi Tan (ORCID: https://orcid.org/0000-0002-3928-523X)
- Gagan Aggarwal (ORCID: https://orcid.org/0009-0003-3296-4891)
- Anupam Gupta (ORCID: https://orcid.org/0000-0001-5579-3405)
Institutions
- Google (United States) (US)
- New York University (US)
- Drexel University (US)
Publication Details
- Published
- 2025-04-22
- DOI
- https://doi.org/10.1145/3696410.3714936
- Primary Topic
- Auction Theory and Applications
- Type
- article
- Field-Weighted Citation Impact
- 0.00