On Strict Ranking by Pairwise Comparisons
Abstract
This paper addresses the problem of obtaining a strict ranking (i.e., a ranking without equally ranked items) of n items based on a pairwise comparisons matrix. The basic structures are described and a heuristic approach based on a condition, the ℛ-condition is proposed. The limitations of this ranking procedure are analyzed.
Language: English
Submitted on: Mar 31, 2025
Accepted on: Mar 2, 2026
Published on: Apr 4, 2026
In partnership with: Paradigm Publishing Services
Publication frequency: 2 issues per year
Related subjects:
© 2026 Jean-Pierre Magnot, published by University of Silesia in Katowice, Institute of Mathematics
This work is licensed under the Creative Commons Attribution 4.0 License.