{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,14]],"date-time":"2026-03-14T09:49:42Z","timestamp":1773481782993,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":21,"publisher":"ACM","license":[{"start":{"date-parts":[[2012,4,16]],"date-time":"2012-04-16T00:00:00Z","timestamp":1334534400000},"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":[[2012,4,16]]},"DOI":"10.1145\/2187836.2187969","type":"proceedings-article","created":{"date-parts":[[2012,4,24]],"date-time":"2012-04-24T18:41:27Z","timestamp":1335292887000},"page":"989-998","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":76,"title":["Max algorithms in crowdsourcing environments"],"prefix":"10.1145","author":[{"given":"Petros","family":"Venetis","sequence":"first","affiliation":[{"name":"Stanford University, Stanford, CA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hector","family":"Garcia-Molina","sequence":"additional","affiliation":[{"name":"Stanford University, Stanford, CA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kerui","family":"Huang","sequence":"additional","affiliation":[{"name":"UC Santa Cruz, Santa Cruz, CA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Neoklis","family":"Polyzotis","sequence":"additional","affiliation":[{"name":"UC Santa Cruz, Santa Cruz, CA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2012,4,16]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"http:\/\/www.mturk.com\/, sep","author":"Turk Amazon Mechanical","year":"2011","unstructured":"Amazon Mechanical Turk . http:\/\/www.mturk.com\/, sep 2011 . Amazon Mechanical Turk. http:\/\/www.mturk.com\/, sep 2011."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0166-218X(96)00012-1"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-02927-1_5"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1109\/FSCS.1990.89546"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1016\/0166-218X(83)90095-1"},{"key":"e_1_3_2_1_6_1","unstructured":"M. de Condorcet. Essai Sur L'Application De L'Analyse \u00c0 La Probabilit\u00e9 Des D\u00e9cisions Rendues \u00c0 La Pluralit\u00e9 Des Voix. 1785.  M. de Condorcet. Essai Sur L'Application De L'Analyse \u00c0 La Probabilit\u00e9 Des D\u00e9cisions Rendues \u00c0 La Pluralit\u00e9 Des Voix. 1785."},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/100216.100230"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539791195877"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1007\/11561071_1"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1007\/11786986_26"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/1007352.1007375"},{"key":"e_1_3_2_1_12_1","first-page":"465","volume":"3","author":"H\u00e4ggkvist R.","year":"1981","unstructured":"R. H\u00e4ggkvist and P. Hell . Sorting and Merging in Rounds. SIAM J. on Matrix Analysis and Applications , 3 : 465 -- 473 , 1981 . R. H\u00e4ggkvist and P. Hell. Sorting and Merging in Rounds. SIAM J. on Matrix Analysis and Applications, 3:465--473, 1981.","journal-title":"Sorting and Merging in Rounds. SIAM J. on Matrix Analysis and Applications"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-13073-1_3"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1111\/1467-9760.00128"},{"key":"e_1_3_2_1_15_1","first-page":"13","volume":"5","author":"Marcus A.","year":"2011","unstructured":"A. Marcus , E. Wu , D. Karger , S. Madden , and R. Miller . Human-Powered Sorts and Joins. PVLDB , 5 : 13 -- 24 , Sept. 2011 . A. Marcus, E. Wu, D. Karger, S. Madden, and R. Miller. Human-Powered Sorts and Joins. PVLDB, 5:13--24, Sept. 2011.","journal-title":"Human-Powered Sorts and Joins. PVLDB"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.5555\/28220.28227"},{"key":"e_1_3_2_1_17_1","first-page":"399","volume-title":"COMSOC","author":"Ronald","year":"2010","unstructured":"Ronald L. Rivest and Emily Shen. An Optimal Single-Winner Preferential Voting System based on Game Theory . In COMSOC , pages 399 -- 410 , 2010 . Ronald L. Rivest and Emily Shen. An Optimal Single-Winner Preferential Voting System based on Game Theory. In COMSOC, pages 399--410, 2010."},{"key":"e_1_3_2_1_18_1","volume-title":"Workshop on Computational Social Science and the Wisdom of Crowds (NIPS)","author":"Sun Y.-A.","year":"2011","unstructured":"Y.-A. Sun , C. R. Dance , S. Roy , and G. Little . How to Assure the Quality of Human Computation Tasks When Majority Voting Fails ? Workshop on Computational Social Science and the Wisdom of Crowds (NIPS) , 2011 . Y.-A. Sun, C. R. Dance, S. Roy, and G. Little. How to Assure the Quality of Human Computation Tasks When Majority Voting Fails? Workshop on Computational Social Science and the Wisdom of Crowds (NIPS), 2011."},{"key":"e_1_3_2_1_19_1","volume-title":"Max algorithms in crowdsourcing environments. Technical report","author":"Venetis P.","unstructured":"P. Venetis , H. Garcia-Molina , K. Huang , and N. Polyzotis . Max algorithms in crowdsourcing environments. Technical report , Stanford University . http:\/\/ilpubs.stanford.edu:8090\/1017\/. P. Venetis, H. Garcia-Molina, K. Huang, and N. Polyzotis. Max algorithms in crowdsourcing environments. Technical report, Stanford University. http:\/\/ilpubs.stanford.edu:8090\/1017\/."},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1109\/MC.2006.196"},{"key":"e_1_3_2_1_21_1","volume-title":"USA","author":"Yao A. C.","year":"1979","unstructured":"A. C. Yao and F. F. Yao . On Fault-Tolerant Networks for Sorting. Technical report, Stanford, CA , USA , 1979 . A. C. Yao and F. F. Yao. On Fault-Tolerant Networks for Sorting. Technical report, Stanford, CA, USA, 1979."}],"event":{"name":"WWW 2012: 21st World Wide Web Conference 2012","location":"Lyon France","acronym":"WWW 2012","sponsor":["Univ. de Lyon Universite de Lyon","SIGWEB ACM Special Interest Group on Hypertext, Hypermedia, and Web"]},"container-title":["Proceedings of the 21st international conference on World Wide Web"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2187836.2187969","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2187836.2187969","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T10:06:35Z","timestamp":1750241195000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2187836.2187969"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,4,16]]},"references-count":21,"alternative-id":["10.1145\/2187836.2187969","10.1145\/2187836"],"URL":"https:\/\/doi.org\/10.1145\/2187836.2187969","relation":{},"subject":[],"published":{"date-parts":[[2012,4,16]]},"assertion":[{"value":"2012-04-16","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}