IDEAS home Printed from https://ideas.repec.org/a/gam/jmathe/v11y2023i2p445-d1035646.html
   My bibliography  Save this article

On Modeling of Sorted Cost Consensus Negotiation Considering Efficiency and Time Based on the Stochastic Programming

Author

Listed:
  • Yi Zhou

    (School of Management Science and Engineering, Nanjing University of Information Science and Technology, Nanjing 210044, China)

  • Chonglan Guo

    (Collaborative 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, China)

  • Guo Wei

    (Department of Mathematics and Computer Science, The University of North Carolina at Pembroke, Pembroke, NC 28372, USA)

  • Enrique Herrera-Viedma

    (Andalusian Research Institute in Data Science and Computational Intelligence, Department of Computer Science and AI, University of Granada, 18071 Granada, Spain)

Abstract

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.

Suggested Citation

  • Yi Zhou & Chonglan Guo & Guo Wei & Enrique Herrera-Viedma, 2023. "On Modeling of Sorted Cost Consensus Negotiation Considering Efficiency and Time Based on the Stochastic Programming," Mathematics, MDPI, vol. 11(2), pages 1-37, January.
  • Handle: RePEc:gam:jmathe:v:11:y:2023:i:2:p:445-:d:1035646
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/2227-7390/11/2/445/pdf
    Download Restriction: no

    File URL: https://www.mdpi.com/2227-7390/11/2/445/
    Download Restriction: no
    ---><---

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:gam:jmathe:v:11:y:2023:i:2:p:445-:d:1035646. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: MDPI Indexing Manager (email available below). General contact details of provider: https://www.mdpi.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.