A two-stage distributionally robust maximum expert consensus model with asymmetric costs and risk aversion

被引:1
|
作者
Ma, Yifan [1 ]
Ji, Ying [1 ]
Qu, Shaojian [2 ]
Li, Yingying [1 ]
机构
[1] Shanghai Univ, Sch Management, Shanghai 200444, Peoples R China
[2] Nanjing Univ Informat Sci & Technol, Sch Management Sci & Engn, Nanjing 210044, Peoples R China
基金
中国国家自然科学基金;
关键词
Maximum expert consensus model; Uncertain adjustment costs; Risk aversion; Asymmetric costs; MINIMUM-COST; DECISION-MAKING;
D O I
10.1016/j.ins.2024.121518
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
The maximum expert consensus model (MECM) emerges as a widely used consensus optimization model in group decision making (GDM). However, contemporary complexities in decision-making environment lead to the asymmetry and uncertainty of adjustment costs of decision-makers (DMs), which are critical during the consensus reaching process (CRP). Additionally, the risks emerging with the uncertainty during CRP should also be analyzed. Therefore, this paper focuses on developing the two-stage distributionally robust MECM (DRO-MECM) with asymmetric adjustment costs under an uncertain environment to improve the CRP. Specifically, we propose a MECM with asymmetric costs. Moreover, we build the two-stage DRO-MECM based on the mean-CVaR under two uncertain scenarios, allowing it to manage uncertain costs effectively while considering the risk preferences of DMs. The first stage aims to maximize the number of DM within consensus and the second stage seeks to minimize the consensus cost. Finally, the applicability of the proposed models is demonstrated by applying them to the allocation of healthcare and security capacity enhancement subsidy funds in China. The efficiency of the models is further corroborated by sensitivity analysis and comparison analysis.
引用
收藏
页数:21
相关论文
共 50 条
  • [41] Discrete approximation of two-stage stochastic and distributionally robust linear complementarity problems
    Chen, Xiaojun
    Sun, Hailin
    Xu, Huifu
    MATHEMATICAL PROGRAMMING, 2019, 177 (1-2) : 255 - 289
  • [42] Discrete approximation of two-stage stochastic and distributionally robust linear complementarity problems
    Xiaojun Chen
    Hailin Sun
    Huifu Xu
    Mathematical Programming, 2019, 177 : 255 - 289
  • [43] Decision bounding problems for two-stage distributionally robust stochastic bilevel optimization
    Xiaojiao Tong
    Manlan Li
    Hailin Sun
    Journal of Global Optimization, 2023, 87 : 679 - 707
  • [44] Two-stage distributionally robust optimization for integrated train stop planning and timetabling
    Zhang C.-T.
    Qi J.-G.
    Yang K.
    Yang L.-X.
    Gao Z.-Y.
    Gao Y.
    Kongzhi yu Juece/Control and Decision, 2023, 38 (04): : 1065 - 1073
  • [45] Data-driven two-stage sparse distributionally robust risk optimization model for location allocation problems under uncertain environment
    Liu, Zhimin
    AIMS MATHEMATICS, 2022, 8 (02): : 2910 - 2939
  • [46] A Two-Stage Distributionally Robust Optimization Model for Wind Farms and Storage Units Jointly Operated Power Systems
    Li, Panpan
    Song, Liangyun
    Qu, Jixian
    Huang, Yuehui
    Wu, Xiaoyun
    Lu, Xi
    Xia, Shiwei
    IEEE ACCESS, 2021, 9 : 111132 - 111142
  • [47] A Data-Driven Two-Stage Distributionally Robust Planning Tool for Sustainable Microgrids
    Dehghan, Shahab
    Nakiganda, Agnes
    Aristidou, Petros
    2020 IEEE POWER & ENERGY SOCIETY GENERAL MEETING (PESGM), 2020,
  • [48] Two-Stage Distributionally Robust Edge Node Placement Under Endogenous Demand Uncertainty
    Cheng, Jiaming
    Nguyen, Duong Thuy Anh
    Nguyen, Duong Tung
    IEEE INFOCOM 2024-IEEE CONFERENCE ON COMPUTER COMMUNICATIONS, 2024, : 2388 - 2397
  • [49] A stochastic dual dynamic programming method for two-stage distributionally robust optimization problems
    Tong, Xiaojiao
    Yang, Liu
    Luo, Xiao
    Rao, Bo
    OPTIMIZATION METHODS & SOFTWARE, 2020, 35 (05): : 1002 - 1021
  • [50] Decomposition and discrete approximation methods for solving two-stage distributionally robust optimization problems
    Yannan Chen
    Hailin Sun
    Huifu Xu
    Computational Optimization and Applications, 2021, 78 : 205 - 238