z-logo
open-access-imgOpen Access
Approximating consistency in pairwise comparisons
Author(s) -
Christopher Kuske,
Michael Soltys,
Konrad Kułakowski
Publication year - 2019
Publication title -
procedia computer science
Language(s) - Uncategorized
Resource type - Journals
SCImago Journal Rank - 0.334
H-Index - 76
ISSN - 1877-0509
DOI - 10.1016/j.procs.2019.09.240
Subject(s) - computer science , pairwise comparison , consistency (knowledge bases) , algorithm , theoretical computer science , artificial intelligence
We propose parametrized families of algorithms for approximating inconsistent matrices with consistent ones. We present experimental results, and optimize distance versus performance.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here
Accelerating Research

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom