{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T00:42:51Z","timestamp":1725496971925},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540771043"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-77105-0_15","type":"book-chapter","created":{"date-parts":[[2007,12,3]],"date-time":"2007-12-03T01:59:37Z","timestamp":1196647177000},"page":"131-142","source":"Crossref","is-referenced-by-count":23,"title":["Stochastic Models for Budget Optimization in Search-Based Advertising"],"prefix":"10.1007","author":[{"given":"S.","family":"Muthukrishnan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Martin","family":"P\u00e1l","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zoya","family":"Svitkina","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"15_CR1","doi-asserted-by":"crossref","unstructured":"Aggarwal, G., Goel, A., Motwani, R.: Truthful auctions for pricing search keywords. In: Proc. 8th ACM Conf. on Electronic Commerce, pp. 1\u20137 (2006)","DOI":"10.1145\/1134707.1134708"},{"key":"15_CR2","doi-asserted-by":"crossref","unstructured":"Babaioff, M., Immorlica, N., Kempe, D., Kleinberg, R.: A knapsack secretary problem with applications. In: Proc. 10th APPROX (2007)","DOI":"10.1007\/978-3-540-74208-1_2"},{"key":"15_CR3","doi-asserted-by":"crossref","unstructured":"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)","DOI":"10.1145\/1242572.1242644"},{"key":"15_CR4","doi-asserted-by":"crossref","unstructured":"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\u201351 (2005)","DOI":"10.1145\/1064009.1064014"},{"key":"15_CR5","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1002\/nav.3220400203","volume":"40","author":"R.L. Carraway","year":"1993","unstructured":"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\u00a040, 161\u2013173 (1993)","journal-title":"Naval Research Logistics"},{"key":"15_CR6","unstructured":"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)"},{"key":"15_CR7","doi-asserted-by":"crossref","unstructured":"Charikar, M., Chekuri, C., Pal, M.: Sampling bounds for stochastic optimization. In: Proc. 9th International Workshop on Randomization and Computation (2005)","DOI":"10.1007\/11538462_22"},{"key":"15_CR8","doi-asserted-by":"crossref","unstructured":"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\u2013217 (2004)","DOI":"10.1109\/FOCS.2004.15"},{"key":"15_CR9","doi-asserted-by":"crossref","unstructured":"Feldman, J., Muthukrishnan, S., Pal, M., Stein, C.: Budget optimization in search-based advertising auctions. In: Proc. 9th ACM Conf. on Electronic Commerce (2007)","DOI":"10.1145\/1250910.1250917"},{"key":"15_CR10","doi-asserted-by":"crossref","unstructured":"Goel, A., Indyk, P.: Stochastic load balancing and related problems. In: Proc. 40th IEEE Symp. on Foundations of Computer Science (1999)","DOI":"10.1109\/SFFCS.1999.814632"},{"issue":"5","key":"15_CR11","doi-asserted-by":"publisher","first-page":"820","DOI":"10.1287\/opre.38.5.820","volume":"38","author":"M.I. Henig","year":"1990","unstructured":"Henig, M.I.: Risk criteria in a stochastic knapsack problem. Oper. Res.\u00a038(5), 820\u2013825 (1990)","journal-title":"Oper. Res."},{"issue":"1","key":"15_CR12","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1137\/S0097539797329142","volume":"30","author":"J. Kleinberg","year":"2000","unstructured":"Kleinberg, J., Rabani, Y., Tardos, E.: Allocating bandwidth for bursty connections. SIAM Journal on Computing\u00a030(1), 191\u2013217 (2000)","journal-title":"SIAM Journal on Computing"},{"key":"15_CR13","doi-asserted-by":"publisher","first-page":"479","DOI":"10.1137\/S1052623499363220","volume":"12","author":"A.J. Kleywegt","year":"2002","unstructured":"Kleywegt, A.J., Shapiro, A., Homem-de-Mello, T.: The sample average approximation method for stochastic discrete optimization. SIAM J. on Optimization\u00a012, 479\u2013502 (2002)","journal-title":"SIAM J. on Optimization"},{"key":"15_CR14","doi-asserted-by":"crossref","unstructured":"Mahdian, M., Nazerzadeh, H., Saberi, A.: Allocating online advertisement space with unreliable estimates. In: Proc. 9th ACM Conf. on Electronic Commerce (2007)","DOI":"10.1145\/1250910.1250952"},{"key":"15_CR15","doi-asserted-by":"crossref","unstructured":"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\u2013273 (2005)","DOI":"10.1109\/SFCS.2005.12"},{"key":"15_CR16","doi-asserted-by":"crossref","unstructured":"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\u00a0 (2006)","DOI":"10.3386\/w11765"},{"key":"15_CR17","doi-asserted-by":"crossref","unstructured":"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\u2013269 (2006)","DOI":"10.1145\/1134707.1134736"},{"key":"15_CR18","doi-asserted-by":"publisher","first-page":"1025","DOI":"10.2307\/2581283","volume":"31","author":"M. Sniedovich","year":"1980","unstructured":"Sniedovich, M.: Preference order stochastic knapsack problems: Methodological issues. The Journal of the Operational Research Society\u00a031, 1025\u20131032 (1980)","journal-title":"The Journal of the Operational Research Society"},{"issue":"2","key":"15_CR19","doi-asserted-by":"publisher","first-page":"141","DOI":"10.2307\/3009295","volume":"30","author":"E. Steinberg","year":"1979","unstructured":"Steinberg, E., Parks, M.: A preference order dynamic program for a knapsack problem with stochastic rewards. The Journal of the Operational Research Society\u00a030(2), 141\u2013147 (1979)","journal-title":"The Journal of the Operational Research Society"},{"issue":"1","key":"15_CR20","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1145\/1122480.1122493","volume":"37","author":"C. Swamy","year":"2006","unstructured":"Swamy, C., Shmoys, D.B.: Approximation algorithms for 2-stage stochastic optimization problems. SIGACT News\u00a037(1), 33\u201346 (2006)","journal-title":"SIGACT News"}],"container-title":["Lecture Notes in Computer Science","Internet and Network Economics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-77105-0_15.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T07:00:17Z","timestamp":1619506817000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-77105-0_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540771043"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-77105-0_15","relation":{},"subject":[]}}