{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T08:28:19Z","timestamp":1743064099251,"version":"3.40.3"},"publisher-location":"Cham","reference-count":16,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031757747"},{"type":"electronic","value":"9783031757754"}],"license":[{"start":{"date-parts":[[2024,11,13]],"date-time":"2024-11-13T00:00:00Z","timestamp":1731456000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,11,13]],"date-time":"2024-11-13T00:00:00Z","timestamp":1731456000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2025]]},"DOI":"10.1007\/978-3-031-75775-4_2","type":"book-chapter","created":{"date-parts":[[2024,11,12]],"date-time":"2024-11-12T07:26:49Z","timestamp":1731396409000},"page":"18-45","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Algorithms for\u00a0Robbins\u2019 Problem Using Markov Decision Processes"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-7748-7716","authenticated-orcid":false,"given":"L\u00e9onard","family":"Brice","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"F. Thomas","family":"Bruss","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4793-1892","authenticated-orcid":false,"given":"Anirban","family":"Majumdar","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3673-1097","authenticated-orcid":false,"given":"Jean-Fran\u00e7ois","family":"Raskin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,11,13]]},"reference":[{"issue":"3","key":"2_CR1","doi-asserted-by":"publisher","first-page":"828","DOI":"10.2307\/1428183","volume":"28","author":"D Assaf","year":"1996","unstructured":"Assaf, D., Samuel-Cahn, E.: The secretary problem: minimizing the expected rank with iid random variables. Adv. Appl. Probab. 28(3), 828\u2013852 (1996)","journal-title":"Adv. Appl. Probab."},{"key":"2_CR2","unstructured":"Baier, C., Katoen, J.: Principles of model checking. MIT Press (2008)"},{"issue":"1","key":"2_CR3","doi-asserted-by":"publisher","first-page":"108","DOI":"10.1239\/jap\/1110381374","volume":"42","author":"FT Bruss","year":"2005","unstructured":"Bruss, F.T.: What is known about Robbins\u2019 problem? J. Appl. Probab. 42(1), 108\u2013120 (2005)","journal-title":"J. Appl. Probab."},{"key":"2_CR4","doi-asserted-by":"crossref","unstructured":"Bruss, F.T.: Mathematical intuition, deep learning, and Robbins\u2019 problem. Jahresbericht der Deutschen Mathematiker-Vereinigung, pp. 1\u201325 (2024)","DOI":"10.1365\/s13291-024-00277-3"},{"issue":"3","key":"2_CR5","doi-asserted-by":"publisher","first-page":"616","DOI":"10.2307\/3214770","volume":"30","author":"FT Bruss","year":"1993","unstructured":"Bruss, F.T., Ferguson, T.S.: Minimizing the expected rank with full information. J. Appl. Probab. 30(3), 616\u2013626 (1993)","journal-title":"J. Appl. Probab."},{"key":"2_CR6","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-1-4612-0749-8_1","volume-title":"Athens Conference on Applied Probability and Time Series Analysis","author":"FT Bruss","year":"1996","unstructured":"Bruss, F.T., Ferguson, T.S.: Half-prophets and robbins\u2019 problem of minimizing the expected rank. In: Heyde, C.C., Prohorov, Y.V., Pyke, R., Rachev, S.T. (eds.) Athens Conference on Applied Probability and Time Series Analysis, pp. 1\u201317. Springer New York, New York, NY (1996). https:\/\/doi.org\/10.1007\/978-1-4612-0749-8_1"},{"issue":"1","key":"2_CR7","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1239\/jap\/1238592113","volume":"46","author":"FT Bruss","year":"2009","unstructured":"Bruss, F.T., Swan, Y.C.: A continuous-time approach to Robbins\u2019 problem of minimizing the expected rank. J. Appl. Probab. 46(1), 1\u201318 (2009)","journal-title":"J. Appl. Probab."},{"key":"2_CR8","doi-asserted-by":"crossref","unstructured":"Chow, Y.S., Moriguti, S., Robbins, H., Samuels, S.M.: Optimal selection based on relative rank (the \u201csecretary problem\u201d). Israel J. Math. 2(2), 81\u201390 (1964)","DOI":"10.1007\/BF02759948"},{"key":"2_CR9","doi-asserted-by":"publisher","first-page":"592","DOI":"10.1007\/978-3-319-63390-9_31","volume-title":"Computer Aided Verification: 29th International Conference, CAV 2017, Heidelberg, Germany, July 24-28, 2017, Proceedings, Part II","author":"C Dehnert","year":"2017","unstructured":"Dehnert, C., Junges, S., Katoen, J.-P., Volk, M.: A storm is coming: a modern probabilistic model checker. In: Majumdar, R., Kun\u010dak, V. (eds.) Computer Aided Verification: 29th International Conference, CAV 2017, Heidelberg, Germany, July 24-28, 2017, Proceedings, Part II, pp. 592\u2013600. Springer International Publishing, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-63390-9_31"},{"issue":"1","key":"2_CR10","doi-asserted-by":"publisher","first-page":"135","DOI":"10.14708\/ma.v44i1.1138","volume":"44","author":"R Dendievel","year":"2016","unstructured":"Dendievel, R., Swan, Y.: One step more in Robbins\u2019 problem: Explicit solution for the case n = 4. Mathematica Applicanda 44(1), 135\u2013148 (2016)","journal-title":"Mathematica Applicanda"},{"issue":"313","key":"2_CR11","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1080\/01621459.1966.10502008","volume":"61","author":"JP Gilbert","year":"1966","unstructured":"Gilbert, J.P., Mosteller, F.: Recognizing the maximum of a sequence. J. Am. Stat. Assoc. 61(313), 35\u201373 (1966)","journal-title":"J. Am. Stat. Assoc."},{"issue":"4","key":"2_CR12","doi-asserted-by":"publisher","first-page":"996","DOI":"10.1239\/jap\/1197908820","volume":"44","author":"AV Gnedin","year":"2007","unstructured":"Gnedin, A.V.: Optimal stopping with rank-dependent loss. J. Appl. Probab. 44(4), 996\u20131011 (2007)","journal-title":"J. Appl. Probab."},{"key":"2_CR13","doi-asserted-by":"publisher","first-page":"200","DOI":"10.1007\/3-540-46029-2_13","volume-title":"Computer Performance Evaluation: Modelling Techniques and Tools","author":"M Kwiatkowska","year":"2002","unstructured":"Kwiatkowska, M., Norman, G., Parker, D.: PRISM: probabilistic symbolic model checker. In: Field, T., Harrison, P.G., Bradley, J., Harder, U. (eds.) Computer Performance Evaluation: Modelling Techniques and Tools, pp. 200\u2013204. Springer Berlin Heidelberg, Berlin, Heidelberg (2002). https:\/\/doi.org\/10.1007\/3-540-46029-2_13"},{"issue":"1","key":"2_CR14","first-page":"39","volume":"10","author":"DV Lindley","year":"1961","unstructured":"Lindley, D.V.: Dynamic programming and decision theory. J. Roy. Stat. Soc.: Ser. C (Appl. Stat.) 10(1), 39\u201351 (1961)","journal-title":"J. Roy. Stat. Soc.: Ser. C (Appl. Stat.)"},{"issue":"1","key":"2_CR15","doi-asserted-by":"publisher","first-page":"331","DOI":"10.1017\/jpr.2016.103","volume":"54","author":"M Meier","year":"2017","unstructured":"Meier, M., S\u00f6gner, L.: A new strategy for Robbins\u2019 problem of optimal stopping. J. Appl. Probab. 54(1), 331\u2013336 (2017)","journal-title":"J. Appl. Probab."},{"key":"2_CR16","doi-asserted-by":"crossref","unstructured":"Puterman, M.L.: Markov Decision Processes: Discrete Stochastic Dynamic Programming. Wiley Series in Probability and Statistics, Wiley (1994)","DOI":"10.1002\/9780470316887"}],"container-title":["Lecture Notes in Computer Science","Principles of Verification: Cycling the Probabilistic Landscape"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-75775-4_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,11,12]],"date-time":"2024-11-12T08:02:46Z","timestamp":1731398566000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-75775-4_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,11,13]]},"ISBN":["9783031757747","9783031757754"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-75775-4_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2024,11,13]]},"assertion":[{"value":"13 November 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}