Maximum Distance Between Slater Orders and Copeland Orders of Tournaments
- 30 June 2010
- journal article
- research article
- Published by Springer Nature in Order
- Vol. 28 (1) , 99-119
Abstract
No abstract availableKeywords
This publication has 23 references indexed in Scilit:
- On the complexity of Slater’s problemsEuropean Journal of Operational Research, 2010
- An updated survey on the linear ordering problem for weighted or unweighted tournamentsAnnals of Operations Research, 2009
- A comparison between the prudent order and the ranking obtained with Borda's, Copeland's, Slater's and Kemeny's rulesMathematical Social Sciences, 2007
- NoteDiscrete Applied Mathematics, 1997
- New results on the computation of median ordersDiscrete Mathematics, 1997
- Condorcet choice correspondences: A set-theoretical comparisonMathematical Social Sciences, 1995
- The Copeland measure of Condorcet choice functionsDiscrete Applied Mathematics, 1994
- The median procedure in cluster analysis and social choice theoryMathematical Social Sciences, 1981
- Maximum-likelihood paired comparison rankingsBiometrika, 1966
- Inconsistencies in a schedule of paired comparisonsBiometrika, 1961