Optimal Bidding, Allocation and Budget Spending for a Demand Side Platform Under Many Auction Types release_rp7gwcwidvhvxp7fbeqny5eqya

by Alfonso Lobos, Paul Grigas, Zheng Wen, Kuang-chih Lee

Released as a article .

2018  

Abstract

We develop a novel optimization model to maximize the profit of a Demand-Side Platform (DSP) while ensuring that the budget utilization preferences of the DSP's advertiser clients are adequately met. Our model is highly flexible and can be applied in a Real-Time Bidding environment (RTB) with arbitrary auction types, e.g., both first and second price auctions. Our proposed formulation leads to a non-convex optimization problem due to the joint optimization over both impression allocation and bid price decisions. Using Fenchel duality theory, we construct a dual problem that is convex and can be solved efficiently to obtain feasible bidding prices and allocation variables that can be deployed in a RTB setting. With a few minimal additional assumptions on the properties of the auctions, we demonstrate theoretically that our computationally efficient procedure based on convex optimization principles is guaranteed to deliver a globally optimal solution. We conduct experiments using data from a real DSP to validate our theoretical findings and to demonstrate that our method successfully trades off between DSP profitability and budget utilization in a simulated online environment.
In text/plain format

Archived Files and Locations

application/pdf  821.2 kB
file_qlocmcs3rjejjphtofllvljpxi
arxiv.org (repository)
web.archive.org (webarchive)
Read Archived PDF
Preserved and Accessible
Type  article
Stage   submitted
Date   2018-05-29
Version   v1
Language   en ?
arXiv  1805.11645v1
Work Entity
access all versions, variants, and formats of this works (eg, pre-prints)
Catalog Record
Revision: a339d9a1-b801-41a2-8c92-d2a87273d384
API URL: JSON