A new correlation coefficient for comparing and aggregating non-strict and incomplete rankings
From MaRDI portal
Publication:2184062
DOI10.1016/j.ejor.2020.02.027zbMath1443.91120arXiv1801.07793OpenAlexW3007168087MaRDI QIDQ2184062
J. Kyle Skolfield, Adolfo R. Escobedo, Yeawon Yoo
Publication date: 27 May 2020
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1801.07793
group decisions and negotiationscorrelation and distance functionsnon-strict incomplete rankingsrobust ranking aggregation
Measures of association (correlation, canonical correlation, etc.) (62H20) Decision theory (91B06) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57)
Related Items
A new correlation coefficient between categorical, ordinal and interval variables with Pearson characteristics, A unifying rank aggregation framework to suitably and efficiently aggregate any kind of rankings, Derivations of large classes of facet defining inequalities of the weak order polytope using ranking structures, Approximate Condorcet partitioning: solving large-scale rank aggregation problems, An axiomatic distance methodology for aggregating multimodal evaluations, A New Binary Programming Formulation and Social Choice Property for Kemeny Rank Aggregation
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Accurate algorithms for identifying the median ranking when dealing with weak and partial rankings under the Kemeny axiomatic approach
- Computation of general correlation coefficients for interval data
- A recursive partitioning method for the prediction of preference rankings based upon Kemeny distances
- Why the magic number seven plus or minus two
- How to allocate review tasks for robust ranking
- Creating a consensus ranking of proposals from reviewers' partial ordinal rankings
- The coefficient of concordance for vague data
- Information and preference in partial orders: A bimatrix representation
- Voting schemes for which it can be difficult to tell who won the election
- Interactive group decision making procedure under incomplete information
- High-dimensional semiparametric Gaussian copula graphical models
- Space oriented rank-based data integration
- The repeated insertion model for rankings: missing link between two subset choice models
- Kendall's correlation coefficient for vague preferences
- Distance-based and ad hoc consensus models in ordinal preference ranking
- Statistical reasoning with set-valued information: ontic vs. epistemic views
- An Axiomatic Approach to Constructing Distances for Rank Comparison and Aggregation
- Multi-polar Aggregation
- NON-NULL RANKING MODELS. I
- Ordinal Ranking with Intensity of Preference
- Competitors of the Kendall-tau test for testing independence against positive quadrant dependence
- Preferential Arrangements
- Preference structures I: Distances between transitive preference relations†
- Preference Structures. II: Distances Between Asymmetric Relations
- A Consistent Extension of Condorcet’s Election Principle
- Criterion of distance between technical programming and socio-economic priority
- A new rank correlation coefficient with application to the consensus ranking problem
- Handbook of Computational Social Choice
- The Implicit Hitting Set Approach to Solve Combinatorial Optimization Problems with an Application to Multigenome Alignment
- Some Concepts of Dependence
- A NEW MEASURE OF RANK CORRELATION
- Machine Learning: ECML 2003
- Aggregating inconsistent information
