{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,20]],"date-time":"2026-02-20T21:40:02Z","timestamp":1771623602210,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540742074","type":"print"},{"value":"9783540742081","type":"electronic"}],"license":[{"start":{"date-parts":[[2007,1,1]],"date-time":"2007-01-01T00:00:00Z","timestamp":1167609600000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2007]]},"DOI":"10.1007\/978-3-540-74208-1_2","type":"book-chapter","created":{"date-parts":[[2007,8,27]],"date-time":"2007-08-27T14:52:26Z","timestamp":1188226346000},"page":"16-28","source":"Crossref","is-referenced-by-count":115,"title":["A Knapsack Secretary Problem with Applications"],"prefix":"10.1007","author":[{"given":"Moshe","family":"Babaioff","sequence":"first","affiliation":[]},{"given":"Nicole","family":"Immorlica","sequence":"additional","affiliation":[]},{"given":"David","family":"Kempe","sequence":"additional","affiliation":[]},{"given":"Robert","family":"Kleinberg","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"2_CR1","doi-asserted-by":"crossref","unstructured":"Aggarwal, G., Hartline, J.: Knapsack auctions. In: SODA, pp. 1083\u20131092 (2006)","DOI":"10.1145\/1109557.1109677"},{"key":"2_CR2","unstructured":"Babaioff, M., Immorlica, N., Kleinberg, R.: Matroids, secretary problems, and online mechanisms. In: SODA, pp. 434\u2013443 (2007)"},{"key":"2_CR3","doi-asserted-by":"crossref","unstructured":"Borgs, C., Chayes, J., Etesami, O., Immorlica, N., Jain, K., Mahdian, M.: Dynamics of bid optimization in online advertisement auctions. In: Proceedings of the 16th International World Wide Web Conference, (to appear, 2007)","DOI":"10.1145\/1242572.1242644"},{"key":"2_CR4","series-title":"Lecture Notes in Computer Science","volume-title":"Algorithms \u2013 ESA 2005","author":"N. Buchbinder","year":"2005","unstructured":"Buchbinder, N., Naor, J.: Online primal-dual algorithms for covering and packing problems. In: Brodal, G.S., Leonardi, S. (eds.) ESA 2005. LNCS, vol.\u00a03669, Springer, Heidelberg (2005)"},{"key":"2_CR5","doi-asserted-by":"crossref","unstructured":"Buchbinder, N., Naor, J.: Improved bounds for online routing and packing via a primal-dual approach. In: FOCS (2006)","DOI":"10.1109\/FOCS.2006.39"},{"key":"2_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":"2_CR7","doi-asserted-by":"crossref","unstructured":"Dean, B., Goemans, M., Vondr\u00e1k, J.: Approximating the stochastic knapsack problem: The benefit of adaptivity. In: FOCS, pp. 208\u2013217 (2004)","DOI":"10.1109\/FOCS.2004.15"},{"key":"2_CR8","unstructured":"Dean, B., Goemans, M., Vondr\u00e1k, J.: Adaptivity and approximation for stochastic packing problems. In: SODA, pp. 395\u2013404 (2005)"},{"key":"2_CR9","unstructured":"Dynkin, E.B.: The optimum choice of the instant for stopping a Markov process. Sov. Math. Dokl. 4 (1963)"},{"key":"2_CR10","doi-asserted-by":"crossref","unstructured":"Feldman, J., Muthukrishnan, S., Pal, M., Stein, C.: Budget optimization in search-based advertising auctions. In: Proceedings of the 8th ACM Conference on Electronic Commerce (to appear)","DOI":"10.1145\/1250910.1250917"},{"key":"2_CR11","unstructured":"Kleinberg, R.: A multiple-choice secretary problem with applications to online auctions. In: SODA, pp. 630\u2013631 (2005)"},{"key":"2_CR12","unstructured":"Lueker, G.: Average-case analysis of off-line and on-line knapsack problems. In: SODA, pp. 179\u2013188 (1995)"},{"key":"2_CR13","first-page":"73","volume":"68","author":"A. Marchetti-Spaccamela","year":"1995","unstructured":"Marchetti-Spaccamela, A., Vercellis, C.: Stochastic on-line knapsack problems. Mathematical Programming\u00a068, 73\u2013104 (1995)","journal-title":"Mathematical Programming"},{"key":"2_CR14","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511814075","volume-title":"Randomized Algorithms","author":"R. Motwani","year":"1995","unstructured":"Motwani, R., Raghavan, P.: Randomized Algorithms. Cambridge University Press, Cambridge (1995)"},{"key":"2_CR15","unstructured":"Muthukrishnan, S., Pal, M., Svitkina, Z.: Stochastic models for budget optimization in search-based (manuscript, 2007)"},{"key":"2_CR16","volume-title":"Proceedings of the 7th ACM Conference on Electronic Commerce","author":"P. Rusmevichientong","year":"2006","unstructured":"Rusmevichientong, P., Williamson, D.P.: An adaptive algorithm for selecting profitable keywords for search-based advertising services. In: Proceedings of the 7th ACM Conference on Electronic Commerce, ACM Press, New York (2006)"}],"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-540-74208-1_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,20]],"date-time":"2025-01-20T17:37:05Z","timestamp":1737394625000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-74208-1_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007]]},"ISBN":["9783540742074","9783540742081"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-74208-1_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2007]]}}}