2024/12/11 by Jean-Pierre Magnot, Magnot, Jean-Pierre
Computer Science · Decision Sciences · #81T13 #90B50 #91B06 #Advanced Algebra and Logic #FOS: Computer and information sciences #Information Theory (cs.IT) #Multi-Criteria Decision Making
paper · pdf · doi:10.48550/arxiv.2501.14738
openalex publication_date 2024/12/11 · openalex created_date 2025/10/10 · openalex updated_date 2026/08/01
We attack the problem of getting a strict ranking (i.e. a ranking without equally ranked items) of n items from a pairwise comparisons matrix. Basic structures are described, a first heuristical approach based on a condition, the R-condition, is proposed. Analyzing the limits of this ranking procedure, we finish with a minimization problem which can be applied to a wider class of pairwise comparisons matrices. If solved, it produces consistent pairwise comparisons that produce a strict ranking.