On strict ranking by pairwise comparisons

[2501.14738] On strict ranking by pairwise comparisons Skip to main content Search Submit Donate Log in Search arXiv Press Enter to search · Advanced search Computer Science > Information Theory arXiv:2501.14738 (cs) [Submitted on 11 Dec 2024 ( v1 ), last revised 11 Apr 2026 (this version, v2)] Title: On strict ranking by pairwise comparisons Authors: Jean-Pierre Magnot View a PDF of the paper titled On strict ranking by pairwise comparisons, by Jean-Pierre Magnot View PDF HTML (experimental) Abstract: 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 $\mathcal{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. Comments: Postprint, accepted for publication in Annales Mathematicae Silesianae Subjects: Information Theory (cs.IT) MSC classes: 90B50, 81T13, 91B06 Cite as: arXiv:2501.14738 [cs.IT] (or arXiv:2501.14738v2 [cs.IT] for this version) https://doi.org/10.48550/arXiv.2501.14738 Focus to learn more arXiv-issued DOI via DataCite Submission history From: Jean-Pierre Magnot [ view email ] [v1] Wed, 11 Dec 2024 20:09:05 UTC (13 KB) [v2] Sat, 11 Apr 2026 08:47:46 UTC (15 KB) Full-text links: Access Paper: View a PDF of the paper titled On strict ranking by pairwise comparisons, by Jean-Pierre Magnot View PDF HTML (experimental) TeX Source view license Current browse context: cs.IT < prev | next > new | recent | 2025-01 Change to browse by: cs math math.IT References & Citations NASA ADS Google Scholar Semantic Scholar export BibTeX citation Loading... BibTeX formatted citation × loading... Data provided by: Bookmark Bibliographic Tools Bibliographic and Citation Tools Bibliographic Explorer Toggle Bibliographic Explorer ( What is the Explorer? ) Connected Papers Toggle Connected Papers ( What is Connected Papers? ) Litmaps Toggle Litmaps ( What is Litmaps? ) scite.ai Toggle scite Smart Citations ( What are Smart Citations? ) Code, Data, Media Code, Data and Media Associated with this Article alphaXiv Toggle alphaXiv ( What is alphaXiv? ) Links to Code Toggle CatalyzeX Code Finder for Papers ( What is CatalyzeX? ) DagsHub Toggle DagsHub ( What is DagsHub? ) GotitPub Toggle Gotit.pub ( What is GotitPub? ) Huggingface Toggle Hugging Face ( What is Huggingface? ) ScienceCast Toggle ScienceCast ( What is ScienceCast? ) Demos Demos Replicate Toggle Replicate ( What is Replicate? ) Spaces Toggle Hugging Face Spaces ( What is Spaces? ) Spaces Toggle TXYZ.AI ( What is TXYZ.AI? ) Related Papers Recommenders and Search Tools Link to Influence Flower Influence Flower ( What are Influence Flowers? ) Core recommender toggle CORE Recommender ( What is CORE? ) Author Venue Institution Topic About arXivLabs arXivLabs: experimental projects with community collaborators arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website. Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them. Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs . Which authors of this paper are endorsers? | Disable MathJax ( What is MathJax? ) We gratefully acknowledge support from our major funders , member institutions , , and all contributors. About · Help · Contact · Subscribe · Copyright · Privacy · Accessibility · Operational Status (opens in new tab) Major funding support from

Related documents

• Ranking Theory#741020
• TOPSIS-RAD: Ranking According to Desires#266221
• Feature selection with a lexicographic social ranking method ⋆#322584
• Can ranked-choice voting elect the least popular candidate?#665664
• Can ranked-choice voting elect the least popular candidate?#664164