Stochastic models for budget optimization in search-based advertising

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4858 LNCS, Issue , 2007, Pages 131-142

  Muthukrishnan, S ^a   Pál, Martin ^a   Svitkina, Zoya ^b  

^a GOOGLE INC   (United States)

^b Dartmouth Department of Computer Science_Dartmouth College

Author keywords

[No Author keywords available]

Indexed keywords

BUDGET CONTROL; MARKETING; OPTIMIZATION; STOCHASTIC MODELS; USER INTERFACES;

ADVERTISEMENT SLOTS; BUDGET OPTIMIZATION;

SEARCH ENGINES;

EID: 38449109438     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-77105-0_15     Document Type: Conference Paper

References (20)

1. Aggarwal, G., Goel, A., Motwani, R.: Truthful auctions for pricing search keywords. In: Proc. 8th ACM Conf. on Electronic Commerce, pp. 1-7 (2006)
2. Babaioff, M., Immorlica, N., Kempe, D., Kleinberg, R.: A knapsack secretary problem with applications. In: Proc. 10th APPROX (2007)
3. Borgs, C., Chayes, J., Etesami, O., Immorlica, N., Jain, K., Mahdian, M.: Bid optimization in online advertisement auctions. In: 16th International World Wide Web Conference (2007)
4. Borgs, C., Chayes, J., Immorlica, N., Mahdian, M., Saberi, A.: Multi-unit auctions with budget-constrained bidders. In: Proc. 7th ACM Conf. on Electronic Commerce, pp. 44-51 (2005)
5. Carraway, R.L., Schmidt, R.L., Weatherford, L.R.: An algorithm for maximizing target achievement in the stochastic knapsack problem with normal returns. Naval Research Logistics 40, 161-173 (1993)
6. Chakrabarty, D., Zhou, Y., Lukose, R.: Budget constrained bidding in keyword auctions and online knapsack problems. In: WWW 2007 Workshop on Sponsored Search Auctions (2007)
7. Charikar, M., Chekuri, C., Pal, M.: Sampling bounds for stochastic optimization. In: Proc. 9th International Workshop on Randomization and Computation (2005)
8. Dean, B.C., Goemans, M.X., Vondrak, J.: Approximating the stochastic knapsack problem: The benefit of adaptivity. In: Proc. 45th IEEE Symp. on Foundations of Computer Science, pp. 208-217 (2004)
9. Feldman, J., Muthukrishnan, S., Pal, M., Stein, C.: Budget optimization in search-based advertising auctions. In: Proc. 9th ACM Conf. on Electronic Commerce (2007)
10. Goel, A., Indyk, P.: Stochastic load balancing and related problems. In: Proc. 40th IEEE Symp. on Foundations of Computer Science (1999)
11. Henig, M.I.: Risk criteria in a stochastic knapsack problem. Oper. Res. 38(5), 820-825 (1990)
12. Kleinberg, J., Rabani, Y., Tardos, E.: Allocating bandwidth for bursty connections. SIAM Journal on Computing 30(1), 191-217 (2000)
13. Kleywegt, A.J., Shapiro, A., Homem-de-Mello, T.: The sample average approximation method for stochastic discrete optimization. SIAM J. on Optimization 12, 479-502 (2002)
14. Mahdian, M., Nazerzadeh, H., Saberi, A.: Allocating online advertisement space with unreliable estimates. In: Proc. 9th ACM Conf. on Electronic Commerce (2007)
15. Mehta, A., Saberi, A., Vazirani, U., Vazirani, V.: Adwords and generalized on-line matching. In: Proc. 46th IEEE Symp. on Foundations of Computer Science, pp. 264-273 (2005)
16. Ostrovsky, M., Edelman, B., Schwarz, M.: Internet advertising and the generalized second price auction: Selling billions of dollars worth of keywords (forthcoming). American Economic Review (2006)
17. Rusmevichientong, P., Williamson, D.P.: An adaptive algorithm for selecting profitable keywords for search-based advertising services. In: Proc. 8th ACM Conf. on Electronic Commerce, pp. 260-269 (2006)
18. Sniedovich, M.: Preference order stochastic knapsack problems: Methodological issues. The Journal of the Operational Research Society 31, 1025-1032 (1980)
19. Steinberg, E., Parks, M.: A preference order dynamic program for a knapsack problem with stochastic rewards. The Journal of the Operational Research Society 30(2), 141-147 (1979)
20. Swamy, C., Shmoys, D.B.: Approximation algorithms for 2-stage stochastic optimization problems. SIGACT News 37(1), 33-46 (2006)