On Modeling of Sorted Cost Consensus Negotiation Considering Efficiency and Time Based on the Stochastic Programming
In the consensus reaching process (CRP) permitting negotiation, the efficiency of negotiation is affected by the order of negotiation with decision makers (DMs), the time, and the number of moderators. In this paper, the sorted negotiation against DMs considering efficiency and time is initiated int...
| Main Authors: | , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
MDPI AG
2023-01-01
|
| Series: | Mathematics |
| Subjects: | |
| Online Access: | https://www.mdpi.com/2227-7390/11/2/445 |
| _version_ | 1797439009083883520 |
|---|---|
| author | Yi Zhou Chonglan Guo Guo Wei Enrique Herrera-Viedma |
| author_facet | Yi Zhou Chonglan Guo Guo Wei Enrique Herrera-Viedma |
| author_sort | Yi Zhou |
| collection | DOAJ |
| description | In the consensus reaching process (CRP) permitting negotiation, the efficiency of negotiation is affected by the order of negotiation with decision makers (DMs), the time, and the number of moderators. In this paper, the sorted negotiation against DMs considering efficiency and time is initiated into consensus decision making, which can improve the speed and effectiveness of consensus. Based on the opinion dynamics (opinion evolution), uniform and normal distributions are used to describe the uncertainty of DMs’ opinions and negotiation time, the opinion order efficiency and cost coefficient are coined, and the cost-constrained optimal efficiency sorted negotiation model and the optimal efficiency sorted negotiation model involving multiple moderators and time constraints are respectively constructed. The optimal solution of the chance-constrained model is obtained in the context of China’s urban demolition negotiation using an improved genetic algorithm, and an optimum set of influential individuals based on opinion similarity is introduced so that assessment criteria for validating the reasonableness of the sorting sequence are determined. Sorted consensus negotiation combined with complex scenarios such as different representation formats of opinions, characteristics of DMs, other solving algorithms, Bayesian dynamics, etc. can be included in future works. |
| first_indexed | 2024-03-09T11:45:36Z |
| format | Article |
| id | doaj.art-8d8532f71c914bab86ab04f5587c1e03 |
| institution | Directory Open Access Journal |
| issn | 2227-7390 |
| language | English |
| last_indexed | 2024-03-09T11:45:36Z |
| publishDate | 2023-01-01 |
| publisher | MDPI AG |
| record_format | Article |
| series | Mathematics |
| spelling | doaj.art-8d8532f71c914bab86ab04f5587c1e032023-11-30T23:22:20ZengMDPI AGMathematics2227-73902023-01-0111244510.3390/math11020445On Modeling of Sorted Cost Consensus Negotiation Considering Efficiency and Time Based on the Stochastic ProgrammingYi Zhou0Chonglan Guo1Guo Wei2Enrique Herrera-Viedma3School of Management Science and Engineering, Nanjing University of Information Science and Technology, Nanjing 210044, ChinaCollaborative Innovation Center on Forecast and Evaluation of Meteorological Disasters, The Research Institute for Risk Governance and Emergency DecisionMaking, School of Management Science and Engineering, Nanjing University of Information Science and Technology, Nanjing 210044, ChinaDepartment of Mathematics and Computer Science, The University of North Carolina at Pembroke, Pembroke, NC 28372, USAAndalusian Research Institute in Data Science and Computational Intelligence, Department of Computer Science and AI, University of Granada, 18071 Granada, SpainIn the consensus reaching process (CRP) permitting negotiation, the efficiency of negotiation is affected by the order of negotiation with decision makers (DMs), the time, and the number of moderators. In this paper, the sorted negotiation against DMs considering efficiency and time is initiated into consensus decision making, which can improve the speed and effectiveness of consensus. Based on the opinion dynamics (opinion evolution), uniform and normal distributions are used to describe the uncertainty of DMs’ opinions and negotiation time, the opinion order efficiency and cost coefficient are coined, and the cost-constrained optimal efficiency sorted negotiation model and the optimal efficiency sorted negotiation model involving multiple moderators and time constraints are respectively constructed. The optimal solution of the chance-constrained model is obtained in the context of China’s urban demolition negotiation using an improved genetic algorithm, and an optimum set of influential individuals based on opinion similarity is introduced so that assessment criteria for validating the reasonableness of the sorting sequence are determined. Sorted consensus negotiation combined with complex scenarios such as different representation formats of opinions, characteristics of DMs, other solving algorithms, Bayesian dynamics, etc. can be included in future works.https://www.mdpi.com/2227-7390/11/2/445stochastic programminggenetic algorithmgroup decisions and negotiationssorted cost consensusopinion order efficiency |
| spellingShingle | Yi Zhou Chonglan Guo Guo Wei Enrique Herrera-Viedma On Modeling of Sorted Cost Consensus Negotiation Considering Efficiency and Time Based on the Stochastic Programming Mathematics stochastic programming genetic algorithm group decisions and negotiations sorted cost consensus opinion order efficiency |
| title | On Modeling of Sorted Cost Consensus Negotiation Considering Efficiency and Time Based on the Stochastic Programming |
| title_full | On Modeling of Sorted Cost Consensus Negotiation Considering Efficiency and Time Based on the Stochastic Programming |
| title_fullStr | On Modeling of Sorted Cost Consensus Negotiation Considering Efficiency and Time Based on the Stochastic Programming |
| title_full_unstemmed | On Modeling of Sorted Cost Consensus Negotiation Considering Efficiency and Time Based on the Stochastic Programming |
| title_short | On Modeling of Sorted Cost Consensus Negotiation Considering Efficiency and Time Based on the Stochastic Programming |
| title_sort | on modeling of sorted cost consensus negotiation considering efficiency and time based on the stochastic programming |
| topic | stochastic programming genetic algorithm group decisions and negotiations sorted cost consensus opinion order efficiency |
| url | https://www.mdpi.com/2227-7390/11/2/445 |
| work_keys_str_mv | AT yizhou onmodelingofsortedcostconsensusnegotiationconsideringefficiencyandtimebasedonthestochasticprogramming AT chonglanguo onmodelingofsortedcostconsensusnegotiationconsideringefficiencyandtimebasedonthestochasticprogramming AT guowei onmodelingofsortedcostconsensusnegotiationconsideringefficiencyandtimebasedonthestochasticprogramming AT enriqueherreraviedma onmodelingofsortedcostconsensusnegotiationconsideringefficiencyandtimebasedonthestochasticprogramming |