{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,9]],"date-time":"2025-10-09T13:06:14Z","timestamp":1760015174418,"version":"3.40.3"},"publisher-location":"Cham","reference-count":30,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031183669"},{"type":"electronic","value":"9783031183676"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-3-031-18367-6_4","type":"book-chapter","created":{"date-parts":[[2022,10,20]],"date-time":"2022-10-20T16:05:36Z","timestamp":1666281936000},"page":"61-81","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Knapsack Secretary Through Boosting"],"prefix":"10.1007","author":[{"given":"Andreas","family":"Abels","sequence":"first","affiliation":[]},{"given":"Leon","family":"Ladewig","sequence":"additional","affiliation":[]},{"given":"Kevin","family":"Schewior","sequence":"additional","affiliation":[]},{"given":"Moritz","family":"Stinzend\u00f6rfer","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,10,21]]},"reference":[{"issue":"9","key":"4_CR1","doi-asserted-by":"publisher","first-page":"2833","DOI":"10.1007\/s00453-021-00844-5","volume":"83","author":"S Albers","year":"2021","unstructured":"Albers, S., Khan, A., Ladewig, L.: Best fit bin packing with random order revisited. Algorithmica 83(9), 2833\u20132858 (2021)","journal-title":"Algorithmica"},{"issue":"6","key":"4_CR2","doi-asserted-by":"publisher","first-page":"1750","DOI":"10.1007\/s00453-021-00801-2","volume":"83","author":"S Albers","year":"2021","unstructured":"Albers, S., Khan, A., Ladewig, L.: Improved online algorithms for knapsack and GAP in the random order model. Algorithmica 83(6), 1750\u20131785 (2021)","journal-title":"Algorithmica"},{"key":"4_CR3","doi-asserted-by":"publisher","first-page":"102","DOI":"10.1016\/j.tcs.2021.02.022","volume":"863","author":"S Albers","year":"2021","unstructured":"Albers, S., Ladewig, L.: New results for the k-secretary problem. Theor. Comput. Sci. 863, 102\u2013119 (2021)","journal-title":"Theor. Comput. Sci."},{"key":"4_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"16","DOI":"10.1007\/978-3-540-74208-1_2","volume-title":"Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques","author":"M Babaioff","year":"2007","unstructured":"Babaioff, M., Immorlica, N., Kempe, D., Kleinberg, R.: A knapsack secretary problem with applications. In: Charikar, M., Jansen, K., Reingold, O., Rolim, J.D.P. (eds.) APPROX\/RANDOM - 2007. LNCS, vol. 4627, pp. 16\u201328. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-74208-1_2"},{"key":"4_CR5","doi-asserted-by":"crossref","unstructured":"Babaioff, M., Immorlica, N., Kempe, D., Kleinberg, R.: Matroid secretary problems. J. ACM 65(6), 35:1\u201335:26 (2018)","DOI":"10.1145\/3212512"},{"key":"4_CR6","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1016\/j.tcs.2014.01.027","volume":"527","author":"H-J B\u00f6ckenhauer","year":"2014","unstructured":"B\u00f6ckenhauer, H.-J., Komm, D., Kr\u00e1lovic, R., Rossmanith, P.: The online knapsack problem: advice and randomization. Theor. Comput. Sci. 527, 61\u201372 (2014)","journal-title":"Theor. Comput. Sci."},{"key":"4_CR7","unstructured":"Boyar, J., Favrholdt, L.M., Larsen, K.S.: Online unit profit knapsack with untrusted predictions. In: Scandinavian Symposium and Workshops on Algorithm Theory (SWAT), pp. 20:1\u201320:17 (2022)"},{"issue":"1","key":"4_CR8","doi-asserted-by":"publisher","first-page":"190","DOI":"10.1287\/moor.2013.0604","volume":"39","author":"N Buchbinder","year":"2014","unstructured":"Buchbinder, N., Jain, K., Singh, M.: Secretary problems via linear programming. Math. Oper. Res. 39(1), 190\u2013206 (2014)","journal-title":"Math. Oper. Res."},{"key":"4_CR9","doi-asserted-by":"crossref","unstructured":"Chan, T.-H.H., Chen, F., Jiang, S.H.-C.: Revealing optimal thresholds for generalized secretary problem via continuous LP: impacts on online $$k$$-item auction and bipartite $$k$$-matching with random arrival order. In: ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 1169\u20131188 (2015)","DOI":"10.1137\/1.9781611973730.78"},{"issue":"2","key":"4_CR10","doi-asserted-by":"publisher","first-page":"1287","DOI":"10.1287\/moor.2021.1167","volume":"47","author":"JR Correa","year":"2022","unstructured":"Correa, J.R., D\u00fctting, P., Fischer, F.A., Schewior, K.: Prophet inequalities for independent and identically distributed random variables from an unknown distribution. Math. Oper. Res. 47(2), 1287\u20131309 (2022)","journal-title":"Math. Oper. Res."},{"key":"4_CR11","unstructured":"Correa, J.R., D\u00fctting, P., Fischer, F.A., Schewior, K., Ziliotto, B.: Streaming algorithms for online selection problems. In: Innovations in Theoretical Computer Science (ITCS), p. 86:1 (2021)"},{"issue":"2","key":"4_CR12","doi-asserted-by":"publisher","first-page":"126","DOI":"10.1145\/2491533.2491557","volume":"44","author":"M Dinitz","year":"2013","unstructured":"Dinitz, M.: Recent advances on the matroid secretary problem. SIGACT News 44(2), 126\u2013142 (2013)","journal-title":"SIGACT News"},{"key":"4_CR13","first-page":"627","volume":"4","author":"E Dynkin","year":"1963","unstructured":"Dynkin, E.: The optimum choice of the instant for stopping a Markov process. Soviet Math. Dokl. 4, 627\u2013629 (1963)","journal-title":"Soviet Math. Dokl."},{"key":"4_CR14","doi-asserted-by":"crossref","unstructured":"Ezra, T., Feldman, M., Gravin, N., Tang, Z.G.: General graphs are easier than bipartite graphs: tight bounds for secretary matching. In: ACM Conference on Economics and Computation (EC), pp. 1148\u20131177 (2022)","DOI":"10.1145\/3490486.3538290"},{"issue":"2","key":"4_CR15","doi-asserted-by":"publisher","first-page":"638","DOI":"10.1287\/moor.2017.0876","volume":"43","author":"M Feldman","year":"2018","unstructured":"Feldman, M., Svensson, O., Zenklusen, R.: A simple $$O$$(log log(rank))-competitive algorithm for the matroid secretary problem. Math. Oper. Res. 43(2), 638\u2013650 (2018)","journal-title":"Math. Oper. Res."},{"issue":"3","key":"4_CR16","first-page":"282","volume":"4","author":"TS Ferguson","year":"1989","unstructured":"Ferguson, T.S.: Who solved the secretary problem? Stat. Sci. 4(3), 282\u2013289 (1989)","journal-title":"Stat. Sci."},{"key":"4_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"188","DOI":"10.1007\/978-3-030-92702-8_12","volume-title":"Approximation and Online Algorithms","author":"J Giliberti","year":"2021","unstructured":"Giliberti, J., Karrenbauer, A.: Improved online algorithm for fractional knapsack in the random order model. In: Koenemann, J., Peis, B. (eds.) WAOA 2021. LNCS, vol. 12982, pp. 188\u2013205. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-92702-8_12"},{"key":"4_CR18","doi-asserted-by":"crossref","unstructured":"Gupta, A., Singla, S.: Random-order models. In: Roughgarden, T. (ed.) Beyond the Worst-Case Analysis of Algorithms, pp. 234\u2013258. Cambridge University Press (2021)","DOI":"10.1017\/9781108637435.015"},{"key":"4_CR19","unstructured":"Hoefer, M., Kodric, B.: Combinatorial secretary problems with ordinal information. In: International Colloquium on Automata, Languages, and Programming (ICALP), pp. 133:1\u2013133:14 (2017)"},{"key":"4_CR20","unstructured":"Kenyon, C.: Best-fit bin-packing with random order. In: ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 359\u2013364 (1996)"},{"key":"4_CR21","unstructured":"Kesselheim, T., Molinaro, M.: Knapsack secretary with bursty adversary. In: International Colloquium on Automata, Languages, and Programming (ICALP), pp. 72:1\u201372:15 (2020)"},{"key":"4_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"589","DOI":"10.1007\/978-3-642-40450-4_50","volume-title":"Algorithms \u2013 ESA 2013","author":"T Kesselheim","year":"2013","unstructured":"Kesselheim, T., Radke, K., T\u00f6nnis, A., V\u00f6cking, B.: An optimal online algorithm for weighted bipartite matching and extensions to combinatorial auctions. In: Bodlaender, H.L., Italiano, G.F. (eds.) ESA 2013. LNCS, vol. 8125, pp. 589\u2013600. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-40450-4_50"},{"issue":"5","key":"4_CR23","doi-asserted-by":"publisher","first-page":"1939","DOI":"10.1137\/15M1033708","volume":"47","author":"T Kesselheim","year":"2018","unstructured":"Kesselheim, T., Radke, K., T\u00f6nnis, A., V\u00f6cking, B.: Primal beats dual on online packing LPS in the random-order model. SIAM J. Comput. 47(5), 1939\u20131964 (2018)","journal-title":"SIAM J. Comput."},{"key":"4_CR24","unstructured":"Kleinberg, R.D.: A multiple-choice secretary algorithm with applications to online auctions. In: ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 630\u2013631 (2005)"},{"key":"4_CR25","doi-asserted-by":"crossref","unstructured":"Lachish, O.: $${O}(\\log \\log \\rm rank )$$ competitive ratio for the matroid secretary problem. In: IEEE Symposium on Foundations of Computer Science (FOCS), pp. 326\u2013335 (2014)","DOI":"10.1109\/FOCS.2014.42"},{"key":"4_CR26","doi-asserted-by":"publisher","first-page":"39","DOI":"10.2307\/2985407","volume":"10","author":"D Lindley","year":"1961","unstructured":"Lindley, D.: Dynamic programming and decision theory. Appl. Statist. 10, 39\u201351 (1961)","journal-title":"Appl. Statist."},{"key":"4_CR27","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1007\/BF01585758","volume":"68","author":"A Marchetti-Spaccamela","year":"1995","unstructured":"Marchetti-Spaccamela, A., Vercellis, C.: Stochastic on-line knapsack problems. Math. Program. 68, 73\u2013104 (1995)","journal-title":"Math. Program."},{"key":"4_CR28","unstructured":"Naori, D., Raz, D.: Online multidimensional packing problems in the random-order model. In: International Symposium on Algorithms and Computation (ISAAC), pp. 10:1\u201310:15 (2019)"},{"issue":"2","key":"4_CR29","doi-asserted-by":"publisher","first-page":"642","DOI":"10.1287\/moor.2020.1083","volume":"46","author":"JA Soto","year":"2021","unstructured":"Soto, J.A., Turkieltaub, A., Verdugo, V.: Strong algorithms for the ordinal matroid secretary problem. Math. Oper. Res. 46(2), 642\u2013673 (2021)","journal-title":"Math. Oper. Res."},{"key":"4_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"566","DOI":"10.1007\/978-3-540-92185-1_63","volume-title":"Internet and Network Economics","author":"Y Zhou","year":"2008","unstructured":"Zhou, Y., Chakrabarty, D., Lukose, R.: Budget constrained bidding in keyword auctions and online knapsack problems. In: Papadimitriou, C., Zhang, S. (eds.) WINE 2008. LNCS, vol. 5385, pp. 566\u2013576. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-92185-1_63"}],"container-title":["Lecture Notes in Computer Science","Approximation and Online Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-18367-6_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,10,20]],"date-time":"2022-10-20T16:06:39Z","timestamp":1666281999000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-18367-6_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031183669","9783031183676"],"references-count":30,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-18367-6_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"21 October 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"WAOA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Workshop on Approximation and Online Algorithms","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Potsdam","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Germany","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8 September 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"9 September 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"waoa2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/algo2022.eu\/waoa\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Easychair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"21","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"12","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"57% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}