Article ID: | iaor20128315 |
Volume: | 41 |
Issue: | 4 |
Start Page Number: | 735 |
End Page Number: | 751 |
Publication Date: | Aug 2013 |
Journal: | Omega |
Authors: | Sowiski Roman, Greco Salvatore, Kadziski Miosz |
Keywords: | programming: mathematical |
In this paper, we present a new preference disaggregation method, called RUTA, which infers a set of additive value functions from the preference information referring to the desired ranks of some reference alternatives. Real‐life experience indicates that people willingly refer to the range of allowed ranks that a particular alternative should attain, or to constraints on the final scores of the alternatives. We develop a mathematical model for incorporating such preference information via mixed‐integer linear programming (MILP). Then, we discuss how decision making could be supported with the use of the already proposed extreme ranking analysis (ERA), which indicates the best and worst ranks gained by each alternative over the set of compatible preference model instances. We also introduce a new interactive UTA‐like technique, which aims at selecting a single value function representing the outcomes of ERA. In the interactive process, the decision maker (DM) is assigning priorities to different pre‐defined targets, which are built on results of ERA, and refer to the comparison of the best and/or worst ranks for pairs of alternatives. In particular, the DM may choose to emphasize or neglect the advantage of some alternatives over the others, in terms of results of ERA. In this way, one obtains a synthetic representation of extreme ranking analysis at a higher level of abstraction.