Markov decision process based multi-round negotiation in manufacturing service collaboration under dynamic pressure conditions

被引:0
|
作者
Liu, Bo [1 ]
Zhang, Yongping [1 ]
Sun, Hanlin [2 ]
Sheng, Guojun [3 ]
Zou, Xiaofu [4 ]
Cheng, Ying [1 ]
Tao, Fei [1 ,5 ]
机构
[1] Beihang Univ, Sch Automat Sci & Elect Engn, Beijing 100191, Peoples R China
[2] Beihang Univ, Sino French Engineer Sch, Beijing 100191, Peoples R China
[3] COSMO Ind Intelligence Res Inst Co Ltd, Qingdao 266426, Peoples R China
[4] Beihang Univ, Sch Artificial Intelligence, Beijing 100191, Peoples R China
[5] Beihang Univ, Int Res Inst Multidisciplinary Sci, Digital Twin Int Res Ctr, Beijing 100191, Peoples R China
基金
中国国家自然科学基金;
关键词
Manufacturing service collaboration; Bayesian Nash equilibrium; Three-level pressure; Dynamic negotiation; Markov decision process; FRAMEWORK;
D O I
10.1016/j.eswa.2025.127213
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Due to the diverse interests and preferences of stakeholders in manufacturing service collaboration (MSC), negotiation plays a crucial role in achieving satisfactory outcomes. Although consumers and manufacturing service (MS) providers share the same negotiation context, they hold different positions and face distinct pressures from negotiation counterparts, competitors, and inherent conditions. This paper investigates the multiround negotiation in an incomplete information and dynamic pressure conditions consisting of the consumers and MS providers. First, due to changes in the number of negotiators, proposals, negotiation round, etc. in the MSC that lead to dynamic pressure conditions, a three-level pressure assessment model is constructed. Next, considering the presence of both public and private information in the MSC, a multi-attribute incomplete information game model is constructed. Finally, based on Markov decision process, an algorithm for seeking Bayesian Nash equilibrium is designed to solve this dynamic negotiation problem. Through numerical experiments, the effectiveness and superiority of the constructed model and the proposed algorithm are verified. The results show that the task completion rate is ensured, the negotiation round is remarkedly shortened, and the satisfaction of the consumers and MS providers is improved. The proposed algorithm is adaptable to most pressure conditions.
引用
收藏
页数:14
相关论文
共 7 条
  • [1] Dynamic Service Migration in Mobile Edge Computing Based on Markov Decision Process
    Wang, Shiqiang
    Urgaonkar, Rahul
    Zafer, Murtaza
    He, Ting
    Chan, Kevin
    Leung, Kin K.
    IEEE-ACM TRANSACTIONS ON NETWORKING, 2019, 27 (03) : 1272 - 1288
  • [2] Reliability analysis of multi-state systems for subsea connector under dynamic pressure based on the Markov process
    Liu, Weifeng
    Sun, Haiting
    Yun, Feihong
    MEASUREMENT, 2025, 252
  • [3] Dynamic Resource Allocation Strategy of Multi-Objective Fuzzy Optimization Based on Markov Decision Process
    Zhang, Yu-Ting
    Yang, Jing-Yu
    Wu, Yang
    IEEE ACCESS, 2023, 11 : 99607 - 99613
  • [4] Multi-robot Collaboration Based on Markov Decision Process in Robocup3D Soccer Simulation Game
    Cui Xuanyu
    Liang Zhiwei
    Yang Yongyi
    Shen Ping
    Wang Jiawen
    Liu Haoran
    Fan Kai
    2015 27TH CHINESE CONTROL AND DECISION CONFERENCE (CCDC), 2015, : 4345 - 4349
  • [5] Remaining useful life prediction for engineering systems under dynamic operational conditions: A semi-Markov decision process-based approach
    Diyin TANG
    Jinrong CAO
    Jinsong YU
    Chinese Journal of Aeronautics, 2019, 32 (03) : 627 - 638
  • [6] Remaining useful life prediction for engineering systems under dynamic operational conditions: A semi-Markov decision process-based approach
    Tang, Diyin
    Cao, Jinrong
    Yu, Jinsong
    CHINESE JOURNAL OF AERONAUTICS, 2019, 32 (03) : 627 - 638
  • [7] Remaining useful life prediction for engineering systems under dynamic operational conditions: A semi-Markov decision process-based approach
    Diyin TANG
    Jinrong CAO
    Jinsong YU
    Chinese Journal of Aeronautics , 2019, (03) : 627 - 638