Abstract
Individual consistency and group consensus are both important when seeking reliable and satisfying solutions for group decision making (GDM) problems using additive preference relations (APRs). In this paper, two new algorithms are proposed to facilitate the consensus reaching process, the first of which is used to improve the individual consistency level, and the second of which is designed to assist the group to achieve a predefined consensus level. Unlike previous GDM studies for consistency and consensus building, the proposed algorithms are essentially heuristic, modify only some of the elements in APRs to reduce the number of preference modifications in the consistency and consensus process, and have modified preferences that belong to the original evaluation scale to make the generated suggestions easier to understand. In particular, the consensus algorithm ensures that the individual consistency level is still acceptable when the predefined consensus level is achieved. Finally, classical examples and simulations are given to demonstrate the effectiveness of the proposed approaches.
Original language | English |
---|---|
Pages (from-to) | 1167-1191 |
Number of pages | 25 |
Journal | Group Decision and Negotiation |
Volume | 28 |
Issue number | 6 |
Early online date | 17 Sept 2019 |
DOIs | |
Publication status | Published - 1 Dec 2019 |
Bibliographical note
The acceptance date for this record is provisional and based upon the month of publication for the article.Keywords
- Additive preference relation
- Consensus
- Consistency
- Group decision making