{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,25]],"date-time":"2025-10-25T12:39:00Z","timestamp":1761395940626,"version":"3.37.3"},"reference-count":23,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"1","license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"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":[[2021,1,1]]},"DOI":"10.1109\/tnse.2021.3053423","type":"journal-article","created":{"date-parts":[[2021,1,21]],"date-time":"2021-01-21T21:13:25Z","timestamp":1611263605000},"page":"803-813","source":"Crossref","is-referenced-by-count":5,"title":["Ranking a Set of Objects: A Graph Based Least-Square Approach"],"prefix":"10.1109","volume":"8","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-0455-9357","authenticated-orcid":false,"given":"Evgenia","family":"Christoforou","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8258-051X","authenticated-orcid":false,"given":"Alessandro","family":"Nordio","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0246-6405","authenticated-orcid":false,"given":"Alberto","family":"Tarable","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3070-4274","authenticated-orcid":false,"given":"Emilio","family":"Leonardi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref10","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":"ref11","article-title":"Graph resistance and learning from pairwise comparisons","author":"hendrickx","year":"0","journal-title":"Proc 36th Int Conf Mach Learn Int Mach Learn Soc"},{"article-title":"Top-$ k$ ranking from pairwise comparisons: When spectral ranking is optimal","year":"0","author":"jang","key":"ref12"},{"key":"ref13","first-page":"371","article-title":"Spectral mle: Top-k rank aggregation from pairwise comparisons","author":"chen","year":"0","journal-title":"Proc Int Conf Mach Learn"},{"key":"ref14","first-page":"2474","article-title":"Iterative ranking from pair-wise comparisons","author":"negahban","year":"0","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref15","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":"0","author":"hirani","key":"ref16"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.21236\/ADA625017"},{"article-title":"Ranking and synchronization from pairwise measurements via SVD","year":"0","author":"aspremont","key":"ref18"},{"article-title":"Active ranking from pairwise comparisons and when parametric assumptions don","year":"0","author":"heckel","key":"ref19"},{"journal-title":"Individual Choice Behavior A Theoretical Analysis","year":"2012","author":"luce","key":"ref4"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.2307\/2346567"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.2307\/2334029"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1037\/h0065439"},{"key":"ref8","first-page":"1088","article-title":"Maximum selection and ranking under noisy comparisons","author":"falahatgar","year":"0"},{"key":"ref7","first-page":"604","article-title":"Online rank elicitation for plackett-luce: A dueling bandits approach","author":"sz\u00f6r\u00e9nyi","year":"0","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref2","first-page":"569","article-title":"Trueskill: A. Bayesian Skill Rating System","author":"herbrich","year":"2007","journal-title":"Proc Adv Neural Inf Process Syst 19"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1145\/1242572.1242643"},{"key":"ref9","first-page":"1427","article-title":"The limits of maxing, ranking, and preference learning","author":"falahatgar","year":"0","journal-title":"Proc Int Conf Mach Learn"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1137\/080726082"},{"key":"ref22","first-page":"7063","article-title":"Maxing and ranking with few assumptions","author":"falahatgar","year":"0","journal-title":"Proc Adv Neural Inf Process Syst"},{"journal-title":"Markov Chains","year":"1976","author":"kemeny","key":"ref21"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511814068"}],"container-title":["IEEE Transactions on Network Science and Engineering"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6488902\/9380808\/09330581.pdf?arnumber=9330581","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,5,10]],"date-time":"2022-05-10T14:53:36Z","timestamp":1652194416000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9330581\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,1,1]]},"references-count":23,"journal-issue":{"issue":"1"},"URL":"https:\/\/doi.org\/10.1109\/tnse.2021.3053423","relation":{},"ISSN":["2327-4697","2334-329X"],"issn-type":[{"type":"electronic","value":"2327-4697"},{"type":"electronic","value":"2334-329X"}],"subject":[],"published":{"date-parts":[[2021,1,1]]}}}