{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,7]],"date-time":"2025-11-07T13:38:54Z","timestamp":1762522734610,"version":"3.40.3"},"publisher-location":"Cham","reference-count":16,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031069000"},{"type":"electronic","value":"9783031069017"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-3-031-06901-7_32","type":"book-chapter","created":{"date-parts":[[2022,5,27]],"date-time":"2022-05-27T00:22:30Z","timestamp":1653610950000},"page":"429-439","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["The Secretary Problem with\u00a0Distributions"],"prefix":"10.1007","author":[{"given":"Pranav","family":"Nuti","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,5,27]]},"reference":[{"issue":"313","key":"32_CR1","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1080\/01621459.1966.10502008","volume":"61","author":"J Gilbert","year":"1966","unstructured":"Gilbert, J., Mosteller, F.: Recognizing the maximum of a sequence. J. Am. Stat. Assoc. 61(313), 35\u201373 (1966)","journal-title":"J. Am. Stat. Assoc."},{"unstructured":"Samuels, S.: Exact solutions for the full information best choice problem. Purdue Univ. Stat. Dept. Mimeo Ser., 82\u201317 (1982)","key":"32_CR2"},{"doi-asserted-by":"crossref","unstructured":"Pemantle, R.: Towards a theory of negative dependence, pp. 1371\u20131390 (2000)","key":"32_CR3","DOI":"10.1063\/1.533200"},{"unstructured":"Kahn, J., Neiman, M.: Conditional negative association for competing urns (2010). arXiv: 1001.0610 [math.PR]","key":"32_CR4"},{"doi-asserted-by":"crossref","unstructured":"Correa, J., Foncea, P., Hoeksma, R., Oosterwijk, T., Vredeveld, T.: Posted price mechanisms for a random stream of customers. In: Proceedings of the 2017 ACM Conference on Economics and Computation, EC 2017, pp. 169\u2013186. Association for Computing Machinery, Cambridge (2017)","key":"32_CR5","DOI":"10.1145\/3033274.3085137"},{"issue":"3","key":"32_CR6","doi-asserted-by":"publisher","first-page":"1685","DOI":"10.1137\/15M1029394","volume":"31","author":"H Esfandiari","year":"2017","unstructured":"Esfandiari, H., Hajiaghayi, M., Liaghat, V., Monemizadeh, M.: Prophet secretary. SIAM J. Disc. Math. 31(3), 1685\u20131701 (2017)","journal-title":"SIAM J. Disc. Math."},{"doi-asserted-by":"crossref","unstructured":"Azar, Y., Chiplunkar, A., Kaplan, H.: Prophet secretary: surpassing the 1\u20131\/e barrier. In: Proceedings of the 2018 ACM Conference on Economics and Computation, EC 2018, pp. 303\u2013318. Association for Computing Machinery, Ithaca (2018)","key":"32_CR7","DOI":"10.1145\/3219166.3219182"},{"issue":"1","key":"32_CR8","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1145\/3331033.3331039","volume":"17","author":"J Correa","year":"2019","unstructured":"Correa, J., Foncea, P., Hoeksma, R., Oosterwijk, T., Vredeveld, T.: Recent developments in prophet inequalities. SIGecom Exch. 17(1), 61\u201370 (2019)","journal-title":"SIGecom Exch."},{"doi-asserted-by":"crossref","unstructured":"Correa, J., Saona, R., Ziliotto, B.: Prophet secretary through blind strategies. In: Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2019, pp. 1946\u20131961. Society for Industrial and Applied Mathematics, San Diego (2019)","key":"32_CR9","DOI":"10.1137\/1.9781611975482.118"},{"doi-asserted-by":"crossref","unstructured":"Arsenis, M., Drosis, O., Kleinberg, R.: Constrained-Order Prophet Inequalities. CoRR abs\/2010.09705 (2020)","key":"32_CR10","DOI":"10.1137\/1.9781611976465.121"},{"unstructured":"Correa, J.R., Cristi, A., Epstein, B., Soto, J.A.: Sample-driven optimal stopping: from the secretary problem to the i.i.d. prophet inequality. CoRR abs\/2011.06516 (2020)","key":"32_CR11"},{"doi-asserted-by":"crossref","unstructured":"Correa, J.R., Cristi, A., Epstein, B., Soto, J.A.: The two-sided game of googol and sample-based prophet inequalities. In: SODA, pp. 2066\u20132081 (2020)","key":"32_CR12","DOI":"10.1137\/1.9781611975994.127"},{"unstructured":"Esfandiari, H., Hajiaghayi, M., Lucier, B., Mitzenmacher, M.: Prophets, secretaries, and maximizing the probability of choosing the best. In: Chiappa, S., Calandra, R. (eds.) Proceedings of the Twenty Third International Conference on Artificial Intelligence and Statistics. Proceedings of Machine Learning Research, pp. 3717\u20133727. PMLR (2020)","key":"32_CR13"},{"unstructured":"Rubinstein, A., Wang, J.Z., Weinberg, S.M.: Optimal single-choice prophet inequalities from samples. In: Vidick, T. (ed.) 11th Innovations in Theoretical Computer Science Conference (ITCS 2020), Leibniz International Proceedings in Informatics (LIPIcs), 60:1\u201360:10. Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik, Dagstuhl (2020)","key":"32_CR14"},{"doi-asserted-by":"crossref","unstructured":"Correa, J., Cristi, A., Feuilloley, L., Oosterwijk, T., Tsigonias-Dimitriadis, A.: The secretary problem with independent sampling. In: Proceedings of the Thirty-Second Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 2047\u20132058. Society for Industrial and Applied Mathematics, USA 2021","key":"32_CR15","DOI":"10.1137\/1.9781611976465.122"},{"unstructured":"http:\/\/www.stat.yale.edu\/~yw562\/teaching\/itlectures.pdf","key":"32_CR16"}],"container-title":["Lecture Notes in Computer Science","Integer Programming and Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-06901-7_32","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,11,22]],"date-time":"2023-11-22T07:56:47Z","timestamp":1700639807000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-06901-7_32"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031069000","9783031069017"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-06901-7_32","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"27 May 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"IPCO","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Integer Programming and Combinatorial Optimization","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Eindhoven","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"The Netherlands","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27 June 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29 June 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ipco2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.ipco2022.com\/home","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"93","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"33","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"35% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"33","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}