{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,4]],"date-time":"2026-03-04T18:32:07Z","timestamp":1772649127998,"version":"3.50.1"},"publisher-location":"Cham","reference-count":27,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783031228315","type":"print"},{"value":"9783031228322","type":"electronic"}],"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.springernature.com\/gp\/researchers\/text-and-data-mining"},{"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.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-3-031-22832-2_7","type":"book-chapter","created":{"date-parts":[[2022,12,8]],"date-time":"2022-12-08T09:05:33Z","timestamp":1670490333000},"page":"115-131","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Optimal Prophet Inequality with\u00a0Less than One Sample"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-3845-947X","authenticated-orcid":false,"given":"Nick","family":"Gravin","sequence":"first","affiliation":[]},{"given":"Hao","family":"Li","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5094-1971","authenticated-orcid":false,"given":"Zhihao Gavin","family":"Tang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,12,9]]},"reference":[{"key":"7_CR1","doi-asserted-by":"crossref","unstructured":"Azar, P.D., Kleinberg, R., Weinberg, S.M.: Prophet inequalities with limited information. In: SODA, pp. 1358\u20131377. SIAM (2014)","DOI":"10.1137\/1.9781611973402.100"},{"key":"7_CR2","doi-asserted-by":"crossref","unstructured":"Babaioff, M., Gonczarowski, Y.A., Mansour, Y., Moran, S.: Are two (samples) really better than one? In: EC, p. 175. ACM (2018)","DOI":"10.1145\/3219166.3219187"},{"key":"7_CR3","doi-asserted-by":"crossref","unstructured":"Caramanis, C., et al.: Single-sample prophet inequalities via greedy-ordered selection. In: SODA, pp. 1298\u20131325. SIAM (2022)","DOI":"10.1137\/1.9781611977073.54"},{"key":"7_CR4","doi-asserted-by":"crossref","unstructured":"Chawla, S., Hartline, J.D., Malec, D.L., Sivan, B.: Multi-parameter mechanism design and sequential posted pricing. In: STOC, pp. 311\u2013320. ACM (2010)","DOI":"10.1145\/1806689.1806733"},{"key":"7_CR5","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. SIAM (2020)","DOI":"10.1137\/1.9781611975994.127"},{"key":"7_CR6","doi-asserted-by":"crossref","unstructured":"Correa, J.R., Cristi, A., Feuilloley, L., Oosterwijk, T., Tsigonias-Dimitriadis, A.: The secretary problem with independent sampling. In: SODA, pp. 2047\u20132058. SIAM (2021)","DOI":"10.1137\/1.9781611976465.122"},{"key":"7_CR7","doi-asserted-by":"crossref","unstructured":"Correa, J.R., D\u00fctting, P., Fischer, F.A., Schewior, K.: Prophet inequalities for I.I.D. random variables from an unknown distribution. In: EC, pp. 3\u201317. ACM (2019)","DOI":"10.1145\/3328526.3329627"},{"key":"7_CR8","unstructured":"Correa, J.R., D\u00fctting, P., Fischer, F.A., Schewior, K., Ziliotto, B.: Unknown I.I.D. prophets: better bounds, streaming algorithms, and a new impossibility (extended abstract). In: ITCS. LIPIcs, vol. 185, pp. 86:1\u201386:1. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2021)"},{"issue":"4","key":"7_CR9","doi-asserted-by":"publisher","first-page":"1452","DOI":"10.1287\/moor.2020.1105","volume":"46","author":"JR Correa","year":"2021","unstructured":"Correa, J.R., Foncea, P., Hoeksma, R., Oosterwijk, T., Vredeveld, T.: Posted price mechanisms and optimal threshold strategies for random arrivals. Math. Oper. Res. 46(4), 1452\u20131478 (2021)","journal-title":"Math. Oper. Res."},{"issue":"1","key":"7_CR10","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1016\/j.orl.2018.11.010","volume":"47","author":"JR Correa","year":"2019","unstructured":"Correa, J.R., Foncea, P., Pizarro, D., Verdugo, V.: From pricing to prophets, and back! Oper. Res. Lett. 47(1), 25\u201329 (2019)","journal-title":"Oper. Res. Lett."},{"key":"7_CR11","doi-asserted-by":"crossref","unstructured":"Daskalakis, C., Zampetakis, M.: More revenue from two samples via factor revealing SDPS. In: EC, pp. 257\u2013272. ACM (2020)","DOI":"10.1145\/3391403.3399543"},{"key":"7_CR12","doi-asserted-by":"publisher","first-page":"318","DOI":"10.1016\/j.geb.2014.03.011","volume":"91","author":"P Dhangwatnotai","year":"2015","unstructured":"Dhangwatnotai, P., Roughgarden, T., Yan, Q.: Revenue maximization with a single sample. Games Econ. Behav. 91, 318\u2013333 (2015)","journal-title":"Games Econ. Behav."},{"key":"7_CR13","doi-asserted-by":"crossref","unstructured":"D\u00fctting, P., Lattanzi, S., Leme, R.P., Vassilvitskii, S.: Secretaries with advice. In: EC, pp. 409\u2013429. ACM (2021)","DOI":"10.1145\/3465456.3467623"},{"key":"7_CR14","doi-asserted-by":"crossref","unstructured":"Ezra, T., Feldman, M., Gravin, N., Tang, Z.G.: Online stochastic max-weight matching: prophet inequality for vertex and edge arrival models. In: EC, pp. 769\u2013787. ACM (2020)","DOI":"10.1145\/3391403.3399513"},{"key":"7_CR15","doi-asserted-by":"crossref","unstructured":"Feldman, M., Gravin, N., Lucier, B.: Combinatorial auctions via posted prices. In: SODA, pp. 123\u2013135. SIAM (2015)","DOI":"10.1137\/1.9781611973730.10"},{"key":"7_CR16","doi-asserted-by":"crossref","unstructured":"Feldman, M., Svensson, O., Zenklusen, R.: Online contention resolution schemes. In: SODA, pp. 1014\u20131033. SIAM (2016)","DOI":"10.1137\/1.9781611974331.ch72"},{"key":"7_CR17","doi-asserted-by":"crossref","unstructured":"Fu, H., Immorlica, N., Lucier, B., Strack, P.: Randomization beats second price as a prior-independent auction. In: EC, p. 323. ACM (2015)","DOI":"10.1145\/2764468.2764489"},{"key":"7_CR18","doi-asserted-by":"crossref","unstructured":"Gravin, N., Wang, H.: Prophet inequality for bipartite matching: merits of being simple and non adaptive. In: EC, pp. 93\u2013109. ACM (2019)","DOI":"10.1145\/3328526.3329604"},{"key":"7_CR19","unstructured":"Guo, C., Huang, Z., Tang, Z.G., Zhang, X.: Generalizing complex hypotheses on product distributions: auctions, prophet inequalities, and pandora\u2019s problem. In: COLT. Proceedings of Machine Learning Research, vol. 134, pp. 2248\u20132288. PMLR (2021)"},{"key":"7_CR20","unstructured":"Hajiaghayi, M.T., Kleinberg, R.D., Sandholm, T.: Automated online mechanism design and prophet inequalities. In: AAAI, pp. 58\u201365. AAAI Press (2007)"},{"key":"7_CR21","doi-asserted-by":"crossref","unstructured":"Kaplan, H., Naori, D., Raz, D.: Competitive analysis with a sample and the secretary problem. In: SODA, pp. 2082\u20132095. SIAM (2020)","DOI":"10.1137\/1.9781611975994.128"},{"key":"7_CR22","doi-asserted-by":"crossref","unstructured":"Kleinberg, R., Weinberg, S.M.: Matroid prophet inequalities. In: STOC, pp. 123\u2013136. ACM (2012)","DOI":"10.1145\/2213977.2213991"},{"issue":"4","key":"7_CR23","doi-asserted-by":"publisher","first-page":"745","DOI":"10.1090\/S0002-9904-1977-14378-4","volume":"83","author":"U Krengel","year":"1977","unstructured":"Krengel, U., Sucheston, L.: Semiamarts and finite values. Bull. Am. Math. Soc. 83(4), 745\u2013747 (1977)","journal-title":"Bull. Am. Math. Soc."},{"key":"7_CR24","unstructured":"Krengel, U., Sucheston, L.: On semiamarts, amarts, and processes with finite value. In: Probability on Banach Spaces, vol. 4, pp. 197\u2013266 (1978)"},{"key":"7_CR25","doi-asserted-by":"crossref","unstructured":"Rubinstein, A.: Beyond matroids: secretary problem and prophet inequality with general constraints. In: STOC, pp. 324\u2013332. ACM (2016)","DOI":"10.1145\/2897518.2897540"},{"key":"7_CR26","unstructured":"Rubinstein, A., Wang, J.Z., Weinberg, S.M.: Optimal single-choice prophet inequalities from samples. In: ITCS. LIPIcs, vol. 151, pp. 60:1\u201360:10. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2020)"},{"key":"7_CR27","doi-asserted-by":"crossref","unstructured":"Samuel-Cahn, E.: Comparison of threshold stop rules and maximum for independent nonnegative random variables. Ann. Probab. 1213\u20131216 (1984)","DOI":"10.1214\/aop\/1176993150"}],"container-title":["Lecture Notes in Computer Science","Web and Internet Economics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-22832-2_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,12]],"date-time":"2024-03-12T18:47:44Z","timestamp":1710269264000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-22832-2_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031228315","9783031228322"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-22832-2_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"9 December 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"WINE","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Web and Internet Economics","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Troy, NY","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"USA","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":"12 December 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15 December 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"wine2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.cs.rpi.edu\/wine2022\/","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":"126","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":"19","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":"15% - 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":"6","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)"}},{"value":"19 abstracts in the back matter","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}