{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,23]],"date-time":"2025-08-23T05:26:04Z","timestamp":1755926764886,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":28,"publisher":"ACM","license":[{"start":{"date-parts":[[2023,4,30]],"date-time":"2023-04-30T00:00:00Z","timestamp":1682812800000},"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":[[2023,4,30]]},"DOI":"10.1145\/3543507.3583478","type":"proceedings-article","created":{"date-parts":[[2023,4,26]],"date-time":"2023-04-26T23:30:51Z","timestamp":1682551851000},"page":"3541-3549","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":4,"title":["Eligibility Mechanisms: Auctions Meet Information Retrieval"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-9035-0917","authenticated-orcid":false,"given":"Gagan","family":"Goel","sequence":"first","affiliation":[{"name":"Google, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9799-5766","authenticated-orcid":false,"given":"Renato","family":"Paes Leme","sequence":"additional","affiliation":[{"name":"Google, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5392-3560","authenticated-orcid":false,"given":"Jon","family":"Schneider","sequence":"additional","affiliation":[{"name":"Google, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9393-8898","authenticated-orcid":false,"given":"David","family":"Thompson","sequence":"additional","affiliation":[{"name":"Google, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8991-0622","authenticated-orcid":false,"given":"Hanrui","family":"Zhang","sequence":"additional","affiliation":[{"name":"Carnegie Mellon University, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2023,4,30]]},"reference":[{"key":"e_1_3_2_2_1_1","doi-asserted-by":"publisher","DOI":"10.1287\/moor.2015.0766"},{"key":"e_1_3_2_2_2_1","doi-asserted-by":"publisher","DOI":"10.1137\/120878422"},{"key":"e_1_3_2_2_3_1","volume-title":"Delegated Stochastic Probing. In 12th Innovations in Theoretical Computer Science Conference (ITCS","author":"Bechtel Curtis","year":"2021","unstructured":"Curtis Bechtel and Shaddin Dughmi. 2021. Delegated Stochastic Probing. In 12th Innovations in Theoretical Computer Science Conference (ITCS 2021). Schloss Dagstuhl-Leibniz-Zentrum f\u00fcr Informatik."},{"key":"e_1_3_2_2_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/1526709.1526778"},{"key":"e_1_3_2_2_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/1458082.1458217"},{"key":"e_1_3_2_2_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/1806689.1806733"},{"key":"e_1_3_2_2_7_1","doi-asserted-by":"publisher","DOI":"10.1137\/110839655"},{"key":"e_1_3_2_2_8_1","unstructured":"Wei Chen Wei Hu Fu Li Jian Li Yu Liu and Pinyan Lu. 2016. Combinatorial multi-armed bandit with general reward functions. In Advances in Neural Information Processing Systems. 1651\u20131659."},{"key":"e_1_3_2_2_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/1772690.1772717"},{"key":"e_1_3_2_2_10_1","doi-asserted-by":"publisher","DOI":"10.1257\/aer.97.1.242"},{"key":"e_1_3_2_2_11_1","volume-title":"45th International Colloquium on Automata, Languages, and Programming (ICALP","author":"Fu Hao","year":"2018","unstructured":"Hao Fu, Jian Li, and Pan Xu. 2018. A PTAS for a Class of Stochastic Dynamic Programs. In 45th International Colloquium on Automata, Languages, and Programming (ICALP 2018). Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik."},{"key":"e_1_3_2_2_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/1142351.1142380"},{"key":"e_1_3_2_2_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/2071379.2071380"},{"key":"e_1_3_2_2_14_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-36694-9_18"},{"key":"e_1_3_2_2_15_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611974331.ch120"},{"key":"e_1_3_2_2_16_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611974782.111"},{"key":"e_1_3_2_2_17_1","unstructured":"Mohammad\u00a0Taghi Hajiaghayi Robert Kleinberg and Tuomas Sandholm. 2007. Automated online mechanism design and prophet inequalities. In AAAI Vol.\u00a07. 58\u201365."},{"key":"e_1_3_2_2_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/2648584.2648589"},{"key":"e_1_3_2_2_19_1","volume-title":"A Simple Optimal Contention Resolution Scheme for Uniform Matroids. arXiv preprint arXiv:2105.11992","author":"Kashaev Danish","year":"2021","unstructured":"Danish Kashaev and Richard Santiago. 2021. A Simple Optimal Contention Resolution Scheme for Uniform Matroids. arXiv preprint arXiv:2105.11992 (2021)."},{"key":"e_1_3_2_2_20_1","first-page":"3","article-title":"Team performance with test scores","volume":"6","author":"Kleinberg Jon","year":"2018","unstructured":"Jon Kleinberg and Maithra Raghu. 2018. Team performance with test scores. ACM Transactions on Economics and Computation (TEAC) 6, 3-4 (2018), 1\u201326.","journal-title":"ACM Transactions on Economics and Computation (TEAC)"},{"key":"e_1_3_2_2_21_1","unstructured":"Aranyak Mehta Uri Nadav Alexandros Psomas and Aviad Rubinstein. 2020. Hitting the High Notes: Subset Selection for Maximizing Expected Order Statistics. In Advances in Neural Information Processing Systems. 15800\u201315810."},{"key":"e_1_3_2_2_22_1","volume-title":"Optimal auction design. Mathematics of operations research 6, 1","author":"Myerson B","year":"1981","unstructured":"Roger\u00a0B Myerson. 1981. Optimal auction design. Mathematics of operations research 6, 1 (1981), 58\u201373."},{"key":"e_1_3_2_2_23_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\u20131216."},{"key":"e_1_3_2_2_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/3465456.3467614"},{"key":"e_1_3_2_2_25_1","volume-title":"Combinatorial optimization under uncertainty: probing and stopping-time algorithms. Unpublished doctoral dissertation","author":"Singla Sahil","year":"2018","unstructured":"Sahil Singla. 2018. Combinatorial optimization under uncertainty: probing and stopping-time algorithms. Unpublished doctoral dissertation, Carnegie Mellon University (2018)."},{"key":"e_1_3_2_2_26_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611975031.161"},{"key":"e_1_3_2_2_27_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ijindorg.2006.10.002"},{"key":"e_1_3_2_2_28_1","volume-title":"On Designing a Two-stage Auction for Online Advertising. arXiv preprint arXiv:2111.05555","author":"Wang Yiqing","year":"2021","unstructured":"Yiqing Wang, Xiangyu Liu, Zhenzhe Zheng, Zhilin Zhang, Miao Xu, Chuan Yu, and Fan Wu. 2021. On Designing a Two-stage Auction for Online Advertising. arXiv preprint arXiv:2111.05555 (2021)."}],"event":{"name":"WWW '23: The ACM Web Conference 2023","sponsor":["SIGWEB ACM Special Interest Group on Hypertext, Hypermedia, and Web"],"location":"Austin TX USA","acronym":"WWW '23"},"container-title":["Proceedings of the ACM Web Conference 2023"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3543507.3583478","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3543507.3583478","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T16:47:53Z","timestamp":1750178873000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3543507.3583478"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,4,30]]},"references-count":28,"alternative-id":["10.1145\/3543507.3583478","10.1145\/3543507"],"URL":"https:\/\/doi.org\/10.1145\/3543507.3583478","relation":{},"subject":[],"published":{"date-parts":[[2023,4,30]]},"assertion":[{"value":"2023-04-30","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}