IDEAS home Printed from https://ideas.repec.org/a/taf/tjorxx/v74y2023i7p1712-1729.html
   My bibliography  Save this article

Minimum cost consensus model with loss aversion based large-scale group decision making

Author

Listed:
  • Yingying Liang
  • Yanbing Ju
  • Jindong Qin
  • Witold Pedrycz
  • Peiwu Dong

Abstract

In minimum cost consensus problems, to accomplish the group consensus, decision makers accommodate their initial discrepant opinions based on the unit adjustment costs. During this process, decision makers may exhibit loss aversion, which results in extra expenses when participants feel loss in contrast to their reference opinion adjustments. Existing minimum cost consensus models pay little attention to the loss-averse preference. Hence, to fill up this gap, a minimum cost consensus model with loss aversion (MCCM-LA) is established and the desired properties are analyzed. To manage large-scale group decision making problems, we first propose an integrated opinion similarity, connectivity similarity and behavior similarity clustering algorithm to divide decision makers into multiple subgroups. Balancing the individual adjustment willingness and consensus reaching efficiency, a two-stage consensus reaching mechanism is further designed based on MCCM-LA to realize the accordant opinion. Finally, the effectiveness and feasibility of the proposed method are demonstrated by sensitivity and comparative analyses with an illustrative example.

Suggested Citation

  • Yingying Liang & Yanbing Ju & Jindong Qin & Witold Pedrycz & Peiwu Dong, 2023. "Minimum cost consensus model with loss aversion based large-scale group decision making," Journal of the Operational Research Society, Taylor & Francis Journals, vol. 74(7), pages 1712-1729, July.
  • Handle: RePEc:taf:tjorxx:v:74:y:2023:i:7:p:1712-1729
    DOI: 10.1080/01605682.2022.2110002
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1080/01605682.2022.2110002
    Download Restriction: Access to full text is restricted to subscribers.

    File URL: https://libkey.io/10.1080/01605682.2022.2110002?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    More about this item

    Statistics

    Access and download statistics

    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:taf:tjorxx:v:74:y:2023:i:7:p:1712-1729. 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: Chris Longhurst (email available below). General contact details of provider: http://www.tandfonline.com/tjor .

    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.