{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T03:24:11Z","timestamp":1740108251237,"version":"3.37.3"},"reference-count":27,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2020,7,9]],"date-time":"2020-07-09T00:00:00Z","timestamp":1594252800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,7,9]],"date-time":"2020-07-09T00:00:00Z","timestamp":1594252800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001659","name":"Deutsche Forschungsgemeinschaft","doi-asserted-by":"publisher","award":["CRC 1283"],"award-info":[{"award-number":["CRC 1283"]}],"id":[{"id":"10.13039\/501100001659","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100005721","name":"Universit\u00e4t Bielefeld","doi-asserted-by":"publisher","award":["ZiF Research group: Robust Finance"],"award-info":[{"award-number":["ZiF Research group: Robust Finance"]}],"id":[{"id":"10.13039\/501100005721","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Math Meth Oper Res"],"published-print":{"date-parts":[[2020,12]]},"DOI":"10.1007\/s00186-020-00719-5","type":"journal-article","created":{"date-parts":[[2020,7,9]],"date-time":"2020-07-09T15:10:46Z","timestamp":1594307446000},"page":"435-460","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Robust best choice problem"],"prefix":"10.1007","volume":"92","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-5356-7850","authenticated-orcid":false,"given":"Lazar","family":"Obradovi\u0107","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,7,9]]},"reference":[{"issue":"3","key":"719_CR1","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1111\/1467-9965.00068","volume":"9","author":"P Artzner","year":"1999","unstructured":"Artzner P, Delbaen F, Eber JM, Heath D (1999) Coherent measures of risk. Math Finance 9(3):203\u2013228","journal-title":"Math Finance"},{"issue":"2","key":"719_CR2","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1399589.1399596","volume":"7","author":"M Babaioff","year":"2008","unstructured":"Babaioff M, Immorlica N, Kempe D, Kleinberg R (2008) Online auctions and generalized secretary problems. ACM SIGecom Exchanges 7(2):1\u201311","journal-title":"ACM SIGecom Exchanges"},{"issue":"2","key":"719_CR3","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1016\/0304-4149(78)90057-1","volume":"6","author":"T Bojdecki","year":"1978","unstructured":"Bojdecki T (1978) On optimal stopping of a sequence of independent random variables\u2014probability maximizing approach. Stoch Process Appl 6(2):153\u2013163","journal-title":"Stoch Process Appl"},{"issue":"3","key":"719_CR4","first-page":"177","volume":"1","author":"G Campbell","year":"1982","unstructured":"Campbell G (1982) The maximum of a sequence with prior information. Seq Anal 1(3):177\u2013191","journal-title":"Seq Anal"},{"issue":"1","key":"719_CR5","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1007\/s00199-012-0715-1","volume":"54","author":"T Chudjakow","year":"2013","unstructured":"Chudjakow T, Riedel F (2013) The best choice problem under ambiguity. Econ Theory 54(1):77\u201397","journal-title":"Econ Theory"},{"issue":"4","key":"719_CR6","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1016\/S1364-6613(03)00055-X","volume":"7","author":"S Dehaene","year":"2003","unstructured":"Dehaene S (2003) The neural basis of the weber-fechner law: a logarithmic mental number line. Trends Cognit Sci 7(4):145\u2013147","journal-title":"Trends Cognit Sci"},{"issue":"3","key":"719_CR7","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\u2013289","journal-title":"Stat Sci"},{"key":"719_CR8","doi-asserted-by":"publisher","DOI":"10.1515\/9783110218053","volume-title":"Stochastic finance: an introduction in discrete time","author":"H F\u00f6llmer","year":"2011","unstructured":"F\u00f6llmer H, Schied A (2011) Stochastic finance: an introduction in discrete time. Walter de Gruyter, Berlin"},{"issue":"2","key":"719_CR9","doi-asserted-by":"publisher","first-page":"189","DOI":"10.2307\/1402748","volume":"51","author":"P Freeman","year":"1983","unstructured":"Freeman P (1983) The secretary problem and its extensions: a review. Int Stat Rev 51(2):189\u2013206","journal-title":"Int Stat Rev"},{"issue":"313","key":"719_CR10","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(313):35\u201373","journal-title":"J Am Stat Assoc"},{"issue":"2","key":"719_CR11","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1016\/0304-4068(89)90018-9","volume":"18","author":"I Gilboa","year":"1989","unstructured":"Gilboa I, Schmeidler D (1989) Maxmin expected utility with non-unique prior. J Math Econ 18(2):141\u2013153","journal-title":"J Math Econ"},{"issue":"3\u20134","key":"719_CR12","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1080\/17442500600893027","volume":"79","author":"A Gnedin","year":"2007","unstructured":"Gnedin A (2007) Recognising the last record of sequence. Stoch Int J Probab Stoch Process 79(3\u20134):199\u2013209","journal-title":"Stoch Int J Probab Stoch Process"},{"key":"719_CR13","doi-asserted-by":"publisher","DOI":"10.1002\/0471725250","volume-title":"Robust statistics","author":"PJ Huber","year":"1981","unstructured":"Huber PJ (1981) Robust statistics. Wiley, New-York"},{"issue":"2","key":"719_CR14","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1007\/s00186-017-0594-0","volume":"86","author":"M Kuchta","year":"2017","unstructured":"Kuchta M (2017) Iterated full information secretary problem. Math Methods Oper Res 86(2):277\u2013292","journal-title":"Math Methods Oper Res"},{"key":"719_CR15","volume-title":"Stochastic dominance: investment decision making under uncertainty","author":"H Levy","year":"2015","unstructured":"Levy H (2015) Stochastic dominance: investment decision making under uncertainty. Springer, Berlin"},{"issue":"6","key":"719_CR16","doi-asserted-by":"publisher","first-page":"1447","DOI":"10.1111\/j.1468-0262.2006.00716.x","volume":"74","author":"F Maccheroni","year":"2006","unstructured":"Maccheroni F, Marinacci M, Rustichini A (2006) Ambiguity aversion, robustness, and the variational representation of preferences. Econometrica 74(6):1447\u20131498","journal-title":"Econometrica"},{"issue":"3","key":"719_CR17","doi-asserted-by":"publisher","first-page":"351","DOI":"10.1080\/15326340701470937","volume":"23","author":"M Parlar","year":"2007","unstructured":"Parlar M, Perry D, Stadje W (2007) Optimal shopping when the sales are on\u2014a markovian full-information best-choice problem. Stoch Models 23(3):351\u2013371","journal-title":"Stoch Models"},{"issue":"5","key":"719_CR18","doi-asserted-by":"publisher","first-page":"1171","DOI":"10.1214\/aos\/1176345156","volume":"8","author":"JD Petruccelli","year":"1980","unstructured":"Petruccelli JD (1980) On a best choice problem with partial information. Ann Stat 8(5):1171\u20131174","journal-title":"Ann Stat"},{"issue":"2","key":"719_CR19","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1016\/0304-4149(87)90020-2","volume":"24","author":"Z Porosi\u0144ski","year":"1987","unstructured":"Porosi\u0144ski Z (1987) The full-information best choice problem with a random number of observations. Stoch Process Appl 24(2):293\u2013307","journal-title":"Stoch Process Appl"},{"key":"719_CR20","unstructured":"Research W (2015) Mathematica 10.3"},{"issue":"2","key":"719_CR21","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1016\/j.spa.2004.03.004","volume":"112","author":"F Riedel","year":"2004","unstructured":"Riedel F (2004) Dynamic coherent risk measures. Stoch Process Appl 112(2):185\u2013200","journal-title":"Stoch Process Appl"},{"issue":"3","key":"719_CR22","doi-asserted-by":"publisher","first-page":"857","DOI":"10.3982\/ECTA7594","volume":"77","author":"F Riedel","year":"2009","unstructured":"Riedel F (2009) Optimal stopping with multiple priors. Econometrica 77(3):857\u2013908","journal-title":"Econometrica"},{"key":"719_CR23","unstructured":"Samuels S (1982) Exact solutions for the full information best choice problem. Stat Dept Mimea Ser 82\u201317"},{"issue":"373","key":"719_CR24","doi-asserted-by":"publisher","first-page":"188","DOI":"10.1080\/01621459.1981.10477627","volume":"76","author":"SM Samuels","year":"1981","unstructured":"Samuels SM (1981) Minimax stopping rules when the underlying distribution is uniform. J Am Stat Assoc 76(373):188\u2013197","journal-title":"J Am Stat Assoc"},{"issue":"2","key":"719_CR25","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s00186-019-00666-w","volume":"90","author":"M Skarupski","year":"2019","unstructured":"Skarupski M (2019) Full-information best choice game with hint. Math Methods Oper Res 90(2):1\u201316","journal-title":"Math Methods Oper Res"},{"issue":"3","key":"719_CR26","doi-asserted-by":"publisher","first-page":"718","DOI":"10.2307\/3214010","volume":"23","author":"M Tamaki","year":"1986","unstructured":"Tamaki M (1986) A full-information best-choice problem with finite memory. J Appl Probabil 23(3):718\u2013735","journal-title":"J Appl Probabil"},{"issue":"4","key":"719_CR27","doi-asserted-by":"publisher","first-page":"1086","DOI":"10.1239\/jap\/1261670690","volume":"46","author":"M Tamaki","year":"2009","unstructured":"Tamaki M (2009) Optimal choice of the best available applicant in full-information models. J Appl Probab 46(4):1086\u20131099","journal-title":"J Appl Probab"}],"container-title":["Mathematical Methods of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00186-020-00719-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00186-020-00719-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00186-020-00719-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,7,8]],"date-time":"2021-07-08T23:16:25Z","timestamp":1625786185000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00186-020-00719-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,7,9]]},"references-count":27,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2020,12]]}},"alternative-id":["719"],"URL":"https:\/\/doi.org\/10.1007\/s00186-020-00719-5","relation":{},"ISSN":["1432-2994","1432-5217"],"issn-type":[{"type":"print","value":"1432-2994"},{"type":"electronic","value":"1432-5217"}],"subject":[],"published":{"date-parts":[[2020,7,9]]},"assertion":[{"value":"6 August 2019","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"1 June 2020","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"9 July 2020","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}