Complex Ranking Procedures

• Autorzy: Sandrasagra B. , Soltys M.

Identyfikatory

DOI

10.3233/FI-2016-1331

• Języki publikacji: EN

Abstrakty

EN

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.

Słowa kluczowe

EN

complexes; ranking; paired comparisons; number theory; multiple

• Wydawca: IOS Press
• Czasopismo: Fundamenta Informaticae
• Rocznik: 2016
• Tom: Vol. 144, nr 3/4
• Strony: 223--240
• Opis fizyczny: Bibliogr. 36 poz., tab., wykr.

Twórcy

autor

Sandrasagra B.

• Toronto, Canada

autor

Soltys M.

• Dept. of Computer Science, California State University Channel Islands, One University Drive, Camarillo, CA 93012, USA.

Bibliografia

• [1] Kakiashvili T, Koczkodaj WW, Woodbury-Smith M. Improving the medical scale predictability by the pairwise comparisons method: evidence from a clinical data study. Comput Methods Programs Biomed. 2012;105(3):210–216. doi:10.1016/j.cmpb.2011.09.011.
• [2] Soltys M. Fair Ranking in Competitive Bidding Procurement: A Case Analysis. In: 18th International Conference in Knowledge Based and Intelligent Information and Engineering Systems, KES 2014, Gdynia, Poland, 15-17 September 2014. vol. 35; 2014. p. 1138–1144. Available from: http://dx.doi.org/10.1016/j.procs.2014.08.207. doi:10.1016/j.procs.2014.08.207.
• [3] Easley D, Kleinberg J. Networks, crowds, and markets: reasoning about a highly connected world. Cambridge University Press New York; 2010. ISBN:0521195330, 9780521195331.
• [4] Koczkodaj WW, Kułakowski K, Ligęza A. On the quality evaluation of scientific entities in Poland supported by consistency-driven pairwise comparisons method. Scientometrics. 2014;99(3):911–926. doi:10.1007/s11192-014-1258-y.
• [5] Brin S, Page L. The anatomy of a large-scale hypertextual web search engine. In: Proceedings of the seventh international conference on World Wide Web 7. vol. 30. Elsevier Science Publishers B. V. Amsterdam, The Netherlands, The Netherlands; 1998. p. 107–117. doi:10.1016/S0169-7552(98)00110-X.
• [6] Bozóki S, Rapcsák T. On Saaty’s and Koczkodaj’s inconsistencies of pairwise comparison matrices. Journal of Global Optimization. 200; 42(2):157–175. doi:10.1007/s10898-007-9236-z.
• [7] Cowan N. The magical number 4 in short-term memory: A reconsideration of mental storage capacity. Behavioral and Brain Sciences. 2001;24(1):87–114. PMID:11515286.
• [8] David HA. The method of paired comparisons. London: C. Griffin; New York: Oxford University Press; 1988. ISBN: 10:0852642903.
• [9] Ranking with partial orders and pairwise comparisons. vol. 5009 of Lecture Notes in Computer Science. Springer Berlin Heidelberg; 2008. doi:10.1007/978-3-540-79721-0 61.
• [10] Koczkodaj WW. A new definition of consistency of pairwise comparisons. Mathematical and Computer Modelling. 1993;18(7):79–84. doi:10.1016/0895-7177(93)90059-8.
• [11] Saaty TL. A scaling method for priorities in hierarchical structures. Journal of Mathematical Psychology. 1977;15(3):234–281. doi:10.1016/0022-2496(77)90033-5.
• [12] Hoare CAR. An axiomatic basis for computer programming. Communications of the ACM. 1969;12(10): 576–580. doi:10.1145/363235.363259.
• [13] Soltys M, Cook S. The proof complexity of linear algebra. Annals of Pure and Applied Logic. 2004;130(1-3):207–275. doi:10.1016/j.apal.2003.10.018.
• [14] Worthington RC. Legal obligations for public purchasers. Worthington and Associates Ltd., May, 2002; 2012.
• [15] Request for proposals for private security services for the 2015 Pan Am Parapan Am games. 2013;ID:PV.DP.ON.725805.C82153.
• [16] Brennan RJ. NDP wants probe of Pan Am security contract that went to U.S. firm. The Toronto Star. 2014.
• [17] Brennan RJ. NDP wants $81-million Pan Am security contract under microscope. The Hamilton Spectator. 2014;.
• [18] Brennan RJ. Auditor general to audit Pan Am Games security contract. The Toronto Star. 2014;Available from: http://on.thestar.com/1eedu02.
• [19] Kari S. Ontario Auditor-General to audit Pan Am contracts. Globe and Mail. 2014.
• [20] CONDORCET Md. Essai sur l’application de l’analyse ‘a la probabilit´e des d´ecisions rendues à la pluralité des vois. Paris, Imprimerie Royale; 1785.
• [21] Thurstone LL. A law of comparative judgement. Psychological Review. 1927; 34(4):278–286. Available from: http://dx.doi.org/10.1037/h0070288.
• [22] Dyer JS. Remarks on the analytic hierarchy process. Journal Management Science. 1990;36(6):249–258. doi:10.1287/mnsc.36.3.249.
• [23] Janicki R. Approximations of arbitrary relations by partial orders: Classical and rough set models.. vol. 6499 of Lecture Notes in Computer Science. Springer Berlin Heidelberg; 2011. doi:10.1007/978-3-642-18302-7 2.
• [24] Janicki R, Zhai Y. Remarks on pairwise comparison numerical and non-numerical rankings. vol. 6954 of Lecture Notes in Computer Science. Springer Berlin Heidelberg; 2011. doi:10.1007/978-3-642-24425-4 39.
• [25] van Vliet H. Software Engineering: Principles and Practice. Wiley; 2 edition (August 30, 2000); 2000. ISBN-10:0471975087, 13:978-0471975083.
• [26] Soltys M. An introduction to the analysis of algorithms. World Scientific Publishing Company; 2 edition; 2012. ISBN-10: 020140009X, 13: 978-0201400090.
• [27] Shustek L. Interview - An interview with C.A.R. Hoare. Communications of the ACM. 2009;52(3):38–41. doi:Interview - An interview with C.A.R. Hoare.
• [28] Cook S, Soltys M. Boolean programs and quantified propositional proof systems. Bulletin of the Section of Logic. 1999;28(3):119–129.
• [29] Soltys M. Berkowitz’s algorithm and clow sequences. Electronic Journal of Linear Algebra. 2002;9:42–54. Available from: http://dx.doi.org/10.13001/1081-3810.1072.
• [30] Soltys M. LA, permutations, and the Haj´os calculus. Theoretical Computer Science. 2005;348(2-3):321–333. doi:10.1007/978-3-540-27836-8 97.
• [31] Soltys M. Feasible proofs of matrix properties with Csanky’s algoritm. In: Computer Science Logic. vol. 3634 of Lecture Notes in Computer Science. Springer Berlin Heidelberg; 2005. p. 493–508. doi:10.1007/11538363 34.
• [32] Soltys M. Feasible proofs of Szpilrajn’s theorem: a proof-complexity framework for concurrent automata. Journal of Automata, Languages and Combinatorics (JALC). 2011;16(1):27–38.
• [33] Fülöp J. A method for approximating pairwise comparison matrices by consistent matrices. Journal of Global Optimization. 2008;42(3):423–442. doi:10.1007/s10898-008-9303-0.
• [34] B Thoms NG, Ryan T. The design and evaluation of a peer ratings system for online learning communities. 2010;p. 1–10. ISBN: 978-0-7695-3869-3. doi:10.1109/HICSS.2010.370.
• [35] Beatty J, Wiegers K. Software Requirements. 3 edition. Microsoft Press; 2013. ISBN: 10:0735679665.
• [36] Pawlak Z. Rough sets. International Journal of Computer & Information Sciences. 1982;11(5):341–356. doi:10.1007/BF01001956.