Bidding Agent Design in the LinkedIn Ad Marketplace
Not on the map. Why?
Abstract (arXiv)
We establish a general optimization framework for the design of automated bidding agent in dynamic online marketplaces. It optimizes solely for the buyer's interest and is agnostic to the auction mechanism imposed by the seller. As a result, the framework allows, for instance, the joint optimization of a group of ads across multiple platforms each running its own auction format. Bidding strategy derived from this framework automatically guarantees the optimality of budget allocation across ad units and platforms. Common constraints such as budget delivery schedule, return on investments and guaranteed results, directly translates to additional parameters in the bidding formula. We share practical learnings of the deployed bidding system in the LinkedIn ad marketplace based on this framework.
Key facts. Cited by 7 papers in the map (data through 7 Oct 2026). Builds on 7 of its 27 references that are in the map. First posted on arXiv 25 Feb 2022.
Builds on
7 of 27 references.
References · 7
- 2019Introduction to Online Convex Optimizationcited by 793
- 2020The Best of Many Worlds: Dual Mirror Descent for Online Allocation Problemscited by 58
- 2021Stochastic Bandits for Multi-platform Budget Optimization in Online Advertisingcited by 25
- 2016Feedback Control of Real-Time Display Advertisingcited by 22
- 2015Smart Pacing for Effective Online Ad Campaign Optimizationcited by 14
- 2017Profit Maximization for Online Advertising Demand-Side Platformscited by 9
- 2015Optimal Real-Time Bidding Strategiescited by 8
Built on by
Citing papers per year: 2022: 1; 2023: 3; 2024: 1; 2025: 1; 2026: 1.
7 papers.
- 2023Autobidders with Budget and ROI Constraints: Efficiency, Regret, and Pacing Dynamicscited by 20
- 2022Online Bidding Algorithms for Return-on-Spend Constrained Advertiserscited by 17
- 2025Online Bidding under RoS Constraints without Knowing the Valuecited by 2
- 2023Bandits for Sponsored Search Auctions under Unknown Valuation Model: Case Study in E-Commerce Advertisingcited by 0
- 2023RTB Formulation Using Point Processcited by 0
- 2024Cost-Control in Display Advertising: Theory vs Practicecited by 0
- 2026A Lightweight MPC Bidding Framework for Brand Auction Adscited by 0
- 2026A Lightweight MPC Bidding Framework for Brand Auction Ads8 Mar 2026
- 2025Online Bidding under RoS Constraints without Knowing the Value5 Mar 2025
- 2024Cost-Control in Display Advertising: Theory vs Practice5 Sep 2024
- 2023RTB Formulation Using Point Process17 Aug 2023
- 2023Bandits for Sponsored Search Auctions under Unknown Valuation Model: Case Study in E-Commerce Advertising31 Mar 2023
- 2023Autobidders with Budget and ROI Constraints: Efficiency, Regret, and Pacing Dynamics30 Jan 2023
- 2022Online Bidding Algorithms for Return-on-Spend Constrained Advertisers29 Aug 2022