{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,30]],"date-time":"2025-05-30T15:28:21Z","timestamp":1748618901460},"reference-count":15,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2016,6,27]],"date-time":"2016-06-27T00:00:00Z","timestamp":1466985600000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2017,5]]},"DOI":"10.1007\/s10878-016-0050-8","type":"journal-article","created":{"date-parts":[[2016,6,27]],"date-time":"2016-06-27T16:27:55Z","timestamp":1467044875000},"page":"1469-1491","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["The solution of a generalized secretary problem via analytic expressions"],"prefix":"10.1007","volume":"33","author":[{"given":"Adam","family":"Woryna","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,6,27]]},"reference":[{"issue":"1","key":"50_CR1","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1137\/S0895480195290017","volume":"14","author":"M Ajtai","year":"2001","unstructured":"Ajtai M, Megiddo N, Waarts O (2001) Improved algorithms and analysis for secretary problems and generalizations. SIAM J Discret Math 14(1):1\u201327","journal-title":"SIAM J Discret Math"},{"issue":"3","key":"50_CR2","doi-asserted-by":"crossref","first-page":"882","DOI":"10.1214\/aop\/1176993237","volume":"12","author":"FT Bruss","year":"1984","unstructured":"Bruss FT (1984) A unified approach to a class of best choice problems with an unknown number of options. Ann Probab 12(3):882\u2013889","journal-title":"Ann Probab"},{"key":"50_CR3","doi-asserted-by":"crossref","unstructured":"Buchbinder N, Jain K, Singh M (2010) Secretary problems via linear programming. IPCO 2010, LNCS 6080, p 163\u2013176","DOI":"10.1007\/978-3-642-13036-6_13"},{"key":"50_CR4","doi-asserted-by":"crossref","unstructured":"Chan T-H H, Chen F, Jiang SH-C (2015) Revealing optimal thresholds for generalized secretary problem via continuous LP: impacts on online $$K$$ K -item auction and bipartite $$K$$ K -matching with random arrival order. SODA","DOI":"10.1137\/1.9781611973730.78"},{"issue":"02","key":"50_CR5","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1017\/S026996481000032X","volume":"25","author":"C Dietzal","year":"2011","unstructured":"Dietzal C, van der Laan D, Ridder A (2011) Approximate results for a generalized secretary problem. Probab Eng Inf Sci 25(02):157\u2013169","journal-title":"Probab Eng Inf Sci"},{"key":"50_CR6","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4899-5591-3","volume-title":"Markov processes: theorems and problems","author":"EB Dynkin","year":"1969","unstructured":"Dynkin EB, Yushkevich A (1969) Markov processes: theorems and problems, 1st edn. Plenum, New York","edition":"1"},{"key":"50_CR7","doi-asserted-by":"crossref","unstructured":"Feldman M, Tennenholtz M (2012) Interviewing secretaries in parallel. In: Proceedings of the 13th ACM conference on electronic commerce, p 550\u2013567","DOI":"10.1145\/2229012.2229053"},{"key":"50_CR8","doi-asserted-by":"crossref","first-page":"299","DOI":"10.1016\/0304-4149(80)90013-7","volume":"10","author":"AQ Frank","year":"1980","unstructured":"Frank AQ, Samuels SM (1980) On an optimal stopping problem of Gusein-Zade. Stoch Process Appl 10:299\u2013311","journal-title":"Stoch Process Appl"},{"issue":"2","key":"50_CR9","doi-asserted-by":"crossref","first-page":"189","DOI":"10.2307\/1402748","volume":"51","author":"PR Freeman","year":"1983","unstructured":"Freeman PR (1983) The secretary problem and its extensions: a review. Int Stat Rev \/ Rev Int Stat 51(2):189\u2013206","journal-title":"Int Stat Rev \/ Rev Int Stat"},{"key":"50_CR10","doi-asserted-by":"crossref","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":"50_CR11","doi-asserted-by":"crossref","first-page":"472","DOI":"10.1137\/1111050","volume":"11","author":"SM Gusein-Zade","year":"1966","unstructured":"Gusein-Zade SM (1966) The problem of choice and the optimal stopping rule for a sequence of independent trials. Theory Prob Appl 11:472\u2013476","journal-title":"Theory Prob Appl"},{"key":"50_CR12","doi-asserted-by":"crossref","unstructured":"Immorlica N, Kleinberg RD, Mahdian M (2006) Secretary problems with competing employers. In: WINE, p 389\u2013400","DOI":"10.1007\/11944874_35"},{"key":"50_CR13","doi-asserted-by":"crossref","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\u201352","journal-title":"Appl Stat"},{"issue":"3","key":"50_CR14","doi-asserted-by":"crossref","first-page":"630","DOI":"10.1017\/S0021900200100075","volume":"33","author":"MP Quine","year":"1996","unstructured":"Quine MP, Law JS (1996) Exact results for a secretary problem. J Appl Probab 33(3):630\u2013639","journal-title":"J Appl Probab"},{"key":"50_CR15","doi-asserted-by":"crossref","unstructured":"Sun X, Zhang J, Zhang J (2014) Solving multi-choice secretary problem in parallel: an optimal observation-selection protocol. ISAAC, p 661\u2013673","DOI":"10.1007\/978-3-319-13075-0_52"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-016-0050-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-016-0050-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-016-0050-8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-016-0050-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,10]],"date-time":"2019-09-10T08:19:32Z","timestamp":1568103572000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-016-0050-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,6,27]]},"references-count":15,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2017,5]]}},"alternative-id":["50"],"URL":"https:\/\/doi.org\/10.1007\/s10878-016-0050-8","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,6,27]]}}}