{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,9]],"date-time":"2025-11-09T07:44:30Z","timestamp":1762674270327,"version":"3.37.3"},"reference-count":17,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2018,9,19]],"date-time":"2018-09-19T00:00:00Z","timestamp":1537315200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2019,5]]},"DOI":"10.1007\/s10878-018-0349-8","type":"journal-article","created":{"date-parts":[[2018,9,19]],"date-time":"2018-09-19T06:44:16Z","timestamp":1537339456000},"page":"1216-1236","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["A new look at the returning secretary problem"],"prefix":"10.1007","volume":"37","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-7954-4067","authenticated-orcid":false,"given":"J. M. Grau","family":"Ribas","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,9,19]]},"reference":[{"issue":"3","key":"349_CR1","doi-asserted-by":"publisher","first-page":"703","DOI":"10.1007\/s10878-017-0203-4","volume":"35","author":"L Bay\u00f3n","year":"2017","unstructured":"Bay\u00f3n L, Fortuny P, Grau JM, Oller-Marc\u00e9n AM, Ruiz MM (2017) The best-or-worst and the postdoc problems. J Comb Optim 35(3):703\u2013723","journal-title":"J Comb Optim"},{"key":"349_CR2","unstructured":"Babaioff M, Immorlica N, Kleinberg R (2007) Matroids, secretary problems, and online mechanisms. In: Proceedings of SODA, pp 434\u2013443"},{"key":"349_CR3","doi-asserted-by":"publisher","first-page":"58","DOI":"10.1016\/j.jmp.2005.11.003","volume":"50","author":"JN Bearden","year":"2006","unstructured":"Bearden JN (2006) A new secretary problem with rank-based selection and cardinal payoffs. J Math Psychol 50:58\u201359","journal-title":"J Math Psychol"},{"key":"349_CR4","first-page":"627","volume":"4","author":"EB Dynkin","year":"1963","unstructured":"Dynkin EB (1963) the optimum choice of the instant for stopping a markov process. Sov Math Dokl 4:627\u2013629","journal-title":"Sov Math Dokl"},{"issue":"3","key":"349_CR5","doi-asserted-by":"publisher","first-page":"282","DOI":"10.1214\/ss\/1177012493","volume":"4","author":"TS Ferguson","year":"1989","unstructured":"Ferguson TS (1989) Who solved the secretary problem? Stat Sci 4(3):282\u2013296","journal-title":"Stat Sci"},{"key":"349_CR6","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1090\/conm\/125\/1160608","volume-title":"Contemporary mathematics: strategies for sequential search and selection in real time","author":"TS Ferguson","year":"1991","unstructured":"Ferguson TS, Hardwick JP, Tamaki M (1991) Maximizing the duration of owning a relatively best object. In: Ferguson T, Samuels S (eds) Contemporary mathematics: strategies for sequential search and selection in real time, vol 125. American Mathematics Association, Washington, pp 37\u201358"},{"key":"349_CR7","doi-asserted-by":"publisher","first-page":"504","DOI":"10.1214\/ECP.v15-1579","volume":"15","author":"R Freij","year":"2010","unstructured":"Freij R, Wastlund J (2010) Partially ordered secretaries. Electron Commun Probab 15:504\u2013507","journal-title":"Electron Commun Probab"},{"key":"349_CR8","unstructured":"Garrod B (2011) Problems of optimal choice on posets and generalizations of acyclic colourings. PhD Thesis"},{"issue":"4","key":"349_CR9","doi-asserted-by":"publisher","first-page":"429","DOI":"10.1002\/rsa.20466","volume":"43","author":"B Garrod","year":"2012","unstructured":"Garrod B, Morris R (2012) The secretary problem on an unknown poset. Random Struct Algorithms 43(4):429\u2013451","journal-title":"Random Struct Algorithms"},{"issue":"1","key":"349_CR10","doi-asserted-by":"publisher","first-page":"384","DOI":"10.1137\/09076845X","volume":"26","author":"B Garrod","year":"2012","unstructured":"Garrod B, Kubicki G, Morayne M (2012) How to choose the best twins. Siam J Discrete Math 26(1):384\u2013398","journal-title":"Siam J Discrete Math"},{"key":"349_CR11","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1002\/rsa.20192","volume":"32","author":"N Georgiou","year":"2008","unstructured":"Georgiou N, Kuchta M, Morayne M, Niemiec J (2008) On a universal best choice algorithm for partially ordered sets. Random Struct Algorithms 32:263\u2013273","journal-title":"Random Struct Algorithms"},{"key":"349_CR12","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1080\/01621459.1966.10502008","volume":"61","author":"J Gilbert","year":"1966","unstructured":"Gilbert J, Mosteller F (1966) Recognizing the maximum of a sequence. J Am Stat Assoc 61:35\u201373","journal-title":"J Am Stat Assoc"},{"issue":"1","key":"349_CR13","first-page":"39","volume":"10","author":"DV Lindley","year":"1961","unstructured":"Lindley DV (1961) Dynamic programming and decision theory. J R Stat Soc Ser C (Appl Stat) 10(1):39\u201351","journal-title":"J R Stat Soc Ser C (Appl Stat)"},{"key":"349_CR14","doi-asserted-by":"crossref","unstructured":"Soto JA (2011) Matroid secretary problem in the random assignment model. In: Proceedings of SODA, pp 1275\u20131284","DOI":"10.1137\/1.9781611973082.97"},{"issue":"2","key":"349_CR15","first-page":"285","volume":"69","author":"KA Szajowski","year":"2009","unstructured":"Szajowski KA (2009) A rank-based selection with cardinal payoffs and a cost of choice. Sci Math Jpn 69(2):285\u2013293","journal-title":"Sci Math Jpn"},{"key":"349_CR16","unstructured":"Vardi S (2014) The secretary returns. \n                    arXiv:1404.0614"},{"key":"349_CR17","unstructured":"Vardi S (2015) The returning secretary. In: 32nd International symposium on theoretical aspects of computer science (STACS 2015), Leibniz international proceedings in informatics (LIPIcs), pp 716\u2013729"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-018-0349-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-018-0349-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-018-0349-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,18]],"date-time":"2019-09-18T19:11:07Z","timestamp":1568833867000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-018-0349-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,9,19]]},"references-count":17,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2019,5]]}},"alternative-id":["349"],"URL":"https:\/\/doi.org\/10.1007\/s10878-018-0349-8","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"type":"print","value":"1382-6905"},{"type":"electronic","value":"1573-2886"}],"subject":[],"published":{"date-parts":[[2018,9,19]]},"assertion":[{"value":"19 September 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}