Maximizing net income of the auction waterfall with an abort decision tree

09/04/2018
by   Michael Ting, et al.
0

An online auction waterfall for an ad impression may contain auctions that are unlikely to result in a winning bid. Instead of always running through the full auction sequence, one could reduce the transaction cost by predicting and skipping these auctions. In this paper, we derive the auction abort rule that maximizes the net income of the waterfall under certain conditions, knowing only the publisher tag of the current auction and the ad request context. The net income is defined as the payoff (revenue) minus the transaction cost. We translate the abort rule into a purity measure and propose a corresponding split criterion for a decision tree. Training and testing on randomly sampled data indicate that the abort decision tree performs better than the full waterfall and the abort rule that makes use of only the publisher tag feature. When the transaction cost is higher, the cost saving, and thus net income gain, is higher for either abort decision rule.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
02/12/2023

Yahoo Ad Exchange: Optimizing Floors in First Price Auctions

In this paper we outline the methodology and impact of optimizing floors...
research
01/18/2023

Auctions without commitment in the auto-bidding world

Advertisers in online ad auctions are increasingly using auto-bidding me...
research
02/08/2023

Fully-Dynamic Approximate Decision Trees With Worst-Case Update Time Guarantees

We give the first algorithm that maintains an approximate decision tree ...
research
02/10/2021

Detecting corruption in single-bidder auctions via positive-unlabelled learning

In research and policy-making guidelines, the single-bidder rate is a co...
research
05/30/2022

bsnsing: A decision tree induction method based on recursive optimal boolean rule composition

This paper proposes a new mixed-integer programming (MIP) formulation to...
research
01/25/2018

Information gain ratio correction: Improving prediction with more balanced decision tree splits

Decision trees algorithms use a gain function to select the best split d...
research
06/07/2014

An exact and two heuristic strategies for truthful bidding in combinatorial transport auctions

To support a freight carrier in a combinatorial transport auction, we pr...

Please sign up or login with your details

Forgot password? Click here to reset