Theoretical Computer Science
Generalization of a new definition of consistency for pairwise comparisons
Information Processing Letters
A new definition of consistency of pairwise comparisons
Mathematical and Computer Modelling: An International Journal
Some Remarks on Approximations of Arbitrary Binary Relations by Partial Orders
RSCTC '08 Proceedings of the 6th International Conference on Rough Sets and Current Trends in Computing
Pairwise Comparisons Based Non-Numerical Ranking
Fundamenta Informaticae - Fundamentals of Knowledge Technology
Counting all common subsequences to order alternatives
RSKT'07 Proceedings of the 2nd international conference on Rough sets and knowledge technology
Ranking with partial orders and pairwise comparisons
RSKT'08 Proceedings of the 3rd international conference on Rough sets and knowledge technology
Approximations of arbitrary binary relations by partial orders: classical and rough set models
Transactions on rough sets XIII
Remarks on pairwise comparison numerical and non-numerical rankings
RSKT'11 Proceedings of the 6th international conference on Rough sets and knowledge technology
Pairwise Comparisons Based Non-Numerical Ranking
Fundamenta Informaticae - Fundamentals of Knowledge Technology
| Hi-index | 0.09 |
A new approach to the problem of a group ranking is presented. The solution satisfies four of Arrow's six axioms [1,2] and is sufficient for a wide range of applications. A constructive algorithm is proposed for finding a group ranking on the basis of individual rankings of which some may collide with others