Proceedings of the 27th ACM SIGKDD Conference on Knowledge Discovery &Amp; Data Mining 2021
DOI: 10.1145/3447548.3467167
|View full text |Cite
|
Sign up to set email alerts
|

An Efficient Deep Distribution Network for Bid Shading in First-Price Auctions

Abstract: Since 2019, most ad exchanges and sell-side platforms (SSPs), in the online advertising industry, shifted from second to first price auctions. Due to the fundamental difference between these auctions, demand-side platforms (DSPs) have had to update their bidding strategies to avoid bidding unnecessarily high and hence overpaying. Bid shading was proposed to adjust the bid price intended for second-price auctions, in order to balance cost and winning probability in a first-price auction setup. In this study, we… Show more

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2021
2021
2023
2023

Publication Types

Select...
4
1

Relationship

0
5

Authors

Journals

citations
Cited by 18 publications
(1 citation statement)
references
References 26 publications
0
1
0
Order By: Relevance
“…Some efforts have been devoted to designing bidding mechanisms to enhance the effectiveness and fairness of advertising auctions from the platform perspective. For example, Zhou et al in [19] introduced a novel deep distribution network for optimal bidding in both open and closed online first-price auctions. Zhang et al in [20] proposed a succinct and effective bid shading algorithm without parametric assumptions for the win distribution.…”
Section: Related Workmentioning
confidence: 99%
“…Some efforts have been devoted to designing bidding mechanisms to enhance the effectiveness and fairness of advertising auctions from the platform perspective. For example, Zhou et al in [19] introduced a novel deep distribution network for optimal bidding in both open and closed online first-price auctions. Zhang et al in [20] proposed a succinct and effective bid shading algorithm without parametric assumptions for the win distribution.…”
Section: Related Workmentioning
confidence: 99%