dc.contributor.advisor |
Soltys, Dr. Michael |
|
dc.contributor.author |
Kuske, Christopher |
|
dc.date.accessioned |
2018-05-01T18:29:38Z |
|
dc.date.available |
2018-05-01T18:29:38Z |
|
dc.date.issued |
2018-04-05 |
|
dc.identifier.uri |
http://hdl.handle.net/10211.3/202446 |
|
dc.description.abstract |
A method of generating a consistent Pairwise Comparison Matrix from an inconsistent matrix will be presented, a proposal for defining “closeness” between matrices will be discussed, and finally, various methods will be examined to find consistent matrices that are as close to the original inconsistent matrix as possible using a calculated distance described within.This thesis will propose several algorithms, compare their
performance, and examine their respective merits. |
en_US |
dc.format.extent |
78 |
en_US |
dc.language.iso |
en_US |
en_US |
dc.publisher |
California State University Channel Islands |
en_US |
dc.subject |
Computer Science Thesis |
en_US |
dc.subject |
Pairwise Comparisons |
en_US |
dc.subject |
Pairwise Matrices |
en_US |
dc.subject |
Consistency |
en_US |
dc.subject |
Inconsistency |
en_US |
dc.title |
Derivation of Consistent Pairwise Matrices |
en_US |
dc.type |
Thesis |
en_US |
dc.contributor.committeeMember |
Kulakowski, Dr. Konrad |
|
dc.contributor.committeeMember |
Pilarczyk, Dr. Pawel |
|
dc.contributor.committeeMember |
Shapiro, Dr. Joseph |
|