{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,13]],"date-time":"2026-10-13T16:17:01Z","timestamp":1791908221787,"version":"4.3.4"},"publisher-location":"Berlin, Heidelberg","reference-count":27,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642157745","type":"print"},{"value":"9783642157752","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-15775-2_16","type":"book-chapter","created":{"date-parts":[[2010,9,1]],"date-time":"2010-09-01T10:47:32Z","timestamp":1283338052000},"page":"182-194","source":"Crossref","is-referenced-by-count":88,"title":["Online Stochastic Packing Applied to Display Ad Allocation"],"prefix":"10.1007","author":[{"given":"Jon","family":"Feldman","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Monika","family":"Henzinger","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Nitish","family":"Korula","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Vahab S.","family":"Mirrokni","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Cliff","family":"Stein","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"16_CR1","unstructured":"Agrawal, S., Wang, Z., Ye, Y.: A dynamic near-optimal algorithm for online linear programming, Working paper posted at http:\/\/www.stanford.edu\/~yyye\/"},{"key":"16_CR2","unstructured":"Alaei, S., Malekian, A.: Maximizing sequence-submodular functions (2009) (manuscript)"},{"key":"16_CR3","doi-asserted-by":"crossref","unstructured":"Awerbuch, B., Azar, Y., Plotkin, S.: Throughput-competitive on-line routing. In: FOCS, vol.\u00a034, pp. 32\u201340 (1993)","DOI":"10.1109\/SFCS.1993.366884"},{"key":"16_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"186","DOI":"10.1007\/978-3-540-70575-8_16","volume-title":"Automata, Languages and Programming","author":"Y. Azar","year":"2008","unstructured":"Azar, Y., Birnbaum, B., Karlin, A., Mathieu, C., Nguyen, C.: Improved Approximation Algorithms for Budgeted Allocations. In: Aceto, L., Damg\u00e5rd, I., Goldberg, L.A., Halld\u00f3rsson, M.M., Ing\u00f3lfsd\u00f3ttir, A., Walukiewicz, I. (eds.) ICALP 2008, Part I. LNCS, vol.\u00a05125, pp. 186\u2013197. Springer, Heidelberg (2008)"},{"key":"16_CR5","doi-asserted-by":"crossref","unstructured":"Babaioff, M., Immorlica, N., Kempe, D., Kleinberg, R.: Online auctions and generalized secretary problems. SIGecom Exchanges\u00a07(2) (2008)","DOI":"10.1145\/1399589.1399596"},{"key":"16_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1007\/978-3-540-75520-3_24","volume-title":"Algorithms \u2013 ESA 2007","author":"N. Buchbinder","year":"2007","unstructured":"Buchbinder, N., Jain, K., Naor, J.: Online Primal-Dual Algorithms for Maximizing Ad-Auctions Revenue. In: Arge, L., Hoffmann, M., Welzl, E. (eds.) ESA 2007. LNCS, vol.\u00a04698, p. 253. Springer, Heidelberg (2007)"},{"key":"16_CR7","doi-asserted-by":"crossref","unstructured":"Buchbinder, N., Naor, J.: Improved bounds for online routing and packing via a primal-dual approach. In: FOCS, pp. 293\u2013304 (2006)","DOI":"10.1109\/FOCS.2006.39"},{"key":"16_CR8","doi-asserted-by":"crossref","unstructured":"Chakrabarty, D., Goel, G.: On the approximability of budgeted allocations and improved lower bounds for submodular welfare maximization and GAP. In: Proc. FOCS, pp. 687\u2013696 (2008)","DOI":"10.1109\/FOCS.2008.47"},{"key":"16_CR9","unstructured":"Chawla, S., Hartline, J.D., Malec, D., Sivan, B.: Sequential posted pricing and multi-parameter mechanism design. In: Proc. of ACM STOC, pp. 311\u2013320 (2010)"},{"key":"16_CR10","doi-asserted-by":"crossref","unstructured":"Devanur, N., Hayes, T.: The adwords problem: Online keyword matching with budgeted bidders under random permutations. In: ACM EC (2009)","DOI":"10.1145\/1566374.1566384"},{"key":"16_CR11","unstructured":"Feldman, J., Henzinger, M., Korula, N., Mirrokni, V.S., Stein, C.: Online stochastic ad allocation: Efficiency and fairness, http:\/\/arxiv.org\/abs\/1001.5076"},{"key":"16_CR12","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., Pal, M.: Online ad assignment with free disposal. In: Leonardi, S. (ed.) WINE 2009. LNCS, vol.\u00a05929, pp. 374\u2013385. Springer, Heidelberg (2009)"},{"key":"16_CR13","doi-asserted-by":"crossref","unstructured":"Feldman, J., Mehta, A., Mirrokni, V., Muthukrishnan, S.: Online stochastic matching: Beating 1 - 1\/e. In: FOCS (2009)","DOI":"10.1109\/FOCS.2009.72"},{"key":"16_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"208","DOI":"10.1007\/978-3-642-10841-9_20","volume-title":"Internet and Network Economics","author":"A. Ghosh","year":"2009","unstructured":"Ghosh, A., McAfee, P., Papineni, K., Vassilvitskii, S.: Bidding for representative allocations for display advertising. In: Leonardi, S. (ed.) WINE 2009. LNCS, vol.\u00a05929, pp. 208\u2013219. Springer, Heidelberg (2009)"},{"key":"16_CR15","doi-asserted-by":"crossref","unstructured":"Ghosh, A., Rubinstein, B.I.P., Vassilvitskii, S., Zinkevich, M.: Adaptive bidding for display advertising. In: WWW, pp. 251\u2013260 (2009)","DOI":"10.1145\/1526709.1526744"},{"key":"16_CR16","doi-asserted-by":"crossref","unstructured":"Goel, A., Meyerson, A., Plotkin, S.A.: Combining fairness with throughput: online routing with multiple objectives. In: STOC, pp. 670\u2013679 (2000)","DOI":"10.1145\/335305.335400"},{"key":"16_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"335","DOI":"10.1007\/978-3-540-77105-0_35","volume-title":"Internet and Network Economics","author":"G. Goel","year":"2007","unstructured":"Goel, G., Mehta, A.: Adwords auctions with decreasing valuation bids. In: Deng, X., Graham, F.C. (eds.) WINE 2007. LNCS, vol.\u00a04858, pp. 335\u2013340. Springer, Heidelberg (2007)"},{"key":"16_CR18","unstructured":"Goel, G., Mehta, A.: Online budgeted matching in random input models with applications to adwords. In: SODA, pp. 982\u2013991 (2008)"},{"key":"16_CR19","doi-asserted-by":"crossref","unstructured":"Karp, R., Vazirani, U., Vazirani, V.: An optimal algorithm for online bipartite matching. In: Proc. STOC (1990)","DOI":"10.1145\/100216.100262"},{"issue":"1","key":"16_CR20","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1006\/jcss.2001.1752","volume":"63","author":"J.M. Kleinberg","year":"2001","unstructured":"Kleinberg, J.M., Rabani, Y., Tardos, \u00c9.: Fairness in routing and load balancing. J. Comput. Syst. Sci.\u00a063(1), 2\u201320 (2001)","journal-title":"J. Comput. Syst. Sci."},{"key":"16_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"508","DOI":"10.1007\/978-3-642-02930-1_42","volume-title":"Automata, Languages and Programming","author":"N. Korula","year":"2009","unstructured":"Korula, N., Pal, M.: Algorithms for secretary problems on graphs and hypergraphs. In: Albers, S., Marchetti-Spaccamela, A., Matias, Y., Nikoletseas, S., Thomas, W. (eds.) ICALP 2009. LNCS, vol.\u00a05556, pp. 508\u2013520. Springer, Heidelberg (2009)"},{"issue":"3","key":"16_CR22","doi-asserted-by":"publisher","first-page":"657","DOI":"10.1137\/S0097539703434966","volume":"36","author":"A. Kumar","year":"2006","unstructured":"Kumar, A., Kleinberg, J.M.: Fairness measures for resource allocation. SIAM J. Comput.\u00a036(3), 657\u2013680 (2006)","journal-title":"SIAM J. Comput."},{"key":"16_CR23","doi-asserted-by":"crossref","unstructured":"Lipton, R., Markakis, E., Mossel, E., Saberi, A.: On approximately fair allocations of indivisible goods. In: ACM EC (2004)","DOI":"10.1145\/988772.988792"},{"key":"16_CR24","doi-asserted-by":"crossref","unstructured":"Mahdian, M., Nazerzadeh, H., Saberi, A.: Allocating online advertisement space with unreliable estimates. In: ACM EC, pp. 288\u2013294 (2007)","DOI":"10.1145\/1250910.1250952"},{"key":"16_CR25","unstructured":"Mehta, A., Saberi, A., Vazirani, U., Vazirani, V.: Adwords and generalized online matching. In: FOCS (2005)"},{"key":"16_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"247","DOI":"10.1007\/978-3-540-85363-3_20","volume-title":"Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques","author":"A. Srinivasan","year":"2008","unstructured":"Srinivasan, A.: Budgeted Allocations in the Full-Information Setting. In: Goel, A., Jansen, K., Rolim, J.D.P., Rubinfeld, R. (eds.) APPROX and RANDOM 2008. LNCS, vol.\u00a05171, pp. 247\u2013253. Springer, Heidelberg (2008)"},{"key":"16_CR27","doi-asserted-by":"crossref","unstructured":"Vee, E., Vassilvitskii, S., Shanmugasundaram, J.: Optimal online assignment with forecasts. In: Proc. of ACM EC, pp. 109\u2013118 (2010)","DOI":"10.1145\/1807342.1807360"}],"container-title":["Lecture Notes in Computer Science","Algorithms \u2013 ESA 2010"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-15775-2_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,2]],"date-time":"2019-06-02T20:18:08Z","timestamp":1559506688000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-15775-2_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642157745","9783642157752"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-15775-2_16","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010]]}}}