A weak order solution to a group ranking and consistency-driven pairwise comparisons

摘要

A novel non-numerical algorithm, based on a partial order, for solving a group ranking problem is compared with the more traditional consistency-driven approach. Both approaches are based on the fundamental concept of pairwise comparisons. Potential applications are discussed.