Dual Based DSP Bidding Strategy and its Application

05/26/2017
by   Huahui Liu, et al.
0

In recent years, RTB(Real Time Bidding) becomes a popular online advertisement trading method. During the auction, each DSP is supposed to evaluate this opportunity and respond with an ad and corresponding bid price. Generally speaking, this is a kind of assginment problem for DSP. However, unlike traditional one, this assginment problem has bid price as additional variable. It's essential to find an optimal ad selection and bid price determination strategy. In this document, two major steps are taken to tackle it. First, the augmented GAP(Generalized Assignment Problem) is proposed and a general bidding strategy is correspondingly provided. Second, we show that DSP problem is a special case of the augmented GAP and the general bidding strategy applies. To the best of our knowledge, our solution is the first DSP bidding framework that is derived from strict second price auction assumption and is generally applicable to the multiple ads scenario with various objectives and constraints. Our strategy is verified through simulation and outperforms state-of-the-art strategies in real application.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
07/05/2022

First Price Auction is 1 - 1/e^2 Efficient

We prove that the PoA of First Price Auctions is 1 - 1/e^2 ≈ 0.8647, clo...
research
01/16/2020

Why Do Competitive Markets Converge to First-Price Auctions?

We consider a setting in which bidders participate in multiple auctions ...
research
10/22/2020

A novel auction system for selecting advertisements in Real-Time bidding

Real-Time Bidding is a new Internet advertising system that has become v...
research
10/22/2021

Auctions Between Regret-Minimizing Agents

We analyze a scenario in which software agents implemented as regret-min...
research
07/09/2018

Optimization of a SSP's Header Bidding Strategy using Thompson Sampling

Over the last decade, digital media (web or app publishers) generalized ...
research
10/25/2018

The Second-Price Knapsack Problem: Near-Optimal Real Time Bidding in Internet Advertisement

In the past decade, Real Time Bidding (RTB) has become one of the most c...
research
11/16/2021

Real-time Bidding for Time Constrained Impression Contracts in First and Second Price Auctions – Theory and Algorithms

We study the optimal behavior of a bidder in a real-time auction subject...

Please sign up or login with your details

Forgot password? Click here to reset