Budget smoothing for internet ad auctions: a game theoretic approach

  • Authors:

  • Denis Charles;Deeparnab Chakrabarty;Max Chickering;Nikhil R. Devanur;Lei Wang

  • Affiliations:

  • Microsoft Research, Redmond, WA, USA;Microsoft Research, Bangalore, India;Microsoft Research, Redmond, WA, USA;Microsoft Research, Redmond, WA, USA;Microsoft adCenter, Bellevue, WA, USA

  • Venue:
  • Proceedings of the fourteenth ACM conference on Electronic commerce
  • Year:
  • 2013

Quantified Score

Hi-index 0.00

Visualization

Abstract

In Internet ad auctions, search engines often throttle budget constrained advertisers so as to spread their spends across the specified time period. Such policies are known as budget smoothing policies. In this paper, we perform a principled, game-theoretic study of what the outcome of an ideal budget smoothing algorithm should be. In particular, we propose the notion of regret-free budget smoothing policies whose outcomes throttle each advertiser optimally, given the participation of the other advertisers. We show that regret-free budget smoothing policies always exist, and in the case of single slot auctions we can give a polynomial time smoothing algorithm. Inspired by the existence proof, we design a heuristic for budget smoothing which performs considerably better than existing benchmark heuristics.