An axiomatic approach to distance on partial orderings
From MaRDI portal
Publication:3747180
DOI10.1051/ro/1986200201151zbMath0607.90003OpenAlexW2476919546MaRDI QIDQ3747180
Moshe Kress, Wade D. Cook, Lawrence M. Seiford
Publication date: 1986
Published in: RAIRO - Operations Research (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/104894
Related Items
An agglomerative hierarchical clustering algorithm for linear ordinal rankings ⋮ Comparing boosting and bagging for decision trees of rankings ⋮ A new distance measure including the weak preference relation: application to the multiple criteria aggregation procedure for mixed evaluations ⋮ A METRIC PROCEDURE FOR CARDINAL PREFERENCES ⋮ Interval approximations of message causality in distributed executions ⋮ Consensus among preference rankings: a new weighted correlation coefficient for linear and weak orderings ⋮ Deriving a minimum distance-based collective preorder: a binary mathematical programming approach ⋮ An axiomatic distance methodology for aggregating multimodal evaluations ⋮ Weighted distance-based trees for ranking data ⋮ A differential evolution algorithm for finding the median ranking under the Kemeny axiomatic approach ⋮ Efficient algorithms using subiterative convergence for Kemeny ranking problem ⋮ Approaching rank aggregation problems by using evolution strategies: the case of the optimal bucket order problem ⋮ Mining maximum consensus sequences from group ranking data ⋮ Comparing series of rankings with ties by using complex networks: an analysis of the Spanish stock market (IBEX-35 index)
