Comparing methods for multiattribute decision making with ordinal weights
Computers and Operations Research
Multiattribute choice with ordinal information: a comparison of different decision rules
IEEE Transactions on Systems, Man, and Cybernetics, Part A: Systems and Humans
Stable Rankings in Collective Decision Making with Imprecise Information
ADT '09 Proceedings of the 1st International Conference on Algorithmic Decision Theory
Ranking Methods Based on Dominance Measures Accounting for Imprecision
ADT '09 Proceedings of the 1st International Conference on Algorithmic Decision Theory
Computers and Operations Research
Systematic decision process for intelligent decision making
Journal of Intelligent Manufacturing
Sensor data driven proactive management of infrastructure systems
EG-ICE'06 Proceedings of the 13th international conference on Intelligent Computing in Engineering and Architecture
Ordering based decision making - A survey
Information Fusion
Multi-objective energy aware multiprocessor scheduling using bat intelligence
Journal of Intelligent Manufacturing
Journal of Intelligent Manufacturing
A linguistic multi-criteria decision making approach based on logical reasoning
Information Sciences: an International Journal
Hi-index | 0.00 |
This paper consists of three parts: 1) some theories and an efficient algorithm for ranking and screening multicriteria alternatives when there exists partial information on the decision maker's preferences; 2) generation of partial information using variety of methods; and 3) the existence of ordinal and cardinal functions based on and strengths of preferences. We demonstrate that strengths of preference concept can be very effectively used to generate the partial information on preferences. We propose axioms for ordinal and cardinal (measurable) value functions. An algorithm is developed for ranking and screening alternatives when there exists partial information about the preferences and the ordering of alternatives. The proposed algorithm obtains the same information very efficiently while by solving one mathematical programming problem many alternatives can be ranked and screened. Several examples are discussed and results of some computational experiments are reported