{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,12]],"date-time":"2026-05-12T12:07:44Z","timestamp":1778587664810,"version":"3.51.4"},"reference-count":18,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2017,11,16]],"date-time":"2017-11-16T00:00:00Z","timestamp":1510790400000},"content-version":"unspecified","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":[[2018,4]]},"DOI":"10.1007\/s10878-017-0203-4","type":"journal-article","created":{"date-parts":[[2017,11,16]],"date-time":"2017-11-16T09:22:08Z","timestamp":1510824128000},"page":"703-723","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":10,"title":["The Best-or-Worst and the Postdoc problems"],"prefix":"10.1007","volume":"35","author":[{"given":"L.","family":"Bay\u00f3n","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"P.","family":"Fortuny Ayuso","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7954-4067","authenticated-orcid":false,"given":"J. M.","family":"Grau","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8191-3199","authenticated-orcid":false,"given":"A. M.","family":"Oller-Marc\u00e9n","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"M. M.","family":"Ruiz","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,11,16]]},"reference":[{"key":"203_CR1","unstructured":"Babaioff M, Immorlica N, Kleinberg R (2007) Matroids, secretary problems, and online mechanisms. In: Proceedings of the SODA, pp 434\u2013443"},{"key":"203_CR2","doi-asserted-by":"crossref","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":"203_CR3","doi-asserted-by":"crossref","first-page":"42","DOI":"10.1093\/imamat\/1.1.42","volume":"1","author":"DJ Daley","year":"1965","unstructured":"Daley DJ, Kendall DG (1965) Stochastic rumours. J Inst Math Appl 1:42\u201355","journal-title":"J Inst Math Appl"},{"key":"203_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":"203_CR5","doi-asserted-by":"crossref","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":"203_CR6","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1090\/conm\/125\/1160616","volume":"25","author":"TS Ferguson","year":"1992","unstructured":"Ferguson TS (1992) The best-choice problems with dependent criteria. Contemp Math 25:135\u2013151","journal-title":"Contemp Math"},{"key":"203_CR7","first-page":"37","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":"203_CR8","doi-asserted-by":"crossref","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"},{"issue":"4","key":"203_CR9","doi-asserted-by":"crossref","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"},{"key":"203_CR10","doi-asserted-by":"crossref","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":"203_CR11","doi-asserted-by":"crossref","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":"4","key":"203_CR12","doi-asserted-by":"crossref","first-page":"1476","DOI":"10.1137\/100819588","volume":"71","author":"E Lebensztayn","year":"2011","unstructured":"Lebensztayn E, Machado FP, Rodr\u00edguez PM (2011) Limit theorems for a general stochastic rumour model. SIAM J Appl Math 71(4):1476\u20131486","journal-title":"SIAM J Appl Math"},{"issue":"1","key":"203_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)"},{"issue":"1","key":"203_CR14","doi-asserted-by":"crossref","first-page":"172","DOI":"10.1287\/opre.30.1.172","volume":"30","author":"JS Rose","year":"1982","unstructured":"Rose JS (1982) A problem of optimal choice and assignment. Oper Res 30(1):172\u2013181","journal-title":"Oper Res"},{"key":"203_CR15","doi-asserted-by":"crossref","unstructured":"Soto JA (2011) Matroid secretary problem in the random assignment model. In: Proceedings of the SODA, pp 1275\u20131284","DOI":"10.1137\/1.9781611973082.97"},{"key":"203_CR16","first-page":"51","volume":"19","author":"K Szajowski","year":"1982","unstructured":"Szajowski K (1982) Optimal choice problem of a-th object. Mat Stos 19:51\u201365","journal-title":"Mat Stos"},{"issue":"2","key":"203_CR17","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":"203_CR18","unstructured":"Vanderbei RJ (1983) The Postdoc variant of the secretary problem. \n                        http:\/\/www.princeton.edu\/~rvdb\/tex\/PostdocProblem\/PostdocProb.pdf\n                        \n                     (unpublished)"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-017-0203-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-017-0203-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-017-0203-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2018,3,16]],"date-time":"2018-03-16T01:20:41Z","timestamp":1521163241000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-017-0203-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,11,16]]},"references-count":18,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2018,4]]}},"alternative-id":["203"],"URL":"https:\/\/doi.org\/10.1007\/s10878-017-0203-4","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,11,16]]}}}