{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T18:00:10Z","timestamp":1761674410112,"version":"build-2065373602"},"reference-count":33,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"6","license":[{"start":{"date-parts":[[2025,11,1]],"date-time":"2025-11-01T00:00:00Z","timestamp":1761955200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2025,11,1]],"date-time":"2025-11-01T00:00:00Z","timestamp":1761955200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2025,11,1]],"date-time":"2025-11-01T00:00:00Z","timestamp":1761955200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Netw. Sci. Eng."],"published-print":{"date-parts":[[2025,11]]},"DOI":"10.1109\/tnse.2025.3575231","type":"journal-article","created":{"date-parts":[[2025,6,3]],"date-time":"2025-06-03T13:52:47Z","timestamp":1748958767000},"page":"4741-4756","source":"Crossref","is-referenced-by-count":0,"title":["Ranking a Set of Objects Using Heterogeneous Workers: QUITE an Easy Problem"],"prefix":"10.1109","volume":"12","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-8258-051X","authenticated-orcid":false,"given":"Alessandro","family":"Nordio","sequence":"first","affiliation":[{"name":"CNR-IEIIT (Institute of Electronics, Telecommunications and Information Engineering of the National Research Council of Italy), Torino, Italy"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0246-6405","authenticated-orcid":false,"given":"Alberto","family":"Tarable","sequence":"additional","affiliation":[{"name":"CNR-IEIIT (Institute of Electronics, Telecommunications and Information Engineering of the National Research Council of Italy), Torino, Italy"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3070-4274","authenticated-orcid":false,"given":"Emilio","family":"Leonardi","sequence":"additional","affiliation":[{"name":"DET, Politecnico di Torino, Torino, Italy"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1145\/1242572.1242643"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.7551\/mitpress\/7503.003.0076"},{"issue":"1","key":"ref3","first-page":"7246","article-title":"Simple, robust and optimal ranking from pairwise comparisons","volume":"18","author":"Shah","year":"2017","journal-title":"J. Mach. Learn. Res."},{"issue":"19","key":"ref4","first-page":"1","article-title":"Ranking and synchronization from pairwise measurements via SVD","volume-title":"J. Mach. Learn. Res.","volume":"22","author":"d\u2019Aspremont","year":"2021"},{"key":"ref5","first-page":"7060","article-title":"Maxing and ranking with few assumptions","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Falahatgar","year":"2017"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TNSE.2021.3053423"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v34i04.5860"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1287\/opre.2022.2313"},{"key":"ref9","first-page":"297","article-title":"Active ranking without strong stochastic transitivity","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","volume":"35","author":"Lou","year":"2022"},{"key":"ref10","first-page":"1178","article-title":"$\\ell _\\infty$-bounds of the MLE in the BTL model under general comparison graphs","volume-title":"Proc. Uncertainty Artif. Intell.","author":"Li","year":"2022"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.2307\/2346567"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.2307\/2334029"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1037\/14396-000"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1037\/h0065439"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1348\/000711099158973"},{"key":"ref16","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1111\/j.1756-8765.2011.01175.x","article-title":"A model-based approach to measuring expertise in ranking tasks","volume":"4","author":"Lee","year":"2012","journal-title":"Topics Cogn. Sci."},{"key":"ref17","first-page":"11014","article-title":"Adaptive sampling for heterogeneous rank aggregation from noisy pairwise comparisons","volume-title":"Proc. 25th Int. Conf. Artif. Intell. Statist.","volume":"151","author":"Wu","year":"2022"},{"key":"ref18","first-page":"604","article-title":"Online rank elicitation for Plackett-Luce: A dueling bandits approach","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Szrnyi","year":"2015"},{"key":"ref19","first-page":"1088","article-title":"Maximum selection and ranking under noisy comparisons","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Falahatgar","year":"2017"},{"key":"ref20","first-page":"1426","article-title":"The limits of maxing, ranking, and preference learning","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Falahatgar","year":"2018"},{"issue":"217","key":"ref21","first-page":"1","article-title":"Bayesian decision process for cost-efficient dynamic ranking via crowdsourcing","volume":"17","author":"Chen","year":"2016","journal-title":"J. Mach. Learn. Res."},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1145\/2433396.2433420"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1145\/3183713.3183762"},{"key":"ref24","first-page":"127","article-title":"Bump functions and partitions of unity","volume-title":"An Introduction to Manifolds","author":"Tu","year":"2008"},{"issue":"1","key":"ref25","first-page":"2049","article-title":"Estimation from pairwise comparisons: Sharp minimax bounds with topology dependence","volume":"17","author":"Shah","year":"2016","journal-title":"J. Mach. Learn. Res."},{"key":"ref26","first-page":"2702","article-title":"Graph resistance and learning from pairwise comparisons","volume-title":"Proc. 36th Int. Conf. Mach. Learn.","author":"Hendrickx","year":"2019"},{"article-title":"Top-$ K$ ranking from pairwise comparisons: When spectral ranking is optimal","year":"2016","author":"Jang","key":"ref27"},{"key":"ref28","first-page":"371","article-title":"Spectral MLE: Top-k rank aggregation from pairwise comparisons","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Chen","year":"2015"},{"key":"ref29","first-page":"2474","article-title":"Iterative ranking from pair-wise comparisons","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Negahban","year":"2012"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1287\/opre.2016.1534"},{"article-title":"Least squares ranking on graphs, hodge Laplacians, time optimality, and iterative methods","year":"2011","author":"Hirani","key":"ref31"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/TNSE.2016.2523761"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1214\/18-aos1772"}],"container-title":["IEEE Transactions on Network Science and Engineering"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/6488902\/11217296\/11023038.pdf?arnumber=11023038","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T17:37:07Z","timestamp":1761673027000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/11023038\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,11]]},"references-count":33,"journal-issue":{"issue":"6"},"URL":"https:\/\/doi.org\/10.1109\/tnse.2025.3575231","relation":{},"ISSN":["2327-4697","2334-329X"],"issn-type":[{"type":"electronic","value":"2327-4697"},{"type":"electronic","value":"2334-329X"}],"subject":[],"published":{"date-parts":[[2025,11]]}}}