首页> 外文期刊>The International Journal of Advanced Manufacturing Technology >Nash bargaining game model for two parallel stages process evaluation with shared inputs
【24h】

Nash bargaining game model for two parallel stages process evaluation with shared inputs

机译:用于共享输入的两个并行阶段过程评估的纳什讨价还价博弈模型

获取原文
获取原文并翻译 | 示例
           

摘要

Data envelopment analysis is a non-parametric technique for evaluating peer decision making units (DMUs) with using multiple inputs to produce multiple outputs. In the real world, DMUs usually have complex structures. One of these structures is a two-stage process with intermediate measures. In this structure, there are two stages and each stage uses inputs to produce outputs, separately where the outputs of the first stage are the inputs for the second stage. Cooperative model such as centralized model and non-cooperative model are game theoretic approaches to evaluate two-stage processes. Non-cooperative model supposes that one of the stages is the leader and another stage is the follower, whereas in the centralized model, both stages are evaluated simultaneously. In this paper, we propose a game theoretic model based on the Nash bargaining game to calculate weights when parallel stages with shared inputs compete to reach a high efficiency in the competitive strategy. Two data sets including the bank branches and thermal power plants in Iran are used to show the abilities of proposed model. This model can be applied in other processes such as supply chain, manufacturing and public service units.
机译:数据包络分析是一种非参数技术,用于通过使用多个输入来产生多个输出来评估同级决策单元(DMU)。在现实世界中,DMU通常具有复杂的结构。这些结构之一是具有中间措施的两阶段过程。在此结构中,有两个阶段,每个阶段使用输入来产生输出,而第一阶段的输出是第二阶段的输入。合作模型(例如集中模型和非合作模型)是评估两个阶段过程的博弈论方法。非合作模型假设其中一个阶段是领导者,另一个阶段是跟随者,而在集中式模型中,这两个阶段是同时评估的。在本文中,我们提出了一个基于Nash讨价还价博弈的博弈理论模型,用于计算具有共享输入的并行阶段竞争以在竞争策略中达到较高效率时的权重。使用两个数据集(包括伊朗的银行分行和火力发电厂)来说明所建议模型的能力。该模型可以应用于其他过程,例如供应链,制造和公共服务部门。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号