{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,4]],"date-time":"2026-03-04T18:32:08Z","timestamp":1772649128293,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":39,"publisher":"ACM","license":[{"start":{"date-parts":[[2024,7,8]],"date-time":"2024-07-08T00:00:00Z","timestamp":1720396800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"the European Union's Horizon 2020 research and innovation program","award":["866132"],"award-info":[{"award-number":["866132"]}]},{"name":"Amazon Research Award","award":["2020788"],"award-info":[{"award-number":["2020788"]}]},{"name":"TAU Center for AI and Data Science"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2024,7,8]]},"DOI":"10.1145\/3670865.3673620","type":"proceedings-article","created":{"date-parts":[[2024,12,17]],"date-time":"2024-12-17T20:13:33Z","timestamp":1734466413000},"page":"136-158","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":2,"title":["Choosing Behind the Veil: Tight Bounds for Identity-Blind Online Algorithms"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-0626-4851","authenticated-orcid":false,"given":"Tomer","family":"Ezra","sequence":"first","affiliation":[{"name":"Harvard University, Boston, United States of America"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2915-8405","authenticated-orcid":false,"given":"Michal","family":"Feldman","sequence":"additional","affiliation":[{"name":"Tel Aviv University, Tel Aviv, Israel"},{"name":"Microsoft ILDC, Tel Aviv, Israel"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5094-1971","authenticated-orcid":false,"given":"Zhihao Gavin","family":"Tang","sequence":"additional","affiliation":[{"name":"Shanghai University of Finance and Economics, Shanghai, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2024,12,17]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"On Optimal Ordering in the Optimal Stopping Problem. In EC '20: The 21st ACM Conference on Economics and Computation","author":"Agrawal Shipra","year":"2020","unstructured":"Shipra Agrawal, Jay Sethuraman, and Xingyu Zhang. 2020. On Optimal Ordering in the Optimal Stopping Problem. In EC '20: The 21st ACM Conference on Economics and Computation, Virtual Event, Hungary, July 13--17, 2020, P\u00e9ter Bir\u00f3, Jason D. Hartline, Michael Ostrovsky, and Ariel D. Procaccia (Eds.). ACM, 187--188."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611976465.121"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/3490486.3538301"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611973402.100"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/3219166.3219182"},{"key":"e_1_3_2_1_6_1","volume-title":"Martin Pal, and Balasubramanian Sivan.","author":"Beyhaghi Hedyeh","year":"2018","unstructured":"Hedyeh Beyhaghi, Negin Golrezaei, Renato Paes Leme, Martin Pal, and Balasubramanian Sivan. 2018. Improved approximations for free-order prophets and second-price auctions. arXiv preprint arXiv:1807.03435 (2018)."},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/3490486.3538315"},{"key":"e_1_3_2_1_8_1","volume-title":"Prophet Inequality: Order selection beats random order. EC","author":"Bubna Archit","year":"2023","unstructured":"Archit Bubna and Ashish Chiplunkar. 2023. Prophet Inequality: Order selection beats random order. EC (2023)."},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/1806689.1806733"},{"key":"e_1_3_2_1_10_1","volume-title":"Proceedings of the 2021 International Conference on Machine Learning (ICML'21)","author":"Correa Jose","year":"2021","unstructured":"Jose Correa, Andres Cristi, Paul Duetting, and Ashkan Norouzi Fard. 2021a. Fairness and Bias in Online Selection. In Proceedings of the 2021 International Conference on Machine Learning (ICML'21). 2112--2121."},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-020-01544-8"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/3580507.3597736"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/3440968.3440972"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-48350-3_37"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611975031.46"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1137\/15M1029394"},{"key":"e_1_3_2_1_17_1","volume-title":"The 23rd International Conference on Artificial Intelligence and Statistics, AISTATS 2020, 26--28","volume":"3727","author":"Esfandiari Hossein","year":"2020","unstructured":"Hossein Esfandiari, Mohammad Taghi Hajiaghayi, Brendan Lucier, and Michael Mitzenmacher. 2020. Prophets, Secretaries, and Maximizing the Probability of Choosing the Best. In The 23rd International Conference on Artificial Intelligence and Statistics, AISTATS 2020, 26--28 August 2020, Online [Palermo, Sicily, Italy] (Proceedings of Machine Learning Research, Vol. 108), Silvia Chiappa and Roberto Calandra (Eds.). PMLR, 3717--3727. http:\/\/proceedings.mlr.press\/v108\/esfandiari20a.html"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"crossref","unstructured":"Tomer Ezra Michal Feldman Nick Gravin and Zhihao Gavin Tang. 2020. Online Stochastic Max-Weight Matching: Prophet Inequality for Vertex and Edge Arrival Models. In EC. ACM 769--787.","DOI":"10.1145\/3391403.3399513"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611977554.ch145"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/3219166.3219211"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-48974-7_15"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611973730.10"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1257\/aer.90A715"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"crossref","unstructured":"Nikolai Gravin and Hongao Wang. 2019. Prophet Inequality for Bipartite Matching: Merits of Being Simple and Non Adaptive. In EC. ACM 93--109.","DOI":"10.1145\/3328526.3329604"},{"key":"e_1_3_2_1_25_1","first-page":"58","article-title":"Automated online mechanism design and prophet inequalities","volume":"7","author":"Hajiaghayi Mohammad Taghi","year":"2007","unstructured":"Mohammad Taghi Hajiaghayi, Robert Kleinberg, and Tuomas Sandholm. 2007. Automated online mechanism design and prophet inequalities. In AAAI, Vol. 7. 58--65.","journal-title":"AAAI"},{"key":"e_1_3_2_1_26_1","volume-title":"Optimal stopping of independent random variables and maximizing prophets. The Annals of Probability","author":"Kennedy Douglas P","year":"1985","unstructured":"Douglas P Kennedy. 1985. Optimal stopping of independent random variables and maximizing prophets. The Annals of Probability (1985), 566--571."},{"key":"e_1_3_2_1_27_1","volume-title":"Prophet-type inequalities for multi-choice optimal stopping. Stochastic Processes and their applications 24, 1","author":"Kennedy Douglas P","year":"1987","unstructured":"Douglas P Kennedy. 1987. Prophet-type inequalities for multi-choice optimal stopping. Stochastic Processes and their applications 24, 1 (1987), 77--88."},{"key":"e_1_3_2_1_28_1","volume-title":"Comparison of optimal value and constrained maxima expectations for independent random variables. Advances in applied probability 18, 2","author":"Kertz Robert P","year":"1986","unstructured":"Robert P Kertz. 1986. Comparison of optimal value and constrained maxima expectations for independent random variables. Advances in applied probability 18, 2 (1986), 311--340."},{"key":"e_1_3_2_1_29_1","volume-title":"The stationary prophet inequality problem. arXiv preprint arXiv:2107.10516","author":"Kessel Kristen","year":"2021","unstructured":"Kristen Kessel, Amin Saberi, Ali Shameli, and David Wajc. 2021. The stationary prophet inequality problem. arXiv preprint arXiv:2107.10516 (2021)."},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/2213977.2213991"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1090\/S0002-9904-1977-14378-4"},{"key":"e_1_3_2_1_32_1","volume-title":"On semiamarts, amarts, and processes with finite value. Probability on Banach spaces 4","author":"Krengel Ulrich","year":"1978","unstructured":"Ulrich Krengel and Louis Sucheston. 1978. On semiamarts, amarts, and processes with finite value. Probability on Banach spaces 4 (1978), 197--266."},{"key":"e_1_3_2_1_33_1","volume-title":"Online Dependent Rounding Schemes. CoRR abs\/2301.08680","author":"Naor Joseph","year":"2023","unstructured":"Joseph Naor, Aravind Srinivasan, and David Wajc. 2023. Online Dependent Rounding Schemes. CoRR abs\/2301.08680 (2023)."},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-04612-5_24"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1145\/3465456.3467613"},{"key":"e_1_3_2_1_36_1","volume-title":"Order Selection Prophet Inequality: From Threshold Optimization to Arrival Time Design","author":"Peng Bo","unstructured":"Bo Peng and Zhihao Gavin Tang. 2022. Order Selection Prophet Inequality: From Threshold Optimization to Arrival Time Design. In FOCS. IEEE, 171--178."},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1145\/2897518.2897540"},{"key":"e_1_3_2_1_38_1","first-page":"1","article-title":"The Greedy Algorithm Is not Optimal for On-Line Edge Coloring. In ICALP (LIPIcs, Vol. 198)","volume":"109","author":"Saberi Amin","year":"2021","unstructured":"Amin Saberi and David Wajc. 2021. The Greedy Algorithm Is not Optimal for On-Line Edge Coloring. In ICALP (LIPIcs, Vol. 198). Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik, 109:1--109:18.","journal-title":"Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik"},{"key":"e_1_3_2_1_39_1","volume-title":"Comparison of threshold stop rules and maximum for independent nonnegative random variables. the Annals of Probability","author":"Samuel-Cahn Ester","year":"1984","unstructured":"Ester Samuel-Cahn. 1984. Comparison of threshold stop rules and maximum for independent nonnegative random variables. the Annals of Probability (1984), 1213--1216."}],"event":{"name":"EC '24: 25th ACM Conference on Economics and Computation","location":"New Haven CT USA","acronym":"EC '24","sponsor":["SIGecom Special Interest Group on Economics and Computation"]},"container-title":["Proceedings of the 25th ACM Conference on Economics and Computation"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3670865.3673620","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3670865.3673620","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T01:10:01Z","timestamp":1750295401000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3670865.3673620"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,7,8]]},"references-count":39,"alternative-id":["10.1145\/3670865.3673620","10.1145\/3670865"],"URL":"https:\/\/doi.org\/10.1145\/3670865.3673620","relation":{},"subject":[],"published":{"date-parts":[[2024,7,8]]},"assertion":[{"value":"2024-12-17","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}