Complex Ranking Procedures

Issue title: Theory and Practice of Pairwise Comparisons

Guest editors: Ryszard Janicki and Konrad Kułakowski

Article type: Research Article

Authors: Sandrasagra, Barbara^a | Soltys, Michael^{b; *}

Affiliations: [a] Toronto, Canada | [b] Dept. of Computer Science, California State University Channel Islands, One University Drive, Camarillo, CA 93012, USA. michael.soltys@csuci.edu

Correspondence: [*] Address for correspondence: Dept. of Computer Science, California State University Channel Islands, One University Drive, Camarillo, CA 93012, USA

Abstract: We propose a research program for developing a formal framework for ranking procedures based on the Pairwise Comparisons method. We are interested in the case where relatively few items are to be ranked with a complex procedure and according to a large number of criteria. A typical example of this scenario is a competition where several companies bid for a contract, and where the selection of the winner is done with multiple criteria according to an intricate selection procedure. Several other applications are suggested.

DOI: 10.3233/FI-2016-1331

Journal: Fundamenta Informaticae, vol. 144, no. 3-4, pp. 223-240, 2016