3 search results - page 1 / 1 » The adwords problem: online keyword matching with budgeted b... |
SIGECOM
2009
ACM
13 years 11 months ago
2009
ACM
We consider the problem of a search engine trying to assign a sequence of search keywords to a set of competing bidders, each with a daily spending limit. The goal is to maximize ...
SODA
2012
ACM
11 years 7 months ago
2012
ACM
Motivated by online ad allocation, we study the problem of simultaneous approximations for the adversarial and stochastic online budgeted allocation problem. This problem consists...
SIGECOM
2010
ACM
13 years 9 months ago
2010
ACM
Motivated by the allocation problem facing publishers in display advertising we formulate the online assignment with forecast problem, a version of the online allocation problem w...