Pages that link to "Item:Q2304078"
From MaRDI portal
The following pages link to Distance and consensus for preference relations corresponding to ordered partitions (Q2304078):
Displaying 12 items.
- Accurate algorithms for identifying the median ranking when dealing with weak and partial rankings under the Kemeny axiomatic approach (Q62323) (← links)
- A recursive partitioning method for the prediction of preference rankings based upon Kemeny distances (Q316726) (← links)
- Concordance and consensus (Q545367) (← links)
- Ordinal ranking and preference strength (Q1085765) (← links)
- A general framework for distance-based consensus in ordinal ranking models (Q1278508) (← links)
- A re-characterization of the Kemeny distance (Q1633666) (← links)
- A linear ordering problem of sets (Q2173116) (← links)
- Rationalizations of Condorcet-consistent rules via distances of Hamming type (Q2450151) (← links)
- A Generalized Network Formulation of the Pairwise Comparison Consensus Ranking Model (Q3734117) (← links)
- An axiomatic approach to distance on partial orderings (Q3747180) (← links)
- Note—Ordinal Ranking and Intensity of Preference: A Linear Programming Approach (Q3755189) (← links)
- A family of distances for preference-approvals (Q6170568) (← links)
