{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,28]],"date-time":"2026-04-28T01:23:25Z","timestamp":1777339405784,"version":"3.51.4"},"publisher-location":"New York, NY, USA","reference-count":18,"publisher":"ACM","license":[{"start":{"date-parts":[[2018,6,11]],"date-time":"2018-06-11T00:00:00Z","timestamp":1528675200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"Blavatnik Fund"},{"name":"German-Israeli Foundation for Scientific Research and Development","award":["1367\/2017"],"award-info":[{"award-number":["1367\/2017"]}]},{"DOI":"10.13039\/501100001742","name":"Israel Science Foundation","doi-asserted-by":"publisher","award":["1506\/16, 1841-14"],"award-info":[{"award-number":["1506\/16, 1841-14"]}],"id":[{"id":"10.13039\/501100001742","id-type":"DOI","asserted-by":"publisher"}]},{"name":"ICRC Blavatnik Fund"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2018,6,11]]},"DOI":"10.1145\/3219166.3219182","type":"proceedings-article","created":{"date-parts":[[2018,9,21]],"date-time":"2018-09-21T12:42:08Z","timestamp":1537533728000},"page":"303-318","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":28,"title":["Prophet Secretary"],"prefix":"10.1145","author":[{"given":"Yossi","family":"Azar","sequence":"first","affiliation":[{"name":"Tel Aviv University, Tel Aviv, Israel"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ashish","family":"Chiplunkar","sequence":"additional","affiliation":[{"name":"Ecole Polytechnique F\u00e9d\u00e9rale de Lausanne, Lausanne, Switzerland"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Haim","family":"Kaplan","sequence":"additional","affiliation":[{"name":"Tel Aviv University, Tel Aviv, Israel"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2018,6,11]]},"reference":[{"key":"e_1_3_2_2_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/3055399.3055479"},{"key":"e_1_3_2_2_2_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2011.90"},{"key":"e_1_3_2_2_3_1","volume-title":"Prophet Secretary: Surpassing the 1--1\/e Barrier. CoRR abs\/1711.01834","author":"Azar Yossi","year":"2017","unstructured":"Yossi Azar , Ashish Chiplunkar , and Haim Kaplan . 2017 . Prophet Secretary: Surpassing the 1--1\/e Barrier. CoRR abs\/1711.01834 (2017). arXiv:1711.01834 http:\/\/arxiv.org\/abs\/1711.01834 Yossi Azar, Ashish Chiplunkar, and Haim Kaplan. 2017. Prophet Secretary: Surpassing the 1--1\/e Barrier. CoRR abs\/1711.01834 (2017). arXiv:1711.01834 http:\/\/arxiv.org\/abs\/1711.01834"},{"key":"e_1_3_2_2_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/1806689.1806733"},{"key":"e_1_3_2_2_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/3033274.3085137"},{"key":"e_1_3_2_2_6_1","unstructured":"E.B. Dynkin. 1963. The optimum choice of the instant for stopping a markov process. Soviet Math. Dokl. (1963).  E.B. Dynkin. 1963. The optimum choice of the instant for stopping a markov process. Soviet Math. Dokl. (1963)."},{"key":"e_1_3_2_2_7_1","volume-title":"Thomas Kesselheim, and Sahil Singla.","author":"Ehsani Soheil","year":"2018","unstructured":"Soheil Ehsani , Mohammad Taghi Hajiaghayi , Thomas Kesselheim, and Sahil Singla. 2018 . Prophet Secretary for Combinatorial Auctions and Matroids. In SODA. 700--714. Soheil Ehsani, Mohammad Taghi Hajiaghayi, Thomas Kesselheim, and Sahil Singla. 2018. Prophet Secretary for Combinatorial Auctions and Matroids. In SODA. 700--714."},{"key":"e_1_3_2_2_8_1","doi-asserted-by":"crossref","unstructured":"Hossein Esfandiari MohammadTaghi Hajiaghayi Vahid Liaghat and Morteza Monemizadeh. 2015. Prophet Secretary. In ESA. 496--508.  Hossein Esfandiari MohammadTaghi Hajiaghayi Vahid Liaghat and Morteza Monemizadeh. 2015. Prophet Secretary. In ESA. 496--508.","DOI":"10.1007\/978-3-662-48350-3_42"},{"key":"e_1_3_2_2_9_1","doi-asserted-by":"publisher","DOI":"10.1214\/ss\/1177012493"},{"key":"e_1_3_2_2_10_1","unstructured":"Mohammad Taghi Hajiaghayi Robert D. Kleinberg and Tuomas Sandholm. 2007. Automated Online Mechanism Design and Prophet Inequalities. In AAAI. 58--65. http:\/\/www.aaai.org\/Library\/AAAI\/2007\/aaai07-009.php  Mohammad Taghi Hajiaghayi Robert D. Kleinberg and Tuomas Sandholm. 2007. Automated Online Mechanism Design and Prophet Inequalities. In AAAI. 58--65. http:\/\/www.aaai.org\/Library\/AAAI\/2007\/aaai07-009.php"},{"key":"e_1_3_2_2_11_1","doi-asserted-by":"publisher","DOI":"10.1214\/aop\/1176993861"},{"key":"e_1_3_2_2_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/2213977.2213991"},{"key":"e_1_3_2_2_13_1","doi-asserted-by":"publisher","DOI":"10.1090\/S0002-9904-1977-14378-4"},{"key":"e_1_3_2_2_14_1","first-page":"197","article-title":"On semiamarts, amarts, and processes with finite value","volume":"4","author":"Krengel Ulrich","year":"1978","unstructured":"Ulrich Krengel and Louis Sucheston . 1978 . On semiamarts, amarts, and processes with finite value . Adv. in Prob. Related Topics 4 (1978), 197 -- 266 . Ulrich Krengel and Louis Sucheston. 1978. On semiamarts, amarts, and processes with finite value. Adv. in Prob. Related Topics 4 (1978), 197--266.","journal-title":"Adv. in Prob. Related Topics"},{"key":"e_1_3_2_2_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/2897518.2897540"},{"key":"e_1_3_2_2_16_1","doi-asserted-by":"crossref","unstructured":"Aviad Rubinstein and Sahil Singla. 2017. Combinatorial Prophet Inequalities. In SODA. 1671--1687.   Aviad Rubinstein and Sahil Singla. 2017. Combinatorial Prophet Inequalities. In SODA. 1671--1687.","DOI":"10.1137\/1.9781611974782.110"},{"key":"e_1_3_2_2_17_1","doi-asserted-by":"publisher","DOI":"10.1214\/aop\/1176993150"},{"key":"e_1_3_2_2_18_1","doi-asserted-by":"crossref","unstructured":"Qiqi Yan. 2011. Mechanism Design via Correlation Gap. In SODA. 710--719.   Qiqi Yan. 2011. Mechanism Design via Correlation Gap. In SODA. 710--719.","DOI":"10.1137\/1.9781611973082.56"}],"event":{"name":"EC '18: ACM Conference on Economics and Computation","location":"Ithaca NY USA","acronym":"EC '18","sponsor":["SIGecom Special Interest Group on Economics and Computation"]},"container-title":["Proceedings of the 2018 ACM Conference on Economics and Computation"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3219166.3219182","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3219166.3219182","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T02:07:13Z","timestamp":1750212433000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3219166.3219182"}},"subtitle":["Surpassing the 1-1\/e Barrier"],"short-title":[],"issued":{"date-parts":[[2018,6,11]]},"references-count":18,"alternative-id":["10.1145\/3219166.3219182","10.1145\/3219166"],"URL":"https:\/\/doi.org\/10.1145\/3219166.3219182","relation":{},"subject":[],"published":{"date-parts":[[2018,6,11]]},"assertion":[{"value":"2018-06-11","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}