Expressive Banner Ad Auctions and Model-Based Online Optimization for Clearing
Open/View files
Date
2008
Author(s)
Boutilier, Craig
Sandholm, Tuomas
Walsh, William E.
Publisher
Association for the Advancement of Artificial Intelligence
The Harvard community has made this article openly available. Please share how this access benefits you.
Citation
Boutilier, Craig, David C. Parkes, Tuomas Sandholm, and William E. Walsh. 2008. Expressive banner ad auctions and model-based online optimization for clearing. In Proceedings of the Twenty-third AAAI Conference on Artificial Intelligence and the Twentieth Innovative Applications of Artificial Intelligence Conference: July 13-17, 2008, Chicago, Illinois, ed. American Association for Artificial Intelligence, 30-37. Menlo Park, Calif.: AAAI Press.
Abstract
We present the design of a banner advertising auction which is considerably more expressive than current designs. We describe a general model of expressive ad contract/bidding and an allocation model that can be executed in real time through the assignment of fractions of relevant ad channels to specific advertiser contracts. The uncertainty in channel supply and demand is addresscd by the formulation of a stochastic combinatorial optimization problem for channel allocation that is rerun periodically. We solve this in two different ways: fast deterministic optimization with respect to expectations; and a novel online sample-based stochastic optimization method-- that can be applied to continuous decision spaces--which exploits the deterministic optimization as a black box. Experiments demonstrate the importance of expressive bidding and the value of stochastic optimization.
Other Available Sources
Terms of Use
This article is made available under the terms and conditions applicable to Other Posted Material (LAA), as set forth at Terms of Service
Collection