{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,12]],"date-time":"2026-05-12T12:07:26Z","timestamp":1778587646711,"version":"3.51.4"},"reference-count":27,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2018,12,1]],"date-time":"2018-12-01T00:00:00Z","timestamp":1543622400000},"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,7]]},"DOI":"10.1007\/s10878-018-0367-6","type":"journal-article","created":{"date-parts":[[2018,12,1]],"date-time":"2018-12-01T16:29:53Z","timestamp":1543681793000},"page":"86-110","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["The Best-or-Worst and the Postdoc problems with random number of candidates"],"prefix":"10.1007","volume":"38","author":[{"given":"L.","family":"Bay\u00f3n","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"P.","family":"Fortuny","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"J.","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":[[2018,12,1]]},"reference":[{"key":"367_CR1","unstructured":"Babaioff M, Immorlica N, Kleinberg R (2007) Matroids, secretary problems, and online mechanisms. In: Proceedings of the eighteenth annual ACM-SIAM symposium on discrete algorithms. ACM, New York, pp 434\u2013443"},{"issue":"3","key":"367_CR2","doi-asserted-by":"publisher","first-page":"703","DOI":"10.1007\/s10878-017-0203-4","volume":"35","author":"L Bay\u00f3n","year":"2018","unstructured":"Bay\u00f3n L, Fortuny Ayuso P, Grau JM, Oller-Marc\u00e9n AM, Ruiz MM (2018) The Best-or-Worst and the Postdoc problems. J Comb Optim 35(3):703\u2013723","journal-title":"J Comb Optim"},{"issue":"4","key":"367_CR3","doi-asserted-by":"publisher","first-page":"918","DOI":"10.2307\/3214216","volume":"24","author":"FT Bruss","year":"1987","unstructured":"Bruss FT (1987) On an optimal selection problem of Cowan and Zabczyk. J Appl Probab 24(4):918\u2013928","journal-title":"J Appl Probab"},{"issue":"3","key":"367_CR4","doi-asserted-by":"publisher","first-page":"1384","DOI":"10.1214\/aop\/1019160340","volume":"28","author":"FT Bruss","year":"2000","unstructured":"Bruss FT (2000) Sum the odds to one and stop. Ann Probab 28(3):1384\u20131391","journal-title":"Ann Probab"},{"issue":"4","key":"367_CR5","doi-asserted-by":"publisher","first-page":"1859","DOI":"10.1214\/aop\/1068646368","volume":"31","author":"FT Bruss","year":"2003","unstructured":"Bruss FT (2003) A note on bounds for the odds theorem of optimal stopping. Ann Probab 31(4):1859\u20131861","journal-title":"Ann Probab"},{"issue":"3","key":"367_CR6","first-page":"606","volume":"23","author":"R Cowan","year":"1978","unstructured":"Cowan R, Zabczyk J (1978) An optimal selection problem associated with the Poisson process. Teor Veroyatnost i Primenen 23(3):606\u2013614","journal-title":"Teor Veroyatnost i Primenen"},{"issue":"2","key":"367_CR7","first-page":"111","volume":"38","author":"R Dendievel","year":"2013","unstructured":"Dendievel R (2013) New developments of the odds-theorem. Math Sci 38(2):111\u2013123","journal-title":"Math Sci"},{"key":"367_CR8","doi-asserted-by":"publisher","first-page":"176","DOI":"10.1016\/j.spl.2014.11.002","volume":"97","author":"R Dendievel","year":"2015","unstructured":"Dendievel R (2015) Weber\u2019s optimal stopping problem and generalizations. Stat Probab Lett 97:176\u2013184","journal-title":"Stat Probab Lett"},{"key":"367_CR9","first-page":"238","volume":"150","author":"EB Dynkin","year":"1963","unstructured":"Dynkin EB (1963) Optimal choice of the stopping moment of a Markov process. Dokl Akad Nauk SSSR 150:238\u2013240","journal-title":"Dokl Akad Nauk SSSR"},{"issue":"3","key":"367_CR10","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":"367_CR11","first-page":"135","volume-title":"Proceedings of the AMS-IMS-SIAM joint summer research conference (Amherst, MA, 1990), contemporary mathematics","author":"TS Ferguson","year":"1992","unstructured":"Ferguson TS (1992) Best-choice problems with dependent criteria. Strategies for sequential search and selection in real time. In: Bruss FT, Ferguson TS, Samuels S (eds) Proceedings of the AMS-IMS-SIAM joint summer research conference (Amherst, MA, 1990), contemporary mathematics, vol 125. American Mathematical Society, Providence, RI, pp 135\u2013151"},{"key":"367_CR12","first-page":"37","volume-title":"Proceedings of the AMS-IMS-SIAM joint summer research conference (Amherst, MA, 1990), contemporary mathematics","author":"TS Ferguson","year":"1992","unstructured":"Ferguson TS, Hardwick JP, Tamaki M (1992) Maximizing the duration of owning a relatively best object. Strategies for sequential search and selection in real time. In: Bruss FT, Ferguson TS, Samuels S (eds) Proceedings of the AMS-IMS-SIAM joint summer research conference (Amherst, MA, 1990), contemporary mathematics, vol 125. American Mathematical Society, Providence, RI, pp 37\u201358"},{"key":"367_CR13","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."},{"issue":"4","key":"367_CR14","doi-asserted-by":"publisher","first-page":"429","DOI":"10.1002\/rsa.20466","volume":"43","author":"B Garrod","year":"2013","unstructured":"Garrod B, Morris R (2013) The secretary problem on an unknown poset. Random Struct Algorithms 43(4):429\u2013451","journal-title":"Random Struct Algorithms"},{"key":"367_CR15","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"},{"issue":"4","key":"367_CR16","doi-asserted-by":"publisher","first-page":"472","DOI":"10.1007\/s00453-013-9795-y","volume":"67","author":"SO Gharan","year":"2013","unstructured":"Gharan SO, Vondr\u00e1k J (2013) On Variants of the Matroid Secretary Problem. J Algorithmica 67(4):472\u2013497","journal-title":"J Algorithmica"},{"key":"367_CR17","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1080\/01621459.1966.10502008","volume":"61","author":"JP Gilbert","year":"1966","unstructured":"Gilbert JP, Mosteller F (1966) Recognizing the maximum of a sequence. J Am Stat Assoc 61:35\u201373","journal-title":"J Am Stat Assoc"},{"key":"367_CR18","first-page":"34","volume-title":"Optimal choice. Gamma: exploring Euler\u2019s constant","author":"J Havil","year":"2003","unstructured":"Havil J (2003) Optimal choice. Gamma: exploring Euler\u2019s constant. Princeton University Press, Princeton, pp 34\u2013138"},{"key":"367_CR19","doi-asserted-by":"publisher","first-page":"39","DOI":"10.2307\/2985407","volume":"10","author":"DV Lindley","year":"1961","unstructured":"Lindley DV (1961) Dynamic programming and decision theory. Appl Stat 10:39\u201351","journal-title":"Appl Stat"},{"issue":"2","key":"367_CR20","first-page":"95","volume":"45","author":"G Louchard","year":"2017","unstructured":"Louchard G (2017) A refined and asymptotic analysis of optimal stopping problems of Bruss and Weber. Math Appl 45(2):95\u2013118","journal-title":"Math Appl"},{"issue":"1","key":"367_CR21","doi-asserted-by":"publisher","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":"367_CR22","first-page":"695","volume":"17","author":"\u00c8L Presman","year":"1972","unstructured":"Presman \u00c8L, Sonin IM (1972) The problem of best choice in the case of a random number of objects. Teor Verojatnost i Primenen 17:695\u2013706","journal-title":"Teor Verojatnost i Primenen"},{"issue":"1","key":"367_CR23","doi-asserted-by":"publisher","first-page":"178","DOI":"10.1137\/110852061","volume":"42","author":"JA Soto","year":"2013","unstructured":"Soto JA (2013) Matroid secretary problem in the random-assignment model. Siam J Comput 42(1):178\u2013211","journal-title":"Siam J Comput"},{"key":"367_CR24","first-page":"51","volume":"19","author":"K Szajowski","year":"1982","unstructured":"Szajowski K (1982) Optimal choice problem of a-th object. Matem Stos 19:51\u201365","journal-title":"Matem Stos"},{"issue":"17","key":"367_CR25","doi-asserted-by":"publisher","first-page":"1683","DOI":"10.1016\/j.spl.2007.04.008","volume":"77","author":"K Szajowski","year":"2007","unstructured":"Szajowski K (2007) A game version of the Cowan\u2013Zabczyk\u2013Bruss\u2019 problem. Stat Probab Lett 77(17):1683\u20131689","journal-title":"Stat Probab Lett"},{"issue":"2","key":"367_CR26","first-page":"285","volume":"69","author":"K Szajowski","year":"2009","unstructured":"Szajowski K (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":"367_CR27","unstructured":"Vanderbei RJ (1983) The Postdoc variant of the secretary problem. \n                    http:\/\/www.princeton.edu\/rvdb\/tex\/PostdocProblem\/PostdocProb.pdf\n                    \n                  . Accessed 01 July 2018 (unpublished)"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-018-0367-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-018-0367-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-018-0367-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,12,2]],"date-time":"2019-12-02T07:44:22Z","timestamp":1575272662000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-018-0367-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,12,1]]},"references-count":27,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2019,7]]}},"alternative-id":["367"],"URL":"https:\/\/doi.org\/10.1007\/s10878-018-0367-6","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,12,1]]},"assertion":[{"value":"1 December 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}