Abstract
We analyze the problem of how to optimally bid for ad spaces in online ad auctions. For this we consider the general case of multiple ad campaigns with overlapping targeting criteria. In our analysis we first characterize the structure of an optimal bidding strategy. In particular, we show that an optimal bidding strategies decomposes the problem into disjoint sets of campaigns and targeting groups. In addition, we show that pure bidding strategies that use only a single bid value for each campaign are not optimal when the supply curves are not continuous. For this case, we derive a lower-bound on the optimal cost of any bidding strategy, as well as mixed bidding strategies that either achieve the lower-bound or can get arbitrarily close to it.
- Santiago R. Balseiro, Jon Feldman, Vahab Mirrokni, and S. Muthukrishnan. 2014. Yield Optimization of Display Advertising with Ad Exchange. Management Science , Vol. 60, 12 (2014), 2886--2907.Google Scholar
Digital Library
- Ying Cui, Ruofei Zhang, Wei Li, and Jianchang Mao. 2011. Bid Landscape Forecasting in Online Ad Exchange Marketplace. In Proceedings of the 17th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD '11). ACM, New York, NY, USA, 265--273. https://doi.org/10.1145/2020408.2020454Google Scholar
Digital Library
- Robert G. Gallager. 1996. Discrete Stochastic Processes .Springer.Google Scholar
- R. Gummadi, P. B. Key, and A. Proutiere. 2011. Optimal bidding strategies in dynamic auctions with budget constraints. In 2011 49th Annual Allerton Conference on Communication, Control, and Computing (Allerton) . 588--588. https://doi.org/10.1109/Allerton.2011.6120220Google Scholar
Cross Ref
- Chong Jiang, Carolyn L. Beck, and R Srikant. 2014. Bidding with limited statistical knowledge in online auctions. ACM SIGMETRICS Performance Evaluation Review , Vol. 41 (04 2014), 38--41. https://doi.org/10.1145/2627534.2627546Google Scholar
Digital Library
- Aranyak Mehta. 2013. Online Matching and Ad Allocation. Found. Trends Theor. Comput. Sci. , Vol. 8, 4 (Oct. 2013), 265--368. https://doi.org/10.1561/0400000057Google Scholar
- Claudia Perlich, Brian Dalessandro, Rod Hook, Ori Stitelman, Troy Raeder, and Foster Provost. 2012. Bid Optimizing and Inventory Scoring in Targeted Online Advertising. In Proceedings of the 18th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD '12). ACM, New York, NY, USA, 804--812. https://doi.org/10.1145/2339530.2339655Google Scholar
Digital Library
- Santiago R. Balseiro and Yonatan Gur. 2017. Learning in Repeated Auctions with Budgets: Regret Minimization and Equilibrium. SSRN Electronic Journal (02 2017). https://doi.org/10.2139/ssrn.2921446Google Scholar
- Panagiotis Spentzouris, Iordanis Koutsopoulos, Kasper Grud Madsen, and Tommy Vestergaard Hansen. 2018. Advertiser Bidding Prediction and Optimization in Online Advertising . 413--424. https://doi.org/10.1007/978--3--319--92007--8_35Google Scholar
- Weinan Zhang and Jun Wang. 2015. Statistical Arbitrage Mining for Display Advertising. (06 2015). https://doi.org/10.1145/2783258.2783269Google Scholar
- Weinan Zhang, Shuai Yuan, and Jun Wang. 2014. Optimal Real-time Bidding for Display Advertising. In Proceedings of the 20th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD '14). ACM, New York, NY, USA, 1077--1086. https://doi.org/10.1145/2623330.2623633Google Scholar
Digital Library
- Weinan Zhang, Ying Zhang, Bin Gao, Yong Yu, Xiaojie Yuan, and Tie-Yan Liu. 2012. Joint optimization of bid and budget allocation in sponsored search. Proceedings of the ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (08 2012). https://doi.org/10.1145/2339530.2339716Google Scholar
Digital Library
Index Terms
Optimal Bidding Strategies for Online Ad Auctions with Overlapping Targeting Criteria
Recommendations
Optimal Bidding Strategies for Online Ad Auctions with Overlapping Targeting Criteria
SIGMETRICS '20: Abstracts of the 2020 SIGMETRICS/Performance Joint International Conference on Measurement and Modeling of Computer SystemsWe analyze the problem of how to optimally bid for ad spaces in online ad auctions. For this we consider the general case of multiple ad campaigns with overlapping targeting criteria. In our analysis we first characterize the structure of an optimal ...
Optimal Bidding Strategies for Online Ad Auctions with Overlapping Targeting Criteria
We analyze the problem of how to optimally bid for ad spaces in online ad auctions. For this we consider the general case of multiple ad campaigns with overlapping targeting criteria. In our analysis we first characterize the structure of an optimal ...
Bidding strategies for realistic multi-unit sealed-bid auctions
When autonomous agents decide on their bidding strategies in real world auctions, they have a number of concerns that go beyond the models that are normally analyzed in traditional auction theory. Oftentimes, the agents have budget constraints and the ...






Comments