Rank Centrality: Ranking from Pairwise Comparisons

From MaRDI portal
Publication:5739125

DOI10.1287/opre.2016.1534zbMath1414.91133arXiv1209.1688OpenAlexW1517040319MaRDI QIDQ5739125

Sahand N. Negahban, Devavrat Shah, Sewoong Oh

Publication date: 2 June 2017

Published in: Operations Research (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1209.1688




Related Items

On the non-asymptotic concentration of heteroskedastic Wishart-type matrixStagewise learning for noisy \(k\)-ary preferencesPartial recovery for top-\(k\) ranking: optimality of MLE and suboptimality of the spectral methodOptimal full ranking from pairwise comparisonsRanking and selection for pairwise comparisonRandom walks and diffusion on networksRobust consumer preference analysis with a social networkA low-rank spectral method for learning Markov modelsLearning Markov Models Via Low-Rank OptimizationUnnamed ItemUnnamed ItemA General Pairwise Comparison Model for Extremely Sparse NetworksWorst-case versus average-case design for estimation from partial pairwise comparisonsLocalization in 1D non-parametric latent space models from pairwise affinitiesContagion Source Detection in Epidemic and Infodemic Outbreaks: Mathematical Analysis and Network AlgorithmsMulti-stage optimization models for individual consistency and group consensus with preference relationsTowards optimal estimation of bivariate isotonic matrices with unknown permutationsUnnamed ItemRanking recovery from limited pairwise comparisons using low-rank matrix completionData-driven fuzzy preference analysis from an optimization perspectiveGeneralized transitivity: a systematic comparison of concepts with an application to preferences in the Babington Smith modelA new decision making model based on rank centrality for GDM with fuzzy preference relationsSpectral method and regularized MLE are both optimal for top-\(K\) rankingUnnamed ItemTime-homogeneous top-K ranking using tensor decompositionsElicitability of Instance and Object RankingAsymptotically Optimal Sequential Design for Rank Aggregation