Abstract

In many real-life large scale group decision making problems, it can be necessary and convenient a consensus reaching process, which is an iterative procedure aimed at seeking a high degree of agreement amongst experts’ preferences before making a group decision. Although a wide variety of models and approaches have been proposed and developed to support consensus reaching processes, in large groups there are some important aspects that still require further study, such as the treatment of experts’ behaviors that could hamper reaching the wanted agreement. More specifically, it would be necessary an approach to deal with experts properly, based on the overall behavior they present during the discussion process, as well as reinforcing repeated patterns of cooperative (or uncooperative) behavior adopted by experts. This paper presents an expert weighting methodology for consensus reaching processes in large-scale group decision making, that incorporates the use of uninorm aggregation operators. Such operators, which are characterized by their property of full reinforcement, are used in the proposed methodology to allow the experts’ weighting based on their overall behavior during the consensus process and the behavior evolution across the time. This proposal is integrated in a consensus model for large-scale group decision making problems under uncertainty, and it is put in practice to show an illustrative example of its effectiveness and improvements with respect to other approaches.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.