Abstract
Consensus or conflict agreements, and how these change over time, have significant consequences for understanding the network behavior of human beings, especially when it is necessary to have agreements to move companies and countries forward peacefully. This paper proposes a new Greatest Common Decision Maker (GCDM) aggregation voting procedure applied to square preference matrices of n alternatives and n decision makers. An analysis of the mathematical combinatory ranking of consensus and conflicts generated by the GCDM is realized, and compared to the well-known Borda, Pluralism and Condorcet aggregation procedures to cover the entire class of dynamic accountable group decision-making phenomena. A classification for the family of magic squares is reviewed and it is determined that a conflict decision matrix corresponds to a Latin square. As an original contribution, a 2D color heatmap is generated as a visual tool to compare the consensus and conflict cases generated by the compared methods. Finally, a new consensus reaching model is proposed to compare these aggregation methods defining cost and effort change matrices to convert the cases of conflicts into consensus according to the change in individual preferences. The incorporation of social concepts into our research makes the results obtained stronger.
Subject
General Mathematics,Engineering (miscellaneous),Computer Science (miscellaneous)
Reference116 articles.
1. Solución de Conflictos
2. Conflict Resolution Using the Graph Model: Strategic Interactions in Competition and Cooperation;Xu,2018
3. A Methodology for the Analysis of Cooperation and Conflict, in the Consensus-Negotiation;García-del-Valle,2022
4. Toward Normative Expert Systems: Part I The Pathfinder Project
5. The general theory of decisions