Online allocation of display ads with smooth delivery

Proceedings of the ACM SIGKDD International Conference on Knowledge Discovery and Data Mining

Volumn , Issue , 2012, Pages 1213-1221

  Bhalgat, Anand ^a   Feldman, Jon ^b   Mirrokni, Vahab ^b  

^a UNIVERSITY OF PENNSYLVANIA   (United States)

^b GOOGLE INC   (United States)

Author keywords

ad allocation; display ads; online matching; smooth delivery

Indexed keywords

AD ALLOCATION; ALLOCATION PROBLEMS; DELIVERY CONSTRAINTS; EXHAUSTIVE SIMULATION; FINITE TIME HORIZON; NOVEL TECHNIQUES; ON-LINE ALGORITHMS; ON-LINE MATCHING; ONLINE COMPUTATIONS; OVERALL QUALITY; PACKING CONSTRAINTS; REAL DATA SETS; SMOOTH DELIVERY; TIME-PERIODS;

DATA MINING;

ALGORITHMS;

EID: 84866045473     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2339530.2339720     Document Type: Conference Paper

References (11)

1. S. Agrawal, Z. Wang, and Y. Ye. A dynamic near-optimal algorithm for online linear programming. Working paper posted at http://www.stanford.edu/ yyye/.
2. S. Alaei, R. Kumar, A. Malekian, and E. Vee. Balanced allocation with succinct representation. In KDD, pages 523-532, 2010.
3. N. Buchbinder, K. Jain, and J. Naor. Online Primal-Dual Algorithms for Maximizing Ad-Auctions Revenue. In ESA. Springer, 2007.
4. Y. Chen, P. Berkhin, B. Anderson, and N. R. Devanur. Real-time bidding algorithms for performance-based display ad allocation. In KDD, pages 1307-1315, 2011.
5. N. Devanur and T. Hayes. The adwords problem: Online keyword matching with budgeted bidders under random permutations. In ACM EC, 2009.
6. J. Feldman, M. Henzinger, N. Korula, V. Mirrokni, and C. Stein. Online stochastic packing applied to display ad allocation. In ESA, 2010.
7. J. Feldman, N. Korula, V. Mirrokni, S. Muthukrishnan, and M. Pal. Online ad assignment with free disposal. In WINE, 2009.
8. A. Mehta, A. Saberi, U. Vazirani, and V. Vazirani. Adwords and generalized online matching. In FOCS, 2005.
9. V. Mirrokni, S. O. Gharan, and M. ZadiMoghaddam. Simultaneous approximations for adversarial and stochastic online budgeted allocation problems. In SODA, 2012.
10. B. Tan and R. Srikant. Online advertisement, optimization and stochastic networks. CoRR, abs/1009.0870, 2010.
11. E. Vee, S. Vassilvitskii, and J. Shanmugasundaram. Optimal online assignment with forecasts. In ACM EC, 2010.