SHALE: An efficient algorithm for allocation of guaranteed display advertising

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

Volumn , Issue , 2012, Pages 1195-1203

  Bharadwaj, Vijay ^a   Chen, Peiji ^b   Ma, Wenjing ^b   Nagarajan, Chandrashekhar ^b   Tomlin, John ^a   Vassilvitskii, Sergei ^c   Vee, Erik ^d   Yang, Jian ^b  

^a Netflix ^*  (United States)

^b YAHOO RESEARCH   (United States)

^c GOOGLE INC   (United States)

^d FACEBOOK   (United States)

Author keywords

display advertising; online advertising

Indexed keywords

ALLOCATION PLANS; LINEAR TIME; ONLINE ADVERTISING; OPTIMIZATION METHOD; TIME-CRITICAL APPLICATIONS;

ALGORITHMS; DATA MINING; OPTIMIZATION;

MARKETING;

EID: 84866015693     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2339530.2339718     Document Type: Conference Paper

References (8)

1. Y. Chen, P. Berkhin, B. Anderson, and N. R. Devanur. Real-time bidding algorithms for performance-based display ad allocation. In C. Apté, J. Ghosh, and P. Smyth, editors, KDD, pages 1307-1315. ACM, 2011.
2. N. R. Devenur and T. P. Hayes. The adwords problem: online keyword matching with budgeted bidders under random permutations. In J. Chuang, L. Fortnow, and P. Pu, editors, ACM Conference on Electronic Commerce, pages 71-78. ACM, 2009.
3. J. Feldman, M. Henzinger, N. Korula, V. S. Mirrokni, and C. Stein. Online stochastic packing applied to display ad allocation. In M. de Berg and U. Meyer, editors, ESA (1), volume 6346 of Lecture Notes in Computer Science, pages 182-194. Springer, 2010.
4. J. Feldman, A. Mehta, V. S. Mirrokni, and S. Muthukrishnan. Online stochastic matching: Beating 1-1/e. In FOCS, pages 117-126. IEEE Computer Society, 2009.
5. A. Ghosh, P. McAfee, K. Papineni, and S. Vassilvitskii. Bidding for representative allocations for display advertising. In S. Leonardi, editor, WINE, volume 5929 of Lecture Notes in Computer Science, pages 208-219. Springer, 2009.
6. V. S. Mirrokni, S. O. Gharan, and M. Zadimoghaddam. Simultaneous approximations for adversarial and stochastic online budgeted allocation. In D. Randall, editor, SODA, pages 1690-1701. SIAM, 2012.
7. E. Vee, S. Vassilvitskii, and J. Shanmugasundaram. Optimal online assignment with forecasts. In D. C. Parkes, C. Dellarocas, and M. Tennenholtz, editors, ACM Conference on Electronic Commerce, pages 109-118. ACM, 2010.
8. J. Yang, E. Vee, S. Vassilvitskii, J. Tomlin, J. Shanmugasundaram, T. Anastasakos, and O. Kennedy. Inventory allocation for online graphical display advertising. CoRR, abs/1008.3551, 2010.