Creating a consensus ranking of proposals from reviewers' partial ordinal rankings

DOI10.1016/j.cor.2005.05.030zbMath1102.90073OpenAlexW1965794541MaRDI QIDQ856671

Tal Raviv, Boaz Golany, Michal Penn, Wade D. Cook

Publication date: 7 December 2006

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2005.05.030

zbMATH Keywords

branch-and-bound algorithmspeer review

Mathematics Subject Classification ID

Measures of association (correlation, canonical correlation, etc.) (62H20) Decision theory (91B06) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Management decision making, including multiple objectives (90B50) Statistical ranking and selection procedures (62F07)

Related Items (18)

An agglomerative hierarchical clustering algorithm for linear ordinal rankings ⋮ Discovering a taste for the unusual: exceptional models for preference mining ⋮ A new group ranking approach for ordinal preferences based on group maximum consensus sequences ⋮ Identifying conflict patterns to reach a consensus -- a novel group decision approach ⋮ A new correlation coefficient for comparing and aggregating non-strict and incomplete rankings ⋮ An alternative polynomial-sized formulation and an optimization based heuristic for the reviewer assignment problem ⋮ Accurate algorithms for identifying the median ranking when dealing with weak and partial rankings under the Kemeny axiomatic approach ⋮ A differential evolution algorithm for finding the median ranking under the Kemeny axiomatic approach ⋮ Concordance and consensus ⋮ The Minimum Acceptable Violation Ranking of Alternatives from Voters’ Ordinal Rankings ⋮ Accentuating the rank positions in an agreement index with reference to a consensus order ⋮ Distance-based and ad hoc consensus models in ordinal preference ranking ⋮ Efficient algorithms using subiterative convergence for Kemeny ranking problem ⋮ Creating an acceptable consensus ranking for group decision making ⋮ Measuring Olympics performance based on a distance-based approach ⋮ Mining maximum consensus sequences from group ranking data ⋮ A New Binary Programming Formulation and Social Choice Property for Kemeny Rank Aggregation ⋮ A novel group ranking model for revealing sequence and quantity knowledge

Uses Software

• LEDA

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A classification of tournaments having an acyclic tournament as a minimum feedback arc set
• Preference relations on actions and criteria in multicriteria decision making
• A multicriteria evaluation of methods for obtaining weights from ratio- scale matrices
• Ranking with Partial Information: A Method and an Application
• On the Minimum Violations Ranking of a Tournament
• On the Borda-Kendall Consensus Method for Priority Ranking Problems
• Priority Ranking and Consensus Formation
• Preference Structures. II: Distances Between Asymmetric Relations

This page was built for publication: Creating a consensus ranking of proposals from reviewers' partial ordinal rankings