{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,23]],"date-time":"2026-08-23T18:08:54Z","timestamp":1787508534567,"version":"build-2736575974"},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540853626","type":"print"},{"value":"9783540853633","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-85363-3_20","type":"book-chapter","created":{"date-parts":[[2008,8,27]],"date-time":"2008-08-27T15:29:28Z","timestamp":1219850968000},"page":"247-253","source":"Crossref","is-referenced-by-count":15,"title":["Budgeted Allocations in the Full-Information Setting"],"prefix":"10.1007","author":[{"given":"Aravind","family":"Srinivasan","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"issue":"3","key":"20_CR1","first-page":"307","volume":"8","author":"A.A. Ageev","year":"2004","unstructured":"Ageev, A.A., Sviridenko, M.: Pipage rounding: A new method of constructing algorithms with proven performance guarantee. J.\u00a0Comb.\u00a0Optim.\u00a08(3), 307\u2013328 (2004)","journal-title":"J.\u00a0Comb.\u00a0Optim."},{"key":"20_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"26","DOI":"10.1007\/978-3-540-27810-8_4","volume-title":"Algorithm Theory - SWAT 2004","author":"N. Andelman","year":"2004","unstructured":"Andelman, N., Mansour, Y.: Auctions with budget constraints. In: Hagerup, T., Katajainen, J. (eds.) SWAT 2004. LNCS, vol.\u00a03111, pp. 26\u201338. Springer, Heidelberg (2004)"},{"key":"20_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"186","DOI":"10.1007\/978-3-540-70575-8_16","volume-title":"ICALP","author":"Y. Azar","year":"2008","unstructured":"Azar, Y., Birnbaum, B., Karlin, A.R., Mathieu, C., Nguyen, C.T.: Improved approximation algorithms for budgeted allocations. In: Aceto, L., Damg\u00e5vd, I., Goldberg, L.A., Halld\u00f3rsson, M.M., Ingolfsd\u00f3ttir, A., Walukiewicz, I. (eds.) ICALP. LNCS, vol.\u00a05125, pp. 186\u2013197. Springer, Heidelberg (2008)"},{"key":"20_CR4","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, pp. 253\u2013264. Springer, Heidelberg (2007)"},{"key":"20_CR5","unstructured":"Chakrabarty, D., Goel, G.: On the approximability of budgeted allocations and improved lower bounds for submodular welfare maximization and GAP (manuscript)"},{"key":"20_CR6","doi-asserted-by":"crossref","unstructured":"Feige, U., Vondr\u00e1k, J.: Approximation algorithms for allocation problems: Improving the factor of 1 - 1\/e. In: FOCS, pp. 667\u2013676 (2006)","DOI":"10.1109\/FOCS.2006.14"},{"issue":"3","key":"20_CR7","first-page":"324","volume":"53","author":"R. Gandhi","year":"2006","unstructured":"Gandhi, R., Khuller, S., Parthasarathy, S., Srinivasan, A.: Dependent rounding and its applications to approximation algorithms. J.\u00a0ACM\u00a053(3), 324\u2013360 (2006)","journal-title":"J.\u00a0ACM"},{"key":"20_CR8","doi-asserted-by":"crossref","unstructured":"Garg, R., Kumar, V., Pandit, V.: Approximation algorithms for budget-constrained auctions. In: RANDOM-APPROX, pp. 102\u2013113 (2001)","DOI":"10.1007\/3-540-44666-4_14"},{"key":"20_CR9","unstructured":"Goel, G., Mehta, A.: Online budgeted matching in random input models with applications to Adwords. In: SODA, pp. 982\u2013991 (2008)"},{"key":"20_CR10","doi-asserted-by":"crossref","first-page":"699","DOI":"10.1017\/CBO9780511800481.030","volume-title":"Algorithmic Game Theory","author":"S. Lahaie","year":"2007","unstructured":"Lahaie, S., Pennock, D.M., Saberi, A., Vohra, R.V.: Sponsored search auctions. In: Nisan, N., Roughgarden, T., Tardos, \u00c9., Vazirani, V.V. (eds.) Algorithmic Game Theory, ch.\u00a028, pp. 699\u2013716. Cambridge University Press, Cambridge (2007)"},{"issue":"2","key":"20_CR11","doi-asserted-by":"publisher","first-page":"270","DOI":"10.1016\/j.geb.2005.02.006","volume":"55","author":"B. Lehmann","year":"2006","unstructured":"Lehmann, B., Lehmann, D., Nisan, N.: Combinatorial auctions with decreasing marginal utilities. Games and Economic Behavior\u00a055(2), 270\u2013296 (2006)","journal-title":"Games and Economic Behavior"},{"key":"20_CR12","doi-asserted-by":"crossref","unstructured":"Mehta, A., Saberi, A., Vazirani, U.V., Vazirani, V.V.: Adwords and generalized online matching. J.\u00a0ACM\u00a054(5) (2007)","DOI":"10.1145\/1284320.1284321"},{"key":"20_CR13","doi-asserted-by":"crossref","unstructured":"Srinivasan, A.: Distributions on level-sets with applications to approximation algorithms. In: FOCS, pp. 588\u2013597 (2001)","DOI":"10.1109\/SFCS.2001.959935"}],"container-title":["Lecture Notes in Computer Science","Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-85363-3_20.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,23]],"date-time":"2020-11-23T21:24:16Z","timestamp":1606166656000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-85363-3_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540853626","9783540853633"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-85363-3_20","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[]}}