Axiomatic foundation of the analytic hierarchy process
Management Science
Remarks on the analytic hierarchy process
Management Science
Tolerance approximation spaces
Fundamenta Informaticae - Special issue: rough sets
A weak order solution to a group ranking and consistency-driven pairwise comparisons
Applied Mathematics and Computation
RSKD '93 Proceedings of the International Workshop on Rough Sets and Knowledge Discovery: Rough Sets, Fuzzy Sets and Knowledge Discovery
On the Rough Realations: An Alternative Formulation
RSFDGrC '99 Proceedings of the 7th International Workshop on New Directions in Rough Sets, Data Mining, and Granular-Soft Computing
A weak order approach to group ranking
Computers & Mathematics with Applications
Ranking with partial orders and pairwise comparisons
RSKT'08 Proceedings of the 3rd international conference on Rough sets and knowledge technology
Remarks on pairwise comparison numerical and non-numerical rankings
RSKT'11 Proceedings of the 6th international conference on Rough sets and knowledge technology
| Hi-index | 0.00 |
A systematic procedure for deriving weakly ordered non-numerical rankings from given sets of data is proposed and analysed. The data are assumed to be collected using the Pairwise Comparisons paradigm. The concept of a partially ordered approximation of an arbitrary binary relation is formally defined and some solutions are proposed. The problem of testing and the importance of indifference and the power of weak order extensions are also discussed.