Approximating consistency in pairwise comparisons

Abstract

We propose parametrized families of algorithms for approximating inconsistent matrices with consistent ones. We present experimental results, and optimize distance versus performance.

Authors

Kuske C; Soltys M; Kułakowski K

Volume

159

Pagination

pp. 814-823

Publisher

Elsevier

Publication Date

January 1, 2019

DOI

10.1016/j.procs.2019.09.240

Conference proceedings

Procedia Computer Science

ISSN

1877-0509

Associated Experts

Michael Soltys

Adjunct Professor, Faculty of Engineering

Visit profile

Labels

Fields of Research (FoR)

46 Information and computing sciences

View published work (Non-McMaster Users)

View published work (McMaster Users)

Contact the Experts team

Get technical help

Provide website feedback