Pith. sign in

REVIEW 2 cited by

Bid Shading by Win-Rate Estimation and Surplus Maximization

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2009.09259 v1 pith:MCNUKY6U submitted 2020-09-19 cs.GT cs.IRcs.LGstat.ML

classification cs.GTcs.IRcs.LGstat.ML
keywords shadingmaximizationpricesurplusadvertisersalgorithmalgorithmsapproach
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

This paper describes a new win-rate based bid shading algorithm (WR) that does not rely on the minimum-bid-to-win feedback from a Sell-Side Platform (SSP). The method uses a modified logistic regression to predict the profit from each possible shaded bid price. The function form allows fast maximization at run-time, a key requirement for Real-Time Bidding (RTB) systems. We report production results from this method along with several other algorithms. We found that bid shading, in general, can deliver significant value to advertisers, reducing price per impression to about 55% of the unshaded cost. Further, the particular approach described in this paper captures 7% more profit for advertisers, than do benchmark methods of just bidding the most probable winning price. We also report 4.3% higher surplus than an industry Sell-Side Platform shading service. Furthermore, we observed 3% - 7% lower eCPM, eCPC and eCPA when the algorithm was integrated with budget controllers. We attribute the gains above as being mainly due to the explicit maximization of the surplus function, and note that other algorithms can take advantage of this same approach.

Discussion (0). Sign in to comment.

Forward citations

Cited by 2 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. Generative Bid Shading in Real-Time Bidding Advertising

    cs.GT 2025-08 unverdicted novelty 6.0 of 10

    GBS replaces two-stage bid landscape modeling with an autoregressive generative model plus reward-aligned policy optimization to improve short- and long-term advertiser surplus in real-time bidding.

  2. HOB: A Holistically Optimized Bidding Strategy under Heterogeneous Bidding Environments

    cs.GT 2025-10 conditional novelty 4.0 of 10

    HOB equalizes marginal cost across heterogeneous auction channels and uses a zero-inflated exponential win-price model for first-price auctions with organic traffic, reporting a 3.0% GMV lift in online A/B tests.

Pith tools