{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,1]],"date-time":"2025-10-01T16:25:32Z","timestamp":1759335932075,"version":"3.40.3"},"publisher-location":"Cham","reference-count":24,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030895426"},{"type":"electronic","value":"9783030895433"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"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":[[2021]]},"DOI":"10.1007\/978-3-030-89543-3_46","type":"book-chapter","created":{"date-parts":[[2021,10,21]],"date-time":"2021-10-21T02:03:25Z","timestamp":1634781805000},"page":"553-564","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["The Secretary Problem with Reservation Costs"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-6161-7440","authenticated-orcid":false,"given":"Elisabet","family":"Burjons","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9595-2992","authenticated-orcid":false,"given":"Matthias","family":"Gehnen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5013-8831","authenticated-orcid":false,"given":"Henri","family":"Lotze","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0011-6754","authenticated-orcid":false,"given":"Daniel","family":"Mock","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0177-8028","authenticated-orcid":false,"given":"Peter","family":"Rossmanith","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,10,20]]},"reference":[{"key":"46_CR1","doi-asserted-by":"publisher","unstructured":"Albers, S., Ladewig, L.: New results for the $$k$$-secretary problem. In: 30th International Symposium on Algorithms and Computation, ISAAC. LIPIcs, vol. 149, pp. 18:1\u201318:19 (2019). https:\/\/doi.org\/10.4230\/LIPIcs.ISAAC.2019.18","DOI":"10.4230\/LIPIcs.ISAAC.2019.18"},{"key":"46_CR2","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":"46_CR3","doi-asserted-by":"publisher","unstructured":"Babaioff, M., Immorlica, N., Kempe, D., Kleinberg, R.: Online auctions and generalized secretary problems. SIGecom Exch. 7(2), (2008). https:\/\/doi.org\/10.1145\/1399589.1399596","DOI":"10.1145\/1399589.1399596"},{"issue":"4","key":"46_CR4","doi-asserted-by":"publisher","first-page":"505","DOI":"10.1142\/S0129054118410034","volume":"29","author":"MP Bianchi","year":"2018","unstructured":"Bianchi, M.P., B\u00f6ckenhauer, H.-J., Br\u00fclisauer, T., Komm, D., Palano, B.: Online minimum spanning tree with advice. Int. J. Found. Comput. Sci. 29(4), 505\u2013527 (2018). https:\/\/doi.org\/10.1142\/S0129054118410034","journal-title":"Int. J. Found. Comput. Sci."},{"key":"46_CR5","doi-asserted-by":"publisher","first-page":"22","DOI":"10.1016\/j.tcs.2014.06.027","volume":"554","author":"MP Bianchi","year":"2014","unstructured":"Bianchi, M.P., B\u00f6ckenhauer, H.-J., Hromkovi\u010d, J., Krug, S., Steffen, B.: On the advice complexity of the online $$L(2,1)$$-coloring problem on paths and cycles. Theor. Comput. Sci. 554, 22\u201339 (2014). https:\/\/doi.org\/10.1016\/j.tcs.2014.06.027","journal-title":"Theor. Comput. Sci."},{"key":"46_CR6","doi-asserted-by":"publisher","unstructured":"B\u00f6ckenhauer, H.-J., Burjons, E., Hromkovi\u010d, J., Lotze, H., Rossmanith, P.: Online simple knapsack with reservation costs. In: 38th International Symposium on Theoretical Aspects of Computer Science, STACS 2021. LIPIcs, vol. 187, pp. 16:1\u201316:18 (2021). https:\/\/doi.org\/10.4230\/LIPIcs.STACS.2021.16","DOI":"10.4230\/LIPIcs.STACS.2021.16"},{"key":"46_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"747","DOI":"10.1007\/978-3-319-21398-9_58","volume-title":"Computing and Combinatorics","author":"H-J B\u00f6ckenhauer","year":"2015","unstructured":"B\u00f6ckenhauer, H.-J., Dobson, R., Krug, S., Steinh\u00f6fel, K.: On energy-efficient computations with advice. In: Xu, D., Du, D., Du, D. (eds.) COCOON 2015. LNCS, vol. 9198, pp. 747\u2013758. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-21398-9_58"},{"key":"46_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"102","DOI":"10.1007\/978-3-030-04693-4_7","volume-title":"Approximation and Online Algorithms","author":"H-J B\u00f6ckenhauer","year":"2018","unstructured":"B\u00f6ckenhauer, H.-J., Fuchs, J., Unger, W.: Exploring sparse graphs with advice (extended abstract). In: Epstein, L., Erlebach, T. (eds.) WAOA 2018. LNCS, vol. 11312, pp. 102\u2013117. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-030-04693-4_7"},{"key":"46_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"30","DOI":"10.1007\/978-3-642-31644-9_2","volume-title":"Languages Alive","author":"H-J B\u00f6ckenhauer","year":"2012","unstructured":"B\u00f6ckenhauer, H.-J., Hromkovi\u010d, J., Komm, D., Kr\u00e1lovi\u010d, R., Rossmanith, P.: On the power of randomness versus advice in online computation. In: Bordihn, H., Kutrib, M., Truthe, B. (eds.) Languages Alive. LNCS, vol. 7300, pp. 30\u201343. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-31644-9_2"},{"key":"46_CR10","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1016\/j.tcs.2014.06.006","volume":"554","author":"H-J B\u00f6ckenhauer","year":"2014","unstructured":"B\u00f6ckenhauer, H.-J., Hromkovi\u010d, J., Komm, D., Krug, S., Smula, J., Sprock, A.: The string guessing problem as a method to prove lower bounds on the advice complexity. Theor. Comput. Sci. 554, 95\u2013108 (2014). https:\/\/doi.org\/10.1016\/j.tcs.2014.06.006","journal-title":"Theor. Comput. Sci."},{"key":"46_CR11","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1016\/j.tcs.2021.01.022","volume":"862","author":"H-J B\u00f6ckenhauer","year":"2021","unstructured":"B\u00f6ckenhauer, H.-J., Hromkovi\u010d, J., Krug, S., Unger, W.: On the advice complexity of the online dominating set problem. Theor. Comput. Sci. 862, 81\u201396 (2021). https:\/\/doi.org\/10.1016\/j.tcs.2021.01.022","journal-title":"Theor. Comput. Sci."},{"key":"46_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1007\/978-3-642-22006-7_18","volume-title":"Automata, Languages and Programming","author":"H-J B\u00f6ckenhauer","year":"2011","unstructured":"B\u00f6ckenhauer, H.-J., Komm, D., Kr\u00e1lovi\u010d, R., Kr\u00e1lovi\u010d, R.: On the advice complexity of the k-server problem. In: Aceto, L., Henzinger, M., Sgall, J. (eds.) ICALP 2011. LNCS, vol. 6755, pp. 207\u2013218. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-22006-7_18"},{"key":"46_CR13","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1016\/j.ic.2017.03.001","volume":"254","author":"H-J B\u00f6ckenhauer","year":"2017","unstructured":"B\u00f6ckenhauer, H.-J., Komm, D., Kr\u00e1lovi\u010d, R., Kr\u00e1lovi\u010d, R., M\u00f6mke, T.: Online algorithms with advice: the tape model. Inf. Comput. 254, 59\u201383 (2017). https:\/\/doi.org\/10.1016\/j.ic.2017.03.001","journal-title":"Inf. Comput."},{"key":"46_CR14","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\u00e1lovi\u010d, R., Rossmanith, P.: The online knapsack problem: advice and randomization. Theor. Comput. Sci. 527, 61\u201372 (2014). https:\/\/doi.org\/10.1016\/j.tcs.2014.01.027","journal-title":"Theor. Comput. Sci."},{"key":"46_CR15","volume-title":"Online Computation and Competitive Analysis","author":"A Borodin","year":"1998","unstructured":"Borodin, A., El-Yaniv, R.: Online Computation and Competitive Analysis. Cambridge University Press, Cambridge (1998)"},{"issue":"1","key":"46_CR16","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). https:\/\/doi.org\/10.1287\/moor.2013.0604","journal-title":"Math. Oper. Res."},{"key":"46_CR17","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511546921","volume-title":"Prediction, Learning, and Games","author":"N Cesa-Bianchi","year":"2006","unstructured":"Cesa-Bianchi, N., Lugosi, G.: Prediction, Learning, and Games. Cambridge University Press, Cambridge (2006). https:\/\/doi.org\/10.1017\/CBO9780511546921"},{"key":"46_CR18","doi-asserted-by":"publisher","unstructured":"Hubert Chan, T.-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: Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2015, San Diego, CA, USA, 4\u20136 January 2015, pp. 1169\u20131188. SIAM (2015). https:\/\/doi.org\/10.1137\/1.9781611973730.78","DOI":"10.1137\/1.9781611973730.78"},{"key":"46_CR19","unstructured":"Daniely, A., Mansour, Y.: Competitive ratio vs regret minimization: Achieving the best of both worlds. In: Algorithmic Learning Theory, ALT 2019, 22\u201324 March 2019, Chicago, Illinois, USA. Proceedings of Machine Learning Research, vol. 98, pp. 333\u2013368. PMLR (2019)"},{"key":"46_CR20","first-page":"627","volume":"4","author":"EB Dynkin","year":"1963","unstructured":"Dynkin, E.B.: The optimum choice of the instant for stopping a Markov process. Sov. Math. 4, 627\u2013629 (1963)","journal-title":"Sov. Math."},{"key":"46_CR21","unstructured":"Kleinberg, R.D.: A multiple-choice secretary algorithm with applications to online auctions. In: Proceedings of the Sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2005, Vancouver, British Columbia, Canada, 23\u201325 January 2005, pp. 630\u2013631. SIAM (2005)"},{"key":"46_CR22","series-title":"Texts in Theoretical Computer Science. An EATCS Series","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-42749-2","volume-title":"An Introduction to Online Computation - Determinism, Randomization, Advice","author":"D Komm","year":"2016","unstructured":"Komm, D.: An Introduction to Online Computation - Determinism, Randomization, Advice. Texts in Theoretical Computer Science. An EATCS Series, Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-42749-2"},{"key":"46_CR23","doi-asserted-by":"crossref","unstructured":"Lindley, D.V.: Dynamic programming and decision theory. J. R. Stat. Soc. Ser. C (Appl. Stat.) 10(1), 39\u201351 (1961). http:\/\/www.jstor.org\/stable\/2985407","DOI":"10.2307\/2985407"},{"issue":"2","key":"46_CR24","doi-asserted-by":"publisher","first-page":"202","DOI":"10.1145\/2786.2793","volume":"28","author":"DD Sleator","year":"1985","unstructured":"Sleator, D.D., Tarjan, R.E.: Amortized efficiency of list update and paging rules. Commun. ACM 28(2), 202\u2013208 (1985). https:\/\/doi.org\/10.1145\/2786.2793","journal-title":"Commun. ACM"}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-89543-3_46","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,10,21]],"date-time":"2021-10-21T02:20:05Z","timestamp":1634782805000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-89543-3_46"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030895426","9783030895433"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-89543-3_46","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"20 October 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"COCOON","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Computing and Combinatorics Conference","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Tainan","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Taiwan","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24 October 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26 October 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cocoon2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/cocoon-conference.org\/2021\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-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":"131","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":"56","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":"43% - 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.1","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":"2.2","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)"}}]}}