A two-stage dynamic group decision making method for processing ordinal information

In group decision making (GDM) problems, ordinal data provide a convenient way of articulating preferences from decision makers (DMs). A number of GDM models have been proposed to aggregate such kind of preferences in the literature. However, most of the GDM models that handle ordinal preferences suffer from two drawbacks: (1) it is difficult for the GDM models to manage conflicting opinions, especially with a large number of DMs; and (2) the relationships between the preferences provided by the DMs are neglected, and all DMs are assumed to be of equal importance, therefore causing the aggregated collective preference not an ideal representative of the group\u27s decision. In order to overcome these problems, a two-stage dynamic group decision making method for aggregating ordinal preferences is proposed in this paper. The method consists of two main processes: (i) a data cleansing process, which aims to reduce the influence of conflicting opinions pertaining to the collective decision prior to the aggregation process; as such an effective solution for undertaking large-scale GDM problems is formulated; and (ii) a support degree oriented consensus-reaching process, where the collective preference is aggregated by using the Power Average (PA) operator; as such, the relationships of the arguments being aggregated are taken into consideration (i.e., allowing the values being aggregated to support each other). A new support function for the PA operator to deal with ordinal information is defined based on the dominance-based rough set approach. The proposed GDM model is compared with the models presented by Herrera-Viedma et al. An application related to controlling the degradation of the hydrographic basin of a river in Brazil is evaluated. The results demonstrate the usefulness of the proposed method in handling GDM problems with ordinal information