{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,12]],"date-time":"2026-06-12T15:46:27Z","timestamp":1781279187005,"version":"3.54.1"},"publisher-location":"New York, NY, USA","reference-count":34,"publisher":"ACM","license":[{"start":{"date-parts":[[2021,7,18]],"date-time":"2021-07-18T00:00:00Z","timestamp":1626566400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2021,7,18]]},"DOI":"10.1145\/3465456.3467623","type":"proceedings-article","created":{"date-parts":[[2021,7,18]],"date-time":"2021-07-18T10:28:50Z","timestamp":1626604130000},"page":"409-429","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":20,"title":["Secretaries with Advice"],"prefix":"10.1145","author":[{"given":"Paul","family":"D\u00fctting","sequence":"first","affiliation":[{"name":"Google Research, Zurich, Switzerland"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Silvio","family":"Lattanzi","sequence":"additional","affiliation":[{"name":"Google Research, Zurich, Switzerland"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Renato","family":"Paes Leme","sequence":"additional","affiliation":[{"name":"Google Research, New York, NY, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Sergei","family":"Vassilvitskii","sequence":"additional","affiliation":[{"name":"Google Research, New York, NY, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2021,7,18]]},"reference":[{"key":"e_1_3_2_1_1_1","first-page":"30","volume-title":"Proceedings of the 2019 Conference on Learning Theory","author":"Alabi D.","year":"2019","unstructured":"D. Alabi , A. T. Kalai , K. Ligett , C. Musco , C. Tzamos , and E. Vitercik . Learning to prune: Speeding up repeated computations . In Proceedings of the 2019 Conference on Learning Theory , pages 30 -- 33 , 2019 . D. Alabi, A. T. Kalai, K. Ligett, C. Musco, C. Tzamos, and E. Vitercik. Learning to prune: Speeding up repeated computations. In Proceedings of the 2019 Conference on Learning Theory, pages 30--33, 2019."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1239\/jap\/1294170520"},{"key":"e_1_3_2_1_3_1","volume-title":"Proceedings of the 2020 Conference on Neural Information Processing","author":"Antoniadis A.","year":"2020","unstructured":"A. Antoniadis , T. Gouleakis , P. Kleer , and P. Kolev . Secretary and online matching problems with machine learned advice . In Proceedings of the 2020 Conference on Neural Information Processing , 2020 . A. Antoniadis, T. Gouleakis, P. Kleer, and P. Kolev. Secretary and online matching problems with machine learned advice. In Proceedings of the 2020 Conference on Neural Information Processing, 2020."},{"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","first-page":"353","volume-title":"Proceedings of the 35th International Conference on Machine Learning","author":"Balcan M.","year":"2018","unstructured":"M. Balcan , T. Dick , T. Sandholm , and E. Vitercik . Learning to branch . In Proceedings of the 35th International Conference on Machine Learning , pages 353 -- 362 , 2018 . M. Balcan, T. Dick, T. Sandholm, and E. Vitercik. Learning to branch. In Proceedings of the 35th International Conference on Machine Learning, pages 353--362, 2018."},{"key":"e_1_3_2_1_6_1","volume-title":"The best choice problem (in russian)","author":"Berezovskiy B. A.","year":"1984","unstructured":"B. A. Berezovskiy and A. V. Gnedin . The best choice problem (in russian) . Nauka , Moscow , 1984 . B. A. Berezovskiy and A. V. Gnedin. The best choice problem (in russian). Nauka, Moscow, 1984."},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1287\/moor.2013.0604"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611973730.78"},{"key":"e_1_3_2_1_9_1","volume-title":"Proceedings of the 31st SIAM Symposium on Discrete Algorithms","author":"Correa J.","year":"2020","unstructured":"J. Correa , A. Cristi , L. Feuilloley , T. Osterwijk , and A. Tsigonias-Dimitriadis . The secretary problem with independent sampling . In Proceedings of the 31st SIAM Symposium on Discrete Algorithms , 2020 . Forthcoming. J. Correa, A. Cristi, L. Feuilloley, T. Osterwijk, and A. Tsigonias-Dimitriadis. The secretary problem with independent sampling. In Proceedings of the 31st SIAM Symposium on Discrete Algorithms, 2020. Forthcoming."},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611975994.127"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/3328526.3329627"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1214\/08-AAP566"},{"key":"e_1_3_2_1_13_1","first-page":"627","article-title":"The optimum choice of the instant for stopping a markov process","volume":"4","author":"Dynkin E. B.","year":"1963","unstructured":"E. B. Dynkin . The optimum choice of the instant for stopping a markov process . Soviet Mathematics , 4 : 627 -- 629 , 1963 . E. B. Dynkin. The optimum choice of the instant for stopping a markov process. Soviet Mathematics, 4:627--629, 1963.","journal-title":"Soviet Mathematics"},{"key":"e_1_3_2_1_14_1","first-page":"3717","volume-title":"Proceedings of the 23rd International Conference on Artificial Intelligence and Statistics","author":"Esfandiari H.","year":"2020","unstructured":"H. Esfandiari , M. Hajiaghayi , B. Lucier , and M. Mitzenmacher . Prophets, secretaries, and maximizing the probability of choosing the best . In Proceedings of the 23rd International Conference on Artificial Intelligence and Statistics , pages 3717 -- 3727 , 2020 . H. Esfandiari, M. Hajiaghayi, B. Lucier, and M. Mitzenmacher. Prophets, secretaries, and maximizing the probability of choosing the best. In Proceedings of the 23rd International Conference on Artificial Intelligence and Statistics, pages 3717--3727, 2020."},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1214\/ss\/1177012493"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1080\/01621459.1966.10502008"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.2307\/3215349"},{"key":"e_1_3_2_1_18_1","volume-title":"The secretary problem for a random walk. Stochastic Processes and their Applications, 28(2):317 -- 325","author":"Hlynka M.","year":"1988","unstructured":"M. Hlynka and J. Sheahan . The secretary problem for a random walk. Stochastic Processes and their Applications, 28(2):317 -- 325 , 1988 . M. Hlynka and J. Sheahan. The secretary problem for a random walk. Stochastic Processes and their Applications, 28(2):317 -- 325, 1988."},{"key":"e_1_3_2_1_19_1","first-page":"7400","volume-title":"Proceedings of the 2019 Conference on Neural Information Processing Systems","author":"Indyk P.","year":"2019","unstructured":"P. Indyk , A. Vakilian , and Y. Yuan . Learning-based low-rank approximations . In Proceedings of the 2019 Conference on Neural Information Processing Systems , pages 7400 -- 7410 , 2019 . P. Indyk, A. Vakilian, and Y. Yuan. Learning-based low-rank approximations. In Proceedings of the 2019 Conference on Neural Information Processing Systems, pages 7400--7410, 2019."},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/950620.950621"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611975994.128"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/3183713.3196909"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611975994.114"},{"key":"e_1_3_2_1_24_1","first-page":"3302","volume-title":"Proceedings of the 35th International Conference on Machine Learning","author":"Lykouris T.","year":"2018","unstructured":"T. Lykouris and S. Vassilvitskii . Competitive caching with machine learned advice . In Proceedings of the 35th International Conference on Machine Learning , pages 3302 -- 3311 , 2018 . T. Lykouris and S. Vassilvitskii. Competitive caching with machine learned advice. In Proceedings of the 35th International Conference on Machine Learning, pages 3302--3311, 2018."},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/1993636.1993716"},{"key":"e_1_3_2_1_26_1","first-page":"1858","volume-title":"Proceedings of the 2017 Annual Conference on Neural Information Processing Systems","author":"Medina A. M.","year":"2017","unstructured":"A. M. Medina and S. Vassilvitskii . Revenue optimization with approximate bid predictions . In Proceedings of the 2017 Annual Conference on Neural Information Processing Systems , pages 1858 -- 1866 , 2017 . A. M. Medina and S. Vassilvitskii. Revenue optimization with approximate bid predictions. In Proceedings of the 2017 Annual Conference on Neural Information Processing Systems, pages 1858--1866, 2017."},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/1284320.1284321"},{"key":"e_1_3_2_1_28_1","first-page":"462","volume-title":"Proceedings of the 2018 Annual Conference on Neural Information Processing Systems","author":"Mitzenmacher M.","year":"2018","unstructured":"M. Mitzenmacher . A model for learned bloom filters and optimizing by sandwiching . In Proceedings of the 2018 Annual Conference on Neural Information Processing Systems , pages 462 -- 471 , 2018 . M. Mitzenmacher. A model for learned bloom filters and optimizing by sandwiching. In Proceedings of the 2018 Annual Conference on Neural Information Processing Systems, pages 462--471, 2018."},{"key":"e_1_3_2_1_29_1","volume-title":"Queues with small advice. CoRR, abs\/2006.15463","author":"Mitzenmacher M.","year":"2020","unstructured":"M. Mitzenmacher . Queues with small advice. CoRR, abs\/2006.15463 , 2020 . M. Mitzenmacher. Queues with small advice. CoRR, abs\/2006.15463, 2020."},{"key":"e_1_3_2_1_30_1","first-page":"9684","volume-title":"Proceedings of the 2018 Annual Conference on Neural Information Processing Systems","author":"Purohit M.","year":"2018","unstructured":"M. Purohit , Z. Svitkina , and R. Kumar . Improving online algorithms via ML predictions . In Proceedings of the 2018 Annual Conference on Neural Information Processing Systems , pages 9684 -- 9693 , 2018 . M. Purohit, Z. Svitkina, and R. Kumar. Improving online algorithms via ML predictions. In Proceedings of the 2018 Annual Conference on Neural Information Processing Systems, pages 9684--9693, 2018."},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611975994.112"},{"key":"e_1_3_2_1_32_1","first-page":"1","volume-title":"Proceedings of the 11th Innovations in Theoretical Computer Science Conference","volume":"151","author":"Rubinstein A.","year":"2020","unstructured":"A. Rubinstein , J. Z. Wang , and S. M. Weinberg . Optimal single-choice prophet inequalities from samples . In Proceedings of the 11th Innovations in Theoretical Computer Science Conference , volume 151 , pages 60: 1 -- 60 :10, 2020 . A. Rubinstein, J. Z. Wang, and S. M. Weinberg. Optimal single-choice prophet inequalities from samples. In Proceedings of the 11th Innovations in Theoretical Computer Science Conference, volume 151, pages 60:1--60:10, 2020."},{"key":"e_1_3_2_1_33_1","first-page":"81","volume-title":"Exact solutions for the full information best choice problem","author":"Samuels S.","year":"1982","unstructured":"S. Samuels . Exact solutions for the full information best choice problem . Purdue University Statistics Mimeo Series , page 81 -- 87 , 1982 . S. Samuels. Exact solutions for the full information best choice problem. Purdue University Statistics Mimeo Series, page 81--87, 1982."},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1239\/jap\/1253279844"}],"event":{"name":"EC '21: The 22nd ACM Conference on Economics and Computation","location":"Budapest Hungary","acronym":"EC '21","sponsor":["SIGecom Special Interest Group on Economics and Computation"]},"container-title":["Proceedings of the 22nd ACM Conference on Economics and Computation"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3465456.3467623","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3465456.3467623","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T20:17:28Z","timestamp":1750191448000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3465456.3467623"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,7,18]]},"references-count":34,"alternative-id":["10.1145\/3465456.3467623","10.1145\/3465456"],"URL":"https:\/\/doi.org\/10.1145\/3465456.3467623","relation":{},"subject":[],"published":{"date-parts":[[2021,7,18]]},"assertion":[{"value":"2021-07-18","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}