Transitive matrices, strict preference order and ordinal evaluation operators
From MaRDI portal
Publication:862551
DOI10.1007/s00500-005-0020-zzbMath1134.90419OpenAlexW2087586863MaRDI QIDQ862551
Publication date: 24 January 2007
Published in: Soft Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00500-005-0020-z
Related Items (3)
Deriving weights from a pairwise comparison matrix over an alo-group ⋮ Characterizations of consistent pairwise comparison matrices over abelian linearly ordered groups ⋮ A general unified framework for pairwise comparison matrices in multicriterial methods
Cites Work
- Eigenvector and logarithmic least squares
- Procedures for synthesizing ratio judgements
- Ranking alternatives - comparison of different methods based on binary comparison matrices
- A geometric averaging procedure for constructing supertransitive approximation to binary comparison matrices
- ORDERINGS FOR CLASSES OF AGGREGATION OPERATORS
- Axiomatic Foundation of the Analytic Hierarchy Process
- On ordered weighted averaging aggregation operators in multicriteria decisionmaking
- WEAK CONSISTENCY AND QUASI-LINEAR MEANS IMPLY THE ACTUAL RANKING
- Measurement Theory
This page was built for publication: Transitive matrices, strict preference order and ordinal evaluation operators