{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,15]],"date-time":"2026-07-15T10:12:24Z","timestamp":1784110344629,"version":"3.55.0"},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642403279","type":"print"},{"value":"9783642403286","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-40328-6_2","type":"book-chapter","created":{"date-parts":[[2013,8,16]],"date-time":"2013-08-16T13:17:34Z","timestamp":1376659054000},"page":"11-25","source":"Crossref","is-referenced-by-count":27,"title":["The Online Stochastic Generalized Assignment Problem"],"prefix":"10.1007","author":[{"given":"Saeed","family":"Alaei","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"MohammadTaghi","family":"Hajiaghayi","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Vahid","family":"Liaghat","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"2_CR1","doi-asserted-by":"crossref","unstructured":"Alaei, S.: Bayesian combinatorial auctions: Expanding single buyer mechanisms to many buyers. In: FOCS (2011)","DOI":"10.1109\/FOCS.2011.90"},{"key":"2_CR2","doi-asserted-by":"crossref","unstructured":"Alaei, S., Hajiaghayi, M.T., Liaghat, V.: Online prophet-inequality matching with applications to ad allocation. In: EC (2012)","DOI":"10.1145\/2229012.2229018"},{"key":"2_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"311","DOI":"10.1007\/978-3-642-23719-5_27","volume-title":"Algorithms \u2013 ESA 2011","author":"S. Alaei","year":"2011","unstructured":"Alaei, S., Hajiaghayi, M.T., Liaghat, V., Pei, D., Saha, B.: AdCell: Ad allocation in cellular networks. In: Demetrescu, C., Halld\u00f3rsson, M.M. (eds.) ESA 2011. LNCS, vol.\u00a06942, pp. 311\u2013322. Springer, Heidelberg (2011)"},{"key":"2_CR4","doi-asserted-by":"crossref","unstructured":"Bhalgat, A.: A (2 + \u03b5)-approximation algorithm for the stochastic knapsack problem (2012) (unpublished manuscript)","DOI":"10.1137\/1.9781611973082.127"},{"key":"2_CR5","doi-asserted-by":"crossref","unstructured":"Bhalgat, A., Goel, A., Khanna, S.: Improved approximation results for stochastic knapsack problems. In: SODA (2011)","DOI":"10.1137\/1.9781611973082.127"},{"key":"2_CR6","unstructured":"Chekuri, C., Khanna, S.: A ptas for the multiple knapsack problem. In: SODA (2000)"},{"key":"2_CR7","unstructured":"Dean, B.C., Goemans, M.X., Vondrak, J.: Approximating the stochastic knapsack problem: The benefit of adaptivity. In: FOCS (2004)"},{"key":"2_CR8","doi-asserted-by":"crossref","unstructured":"Devanur, N.R., Jain, K., Sivan, B., Wilkens, C.A.: Near optimal online algorithms and fast approximation algorithms for resource allocation problems. In: EC (2011)","DOI":"10.1145\/1993574.1993581"},{"key":"2_CR9","doi-asserted-by":"crossref","unstructured":"Feige, U., Immorlica, N., Mirrokni, V., Nazerzadeh, H.: A combinatorial allocation mechanism with penalties for banner advertising. In: WWW (2008)","DOI":"10.1145\/1367497.1367521"},{"key":"2_CR10","doi-asserted-by":"crossref","unstructured":"Feige, U., Vondrak, J.: Approximation algorithms for allocation problems: Improving the factor of 1 - 1\/e. In: FOCS (2006)","DOI":"10.1109\/FOCS.2006.14"},{"key":"2_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"374","DOI":"10.1007\/978-3-642-10841-9_34","volume-title":"Internet and Network Economics","author":"J. Feldman","year":"2009","unstructured":"Feldman, J., Korula, N., Mirrokni, V., Muthukrishnan, S., P\u00e1l, M.: Online ad assignment with free disposal. In: Leonardi, S. (ed.) WINE 2009. LNCS, vol.\u00a05929, pp. 374\u2013385. Springer, Heidelberg (2009)"},{"key":"2_CR12","doi-asserted-by":"crossref","unstructured":"Fleischer, L., Goemans, M.X., Mirrokni, V.S., Sviridenko, M.: Tight approximation algorithms for maximum general assignment problems. In: SODA (2006)","DOI":"10.1145\/1109557.1109624"},{"key":"2_CR13","unstructured":"Goel, A., Indyk, P.: Stochastic load balancing and related problems. In: FOCS (1999)"},{"key":"2_CR14","unstructured":"Hajiaghayi, M.T., Kleinberg, R.D., Sandholm, T.: Automated online mechanism design and prophet inequalities. In: AAAI (2007)"},{"key":"2_CR15","doi-asserted-by":"crossref","unstructured":"Jain, K., Mahdian, M., Markakis, E., Saberi, A., Vazirani, V.V.: Greedy facility location algorithms analyzed using dual fitting with factor-revealing LP. J. ACM (2003)","DOI":"10.1145\/950620.950621"},{"key":"2_CR16","doi-asserted-by":"crossref","unstructured":"Kleinberg, J., Rabani, Y., Tardos, E.: Allocating bandwidth for bursty connections. In: STOC (1997)","DOI":"10.1145\/258533.258661"},{"key":"2_CR17","doi-asserted-by":"crossref","unstructured":"Krengel, U., Sucheston, L.: Semiamarts and finite values. Bull. Am. Math. Soc. (1977)","DOI":"10.1090\/S0002-9904-1977-14378-4"},{"key":"2_CR18","unstructured":"Krengel, U., Sucheston, L.: On semiamarts, amarts, and processes with finite value. In: Kuelbs, J. (ed.) Probability on Banach Spaces (1978)"},{"key":"2_CR19","doi-asserted-by":"crossref","unstructured":"Mehta, A., Saberi, A., Vazirani, U., Vazirani, V.: Adwords and generalized online matching. J. ACM (2007)","DOI":"10.1145\/1284320.1284321"},{"key":"2_CR20","unstructured":"Wikipedia (2012), http:\/\/en.wikipedia.org\/wiki\/mana"}],"container-title":["Lecture Notes in Computer Science","Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-40328-6_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,3,4]],"date-time":"2022-03-04T00:18:16Z","timestamp":1646353096000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-40328-6_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642403279","9783642403286"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-40328-6_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013]]}}}