Incomplete pairwise comparison matrices in multi-attribute decision making

S. Bozóki, J. Fülöp, L. Rónyai

Research output: Chapter in Book/Report/Conference proceedingConference contribution

2 Citations (Scopus)

Abstract

An extension of the pairwise comparison matrix is considered when some comparisons are missing. A generalization of the eigenvector method for the incomplete case is introduced and discussed as well as the Logarithmic Least Squares Method. The uniqueness problem regarding both weighting methods is studied through the graph representation of pairwise comparison matrices. It is shown that the optimal completion/solution is unique if and only if the graph associated with the incomplete pairwise comparison matrix is connected. An algorithm is proposed for solving the eigenvalue minimization problem related to the generalization of the eigenvector method in the incomplete case. Numerical examples are presented for illustration of the methods discussed in the paper.

Original languageEnglish
Title of host publicationIEEM 2009 - IEEE International Conference on Industrial Engineering and Engineering Management
Pages2256-2260
Number of pages5
DOIs
Publication statusPublished - 2009
EventIEEE International Conference on Industrial Engineering and Engineering Management, IEEM 2009 - Hong Kong, China
Duration: Dec 8 2009Dec 11 2009

Other

OtherIEEE International Conference on Industrial Engineering and Engineering Management, IEEM 2009
CountryChina
CityHong Kong
Period12/8/0912/11/09

Fingerprint

Decision making
Eigenvalues and eigenfunctions
Multi-attribute decision making
Pairwise comparisons
Graph

Keywords

  • Eigenvalue optimization
  • Incomplete pairwise comparison matrix
  • Multi-attribute decision making

ASJC Scopus subject areas

  • Management of Technology and Innovation
  • Information Systems and Management
  • Industrial and Manufacturing Engineering
  • Safety, Risk, Reliability and Quality

Cite this

Bozóki, S., Fülöp, J., & Rónyai, L. (2009). Incomplete pairwise comparison matrices in multi-attribute decision making. In IEEM 2009 - IEEE International Conference on Industrial Engineering and Engineering Management (pp. 2256-2260). [5373064] https://doi.org/10.1109/IEEM.2009.5373064

Incomplete pairwise comparison matrices in multi-attribute decision making. / Bozóki, S.; Fülöp, J.; Rónyai, L.

IEEM 2009 - IEEE International Conference on Industrial Engineering and Engineering Management. 2009. p. 2256-2260 5373064.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Bozóki, S, Fülöp, J & Rónyai, L 2009, Incomplete pairwise comparison matrices in multi-attribute decision making. in IEEM 2009 - IEEE International Conference on Industrial Engineering and Engineering Management., 5373064, pp. 2256-2260, IEEE International Conference on Industrial Engineering and Engineering Management, IEEM 2009, Hong Kong, China, 12/8/09. https://doi.org/10.1109/IEEM.2009.5373064
Bozóki S, Fülöp J, Rónyai L. Incomplete pairwise comparison matrices in multi-attribute decision making. In IEEM 2009 - IEEE International Conference on Industrial Engineering and Engineering Management. 2009. p. 2256-2260. 5373064 https://doi.org/10.1109/IEEM.2009.5373064
Bozóki, S. ; Fülöp, J. ; Rónyai, L. / Incomplete pairwise comparison matrices in multi-attribute decision making. IEEM 2009 - IEEE International Conference on Industrial Engineering and Engineering Management. 2009. pp. 2256-2260
@inproceedings{a2048e0c09764610b1377f0f22412e6a,
title = "Incomplete pairwise comparison matrices in multi-attribute decision making",
abstract = "An extension of the pairwise comparison matrix is considered when some comparisons are missing. A generalization of the eigenvector method for the incomplete case is introduced and discussed as well as the Logarithmic Least Squares Method. The uniqueness problem regarding both weighting methods is studied through the graph representation of pairwise comparison matrices. It is shown that the optimal completion/solution is unique if and only if the graph associated with the incomplete pairwise comparison matrix is connected. An algorithm is proposed for solving the eigenvalue minimization problem related to the generalization of the eigenvector method in the incomplete case. Numerical examples are presented for illustration of the methods discussed in the paper.",
keywords = "Eigenvalue optimization, Incomplete pairwise comparison matrix, Multi-attribute decision making",
author = "S. Boz{\'o}ki and J. F{\"u}l{\"o}p and L. R{\'o}nyai",
year = "2009",
doi = "10.1109/IEEM.2009.5373064",
language = "English",
isbn = "9781424448708",
pages = "2256--2260",
booktitle = "IEEM 2009 - IEEE International Conference on Industrial Engineering and Engineering Management",

}

TY - GEN

T1 - Incomplete pairwise comparison matrices in multi-attribute decision making

AU - Bozóki, S.

AU - Fülöp, J.

AU - Rónyai, L.

PY - 2009

Y1 - 2009

N2 - An extension of the pairwise comparison matrix is considered when some comparisons are missing. A generalization of the eigenvector method for the incomplete case is introduced and discussed as well as the Logarithmic Least Squares Method. The uniqueness problem regarding both weighting methods is studied through the graph representation of pairwise comparison matrices. It is shown that the optimal completion/solution is unique if and only if the graph associated with the incomplete pairwise comparison matrix is connected. An algorithm is proposed for solving the eigenvalue minimization problem related to the generalization of the eigenvector method in the incomplete case. Numerical examples are presented for illustration of the methods discussed in the paper.

AB - An extension of the pairwise comparison matrix is considered when some comparisons are missing. A generalization of the eigenvector method for the incomplete case is introduced and discussed as well as the Logarithmic Least Squares Method. The uniqueness problem regarding both weighting methods is studied through the graph representation of pairwise comparison matrices. It is shown that the optimal completion/solution is unique if and only if the graph associated with the incomplete pairwise comparison matrix is connected. An algorithm is proposed for solving the eigenvalue minimization problem related to the generalization of the eigenvector method in the incomplete case. Numerical examples are presented for illustration of the methods discussed in the paper.

KW - Eigenvalue optimization

KW - Incomplete pairwise comparison matrix

KW - Multi-attribute decision making

UR - http://www.scopus.com/inward/record.url?scp=77949515948&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=77949515948&partnerID=8YFLogxK

U2 - 10.1109/IEEM.2009.5373064

DO - 10.1109/IEEM.2009.5373064

M3 - Conference contribution

AN - SCOPUS:77949515948

SN - 9781424448708

SP - 2256

EP - 2260

BT - IEEM 2009 - IEEE International Conference on Industrial Engineering and Engineering Management

ER -