{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,9]],"date-time":"2025-12-09T08:19:27Z","timestamp":1765268367393,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":27,"publisher":"ACM","license":[{"start":{"date-parts":[[2016,7,7]],"date-time":"2016-07-07T00:00:00Z","timestamp":1467849600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2016,7,7]]},"DOI":"10.1145\/2911451.2911514","type":"proceedings-article","created":{"date-parts":[[2016,7,8]],"date-time":"2016-07-08T15:03:00Z","timestamp":1467990180000},"page":"473-482","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":13,"title":["How Many Workers to Ask?"],"prefix":"10.1145","author":[{"given":"Ittai","family":"Abraham","sequence":"first","affiliation":[{"name":"VMWare, Palo Alto, CA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Omar","family":"Alonso","sequence":"additional","affiliation":[{"name":"Microsoft, Mountain View, CA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Vasilis","family":"Kandylas","sequence":"additional","affiliation":[{"name":"Microsoft, Mountain View, CA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rajesh","family":"Patel","sequence":"additional","affiliation":[{"name":"Microsoft, Redmond, WA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Steven","family":"Shelford","sequence":"additional","affiliation":[{"name":"Microsoft, Redmond, WA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Aleksandrs","family":"Slivkins","sequence":"additional","affiliation":[{"name":"Microsoft, New York City, NY, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2016,7,7]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"26th COLT","author":"Abraham Ittai","year":"2013","unstructured":"Ittai Abraham, Omar Alonso, Vasilis Kandylas, and Aleksandrs Slivkins. Adaptive crowdsourcing algorithms for the bandit survey problem. In 26th COLT, 2013."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipm.2012.01.004"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1013689704352"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1214\/aoms\/1177706362"},{"key":"e_1_3_2_1_5_1","volume-title":"B14: 283--315","author":"Bechhofer R. E.","year":"1985","unstructured":"R. E. Bechhofer and D. Goldsman. Truncation of the bechhofer-kiefer-sobel sequential procedure for selecting the multinomial event which has the largest probability. Communications in Statistics -- Simulation and Computation, B14:283--315, 1985."},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/2009916.2010039"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1561\/2200000024"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.5555\/1699510.1699548"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.5555\/1137817"},{"key":"e_1_3_2_1_10_1","volume-title":"30th ICML","author":"Chen Xi","year":"2013","unstructured":"Xi Chen, Qihang Lin, and Dengyong Zhou. Optimistic knowledge gradient for optimal budget allocation in crowdsourcing. In 30th ICML, 2013."},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539797315306"},{"key":"e_1_3_2_1_12_1","first-page":"20","volume-title":"Maximum likelihood estimation of observer error-rates using the em algorithm. Applied statistics","author":"Dawid Alexander Philip","year":"1979","unstructured":"Alexander Philip Dawid and Allan M Skene. Maximum likelihood estimation of observer error-rates using the em algorithm. Applied statistics, pages 20--28, 1979."},{"key":"e_1_3_2_1_13_1","volume-title":"22nd COLT","author":"Dekel Ofer","year":"2009","unstructured":"Ofer Dekel and Ohad Shamir. Vox populi: Collecting high-quality labels from a crowd. In 22nd COLT, 2009."},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"crossref","first-page":"148","DOI":"10.1111\/j.2517-6161.1979.tb01068.x","article-title":"Bandit processes and dynamic allocation indices (with discussion)","volume":"41","author":"Gittins J. C.","year":"1979","unstructured":"J. C. Gittins. Bandit processes and dynamic allocation indices (with discussion). J. Roy. Statist. Soc. Ser. B, 41:148--177, 1979.","journal-title":"J. Roy. Statist. Soc. Ser. B"},{"key":"e_1_3_2_1_15_1","volume-title":"30th ICML","author":"Ho Chien-Ju","year":"2013","unstructured":"Chien-Ju Ho, Shahin Jabbari, and Jennifer Wortman Vaughan. Adaptive task assignment for crowdsourced classification. In 30th ICML, 2013."},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/1837885.1837906"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1093\/biomet\/66.1.171"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.5555\/2343576.2343643"},{"key":"e_1_3_2_1_19_1","first-page":"1953","volume-title":"25th NIPS","author":"Karger David R.","year":"2011","unstructured":"David R. Karger, Sewoong Oh, and Devavrat Shah. Iterative learning for reliable crowdsourcing systems. In 25th NIPS, pages 1953--1961, 2011."},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/1390156.1390241"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.5555\/2908698.2908706"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/2213836.2213878"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/2009916.2010057"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/1401890.1401965"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/2692359.2692364"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.5555\/1613715.1613751"},{"key":"e_1_3_2_1_27_1","volume-title":"On the likelihood that one unknown probability exceeds another in view of the evidence of two samples. Biometrika, 25(3--4):285--294","author":"Thompson William R.","year":"1933","unstructured":"William R. Thompson. On the likelihood that one unknown probability exceeds another in view of the evidence of two samples. Biometrika, 25(3--4):285--294, 1933."}],"event":{"name":"SIGIR '16: The 39th International ACM SIGIR conference on research and development in Information Retrieval","sponsor":["SIGIR ACM Special Interest Group on Information Retrieval"],"location":"Pisa Italy","acronym":"SIGIR '16"},"container-title":["Proceedings of the 39th International ACM SIGIR conference on Research and Development in Information Retrieval"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2911451.2911514","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2911451.2911514","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:55:02Z","timestamp":1750222502000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2911451.2911514"}},"subtitle":["Adaptive Exploration for Collecting High Quality Labels"],"short-title":[],"issued":{"date-parts":[[2016,7,7]]},"references-count":27,"alternative-id":["10.1145\/2911451.2911514","10.1145\/2911451"],"URL":"https:\/\/doi.org\/10.1145\/2911451.2911514","relation":{},"subject":[],"published":{"date-parts":[[2016,7,7]]},"assertion":[{"value":"2016-07-07","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}